期刊文献+

ON THE DEGREE OF COMPLETENESS OF CRYPTOGRAPHIC FUNCTIONS 被引量:1

ON THE DEGREE OF COMPLETENESS OF CRYPTOGRAPHIC FUNCTIONS
下载PDF
导出
摘要 This paper discusses the degree of completeness of cryptographic functions, which is one of the cryptographic criteria should be considered in the design of stream ciphers. We establish the relationships between the degree of completeness and other cryptographic criteria. For resilient Boolean functions, a method to enhance the degree of completeness is proposed, while the nonlinearity and the algebraic degree do not decrease. Moreover, two constructions of resilient functions are provided, which have optimal degree of completeness, high nonlinearity, and high algebraic degree. This paper discusses the degree of completeness of cryptographic functions, which is one of the cryptographic criteria should be considered in the design of stream ciphers. We establish the re- lationships between the degree of completeness and other cryptographic criteria. For resilient Boolean functions, a method to enhance the degree of completeness is proposed, while the nonlinearity and the algebraic degree do not decrease. Moreover, two constructions of resilient functions are provided, which have optimal degree of completeness, high nonlinearity, and high algebraic degree.
出处 《Journal of Electronics(China)》 2014年第5期489-495,共7页 电子科学学刊(英文版)
基金 Supported by the National Key Basic Research Program of China(No.2013CB834204)
关键词 Degree of completeness Multi-output Boolean functions NONLINEARITY Resiliency Linear structures Degree of completeness Multi-output Boolean functions Nonlinearity Resiliency Linearstructures
  • 相关文献

参考文献19

  • 1C. E. Shannon. Communication theory of secrecy systems. Bell System Technical Journal, 28(1949)4, 656-715.
  • 2B. Preneel, A. Bosselaers, V. Rijmen, et al: Com- ments by the NESSIE project on the AES finalists. AES Round 2 public comment, http://www.uist, gov/ aes, 2000.
  • 3J. B. Kam and G. I. Davida. Structured design of substitution-permutation encryption networks. IEEE Transactions on Computers, C-28(1979)10, 747-753.
  • 4H. Feisteh Cryptography and computer privacy. Scientific American, 228(1973)5, 15-23.
  • 5R. Forr. Methods and instruments for designing S-boxes. Journal of Cryptology, 2(1990)3, 115-130.
  • 6A. F. Webster and S. E. Tavares. On the design of S- boxes. Advances in Cryptology--CRYPTO'85, Lec- ture Notes in Computer Science, Vol. 218, Berlin, Springer-Verlag, 1986, 523-534.
  • 7N. T. Courtois and J. Pieprzyk. Cryptanalysis of block ciphers with overdefined systems of equations. Advances in Cryptology--ASIACRYPT 2002, Lecture Notes in Computer Science, Vol. 2501, Berlin, Springer- Verlag, 2002, 267-287.
  • 8N. T. Courtois and W. Meier. Algebraic attacks on stream ciphers with linear feedback. Advances in Cryptology--EUROCRYPT 2003, Lecture Notes in Computer Science, Voh 2656, Berlin, Springer-Verlag, 2003, 345-359.
  • 9A. Menezes, P. VanOorschot, and S. Vanstone. Handbook of Applied Cryptography. Boca Raton, USA, CRC Press, 1996, Chapter 6.
  • 10E. Pasalic. Maiorana-McFarland class: degree opti- mization and algebraic properties. IEEE Transactions on Information Theory, 52(2006)10, 4581-4594.

同被引文献3

引证文献1

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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