期刊文献+

Enumeration of Generalized Linear Orthomorphism in the Vector Space F_q^n

Enumeration of Generalized Linear Orthomorphism in the Vector Space F_q^n
原文传递
导出
摘要 The conception of orthomorphism has been generalized in this paper, and a counting formula on the generalized linear orthomorphism in the vector space over the Galois field with the arbitrary prime number p as the characteristic is obtained. Thus, the partial generation algorithm of generalized linear orthomorphism is achieved. The counting formula of the linear orthomorphism in the vector space over the finite field with characteristic 2 is the special case in our results. Furthermore, the generalized linear orthomorphism generated and discussed in this paper can gain the maximum branch number when they are designed as P-permutations. The conception of orthomorphism has been generalized in this paper, and a counting formula on the generalized linear orthomorphism in the vector space over the Galois field with the arbitrary prime number p as the characteristic is obtained. Thus, the partial generation algorithm of generalized linear orthomorphism is achieved. The counting formula of the linear orthomorphism in the vector space over the finite field with characteristic 2 is the special case in our results. Furthermore, the generalized linear orthomorphism generated and discussed in this paper can gain the maximum branch number when they are designed as P-permutations.
出处 《Wuhan University Journal of Natural Sciences》 CAS 2012年第1期43-47,共5页 武汉大学学报(自然科学英文版)
基金 Supported by the National Natural Science Foundation of China (60970115, 91018008)
关键词 block cipher P-permutation generalized linear orthomorphism the branch number counting formula block cipher P-permutation generalized linear orthomorphism the branch number counting formula
  • 相关文献

参考文献4

二级参考文献24

  • 1吕述望 刘振华 等.置换理论及其密码学应用[M].北京:中国科学院DCS中心,1996..
  • 2武传坤.密码学中的布尔函数:博士论文[M].西安电子科技大学,1993.60-71.
  • 3Zhang Huan-guo,Liu Yu-zhen.Introduction to cryptology[M].Wuhan:Wuhan University Press,2003.
  • 4Mac Williams F J,Sloane N J A.The theory of error correcting codes[M].North-Holland Publishing Company,1977.
  • 5Daemen J,Rijmen V.AES proposal:RIJNDAEL[EB/ OL].http://www.nist.gov./aes,2004,01.
  • 6Heys H M,Tavares S E.The design of substitution-permutation networks resistant to differential and linear cryptanalysis[C].Proceedings of 2nd ACM Conference on Computer and Communications Security,Fairfax,Virginia,1994,148-155.
  • 7Heys H M,Tavares S E.The design of product ciphers resistant to differential and linear cryptanalysis[J].Journal of Cryptology,1996,9(1):1-19.
  • 8Heys H M,Tavares S E.Avalanche characteristics of substitution-permutation encryption networks[J].IEEE Trans.Comp.,Sept.1995,44,1131-1139.
  • 9Biham E,Shamir A.Differential cryptanalysis of DES-like cryptosystems[J].Journal of Cryptology,1991,4(1):3-72.
  • 10Matsui M.The first experimental cryptanalysis of the data encryption standard[C].Advances in Cryptology:Proc.of CRYPTO '94,Springer-Verlag,Berlin,1994,1-11.

共引文献61

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部