收稿日期: 2015-01-05
修回日期: 2015-04-10
网络出版日期: 2015-11-15
基金资助
Supported by the National Natural Science Foundation of China (11271363)
The cardinalities of some certain Hamming constraint sets
Received date: 2015-01-05
Revised date: 2015-04-10
Online published: 2015-11-15
Supported by
Supported by the National Natural Science Foundation of China (11271363)
宋佳 , 陈玉福 . Hamming约束集的计数问题[J]. 中国科学院大学学报, 2015 , 32(6) : 721 -727 . DOI: 10.7523/j.issn.2095-6134.2015.06.001
It is difficult to find Boolean functions used in stream ciphers that can meet all the necessary performance criteria. Recently, two classes of Boolean functions with many good cryptographic properties have been proposed by Tu and Deng based on correctness of a combinatorial conjecture about binary strings distribution (we call it Hamming constraint set). Tu-Deng conjecture has attracted much attention from cryptographers. In this paper we give a new method to obtain the explicit formulas for the cardinalities of some certain Hamming constraint sets, which partially proves Tu-Deng conjecture.
Key words： Boolean function; Tu-Deng conjecture; Hamming weight
[1] Golomb S W, Gong G. Signal design for good correlation for wireless communication, cryptography and radar[M]. New York:Cambridge University Press, 2005.
[2] Carlet C, Ding C S. Highly nonlinear mappings[J]. Journal of Complexity, 2004, 20(2/3):205-244.
[3] Pei D Y, Qin W L. The correlation of a Boolean function with its variables[C]//Roy B, Okamoto E. Progress in Cryptology-INDOCRYPT 2000. Springer, Berlin Heidelberg, 2000, 1977:1-8.
[4] Siegenthaler T. Correlation immunity of non-linear combining functions for cryptographic applications[J]. IEEE Transaction on Information Theory, 1984, 30:776-780.
[5] Katz J, Lindell Y. Introduction to modern cryptography[M]. Washington DC:CRC PRESS, 2007.
[6] Matsui M. Linear cryptanalysis method for DES cipher[C]//Helleseth T. Advances in Cryptology-EUROCRYPT 1993. Springer, Berlin Heidelberg, 1994, 765:386-397.
[7] Courtois N T, Meier W. Algebraic attacks on stream ciphers with linear feedback[C]//Biham E. Advances in Cryptology-EUROCRYPT 2003. Springer, Berlin Heidelberg, 2003, 2656:345-359.
[8] Courtois N T. Fast algebraic attacks on stream ciphers with linear feedback[C]//Boneh D. Advances inCryptology-CRYPTO 2003. Springer, Berlin Heidelberg, 2003, 2729:176-194.
[9] Xie Y H, Hu L. A matrix construction of Boolean functions with maximum algebraic immunity[J]. Journal of Systems Science and Complexity, 2012, 25:792-801.
[10] Tu Z R, Deng Y P. A conjucture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity[J]. Designs, Codes and Cryptography, 2011, 60:1-14.
[11] Tu Z R, Deng Y P. Boolean functions optimizing most of the cryptographic criteria[J]. Discrete Applied Mathematics, 2012, 160:427-435.
[12] Langevin P, Leander G. Monomial bent functions and Stickelberger's theorem[J]. Finite Fields and Their Appilications, 2008, 14:727-742.
[13] Carlet C, Feng K Q. An infinite class of balanced functions with optimal algebraic immunity, good immunity to fast algebraic attacks and good nonlinearity[C]//Pieprzyk J. Advances in Cryptology-ASIACRYPT 2008. Springer, Berlin Heidelberg, 2008, 5350:425-440.
[14] Tu Z R. Design and analysis of Boolean functions under algebraic attacks[D]. Beijing:Academy of Mathematics and Systems Science, Chinese Academy of Sciences, 2009 (in Chinese).
[15] Cusick T W, Li Y, Stanica P. On a combinatorial conjecture[J/OL].[2014-12-20]. Crypology ePrint Archive. http://eprint.iacr.org/2009/554.pdf.
[16] Flori J P, Randriam H, Cohen G, et al. On a conjecture about binary strings distribution[C]//Carlet C, Pott A. Sequences and Their Applications-SETA 2010. Springer, Berlin Heidelberg, 2010, 6338:346-358.
[17] Cohen G, Flori J P. On a general combinatorial conjecture invovling addition mod 2k-1[J/OL].[2014-12-20]. Cryptology ePrint Archive. http://eprint.iacr.org/2011/400.pdf.
[18] Huang K, Li C, Fu S J. Note on the Tu-Deng conjecture[J]. Computer Science, 2012, 39:6-9 (in Chinese).
/
| 〈 |
|
〉 |
