Generalization of Boolean Functions Properties to Functions Defined over GF(p) | Science Publications

Journal of Computer Science

Saad Elmansori¹  B. E. Esam¹ 

关键词: Finite field;    coding theory;    cryptography;    walsh transform;    bent function;   

DOI  :  10.3844/jcssp.2012.809.814

学科分类：计算机科学（综合）

来源: Science Publications

【 摘 要 】

Problem statement: Traditionally, cryptographic applications designed on hardware have always tried to take advantage of the simplicity of implementation functions over GF(p), p = 2, to reduce costs and improve performance. On the contrast, functions defined over GF(p); p > 2, possess far better cryptographic properties than GF(2) functions. Approach: We generalize some of the previous results on cryptographic Boolean functions to functions defined over GF(p); p > 2. Results: We generalize Siegenthaler

【 授权许可】

Unknown