Higher-order nonlinearity of Kasami functions

References

• Canteaut , A. , Charpin , P. and Kyureghyan , G. M. 2008 . A new class of monomial bent functions . Finite Fields Appl. , 14 : 221 – 241 .
   Web of Science ®Google Scholar
• Carlet , C. “ Boolean functions for cryptography and error correcting codes ” . In Boolean Methods and Models , Edited by: Crama , Y. and Hammer , P. Cambridge , , UK : Cambridge University Press . [Online], preprint. Available at http://www-rocq.inria.fr/codes/Claude.Carlet/pubs.html.
   Google Scholar
• Carlet , C. “ Vectorial (multi-output) Boolean functions for cryptography ” . In Boolean Methods and Models , Edited by: Crama , Y. and Hammer , P. Cambridge , , UK : Cambridge University Press . [Online], preprint. Available at http://www-rocq.inria.fr/codes/Claude.Carlet/pubs.htm.
   Google Scholar
• Carlet , C. 2008 . Recursive lower bounds on the nonlinearity profile of Boolean functions and their applications . IEEE Trans. Inform. Theory , 54 ( 3 ) : 1262 – 1272 .
   Web of Science ®Google Scholar
• Carlet , C. and Mesnager , S. 2007 . Improving the upper bounds on the covering radii of binary Reed–Muller codes . IEEE Trans. Inform. Theory , 53 ( 1 ) : 162 – 173 .
   Web of Science ®Google Scholar
• Cohen , G. , Honkala , I. , Litsyn , S. and Lobstein , A. 1997 . Covering Codes , Amsterdam , , The Netherlands : North-Holland .
   Google Scholar
• Courtois , N. Higher Order Correlation Attacks, XL Algorithm and Cryptanalysis of Toyocrypt . Proceedings of ICISC 2002 (Lecture Notes in Computer Science) Vol. 2587 . pp. 182 – 199 . Berlin , , Germany : Springer-Verlag .
   Google Scholar
• Dumer , I. , Kabatiansky , G. and tavernier , C. List Decoding of Second Order Reed–Muller Codes up to the Johnson Bound with Almost Linear Complexity . Proceedings of the IEEE International Symposium on Information Theory . pp. 138 – 142 . Seattle , WA
   Google Scholar
• Fourquet , R. and tavernier , C. 2008 . An improved list decoding algorithm for the second order Reed–Muller codes and its applications . Designs Codes Cryptogr. , 49 : 323 – 340 .
   Web of Science ®Google Scholar
• Garg , M. and Gangopadhyay , S. 2011 . A lower bound of the second-order nonlinearities of Boolean bent functions . Fund. Inform. Euro. Assoc. Theor. Comput. Sci. , 111 ( 4 ) : 413 – 422 .
   Google Scholar
• Gangopadhyay , S. , Sarkar , S. and Telang , R. 2010 . On the lower bounds of the second order nonlinearities of some Boolean functions . Inform. Sci. , 180 : 266 – 273 .
   Web of Science ®Google Scholar
• R. Gode and S. Gangopadhyay, On second order nonlinearities of cubic monomial Boolean functions. Available at http://eprint.iacr.org/2009/502.pdf.
   Google Scholar
• Gode , R. and Gangopadhyay , S. 2010 . Third-order nonlinearities of a subclass of kasami functions . Cryptogr. Commun. , 2 : 69 – 83 .
   Google Scholar
• Golić , J. Fast Low Order Approximation of Cryptographic Functions . Proceedings of EUROCRYPT’96 (Lecture Notes in Computer Science) Vol. 1070 . pp. 268 – 282 . Berlin , , Germany : Springer-Verlag .
   Google Scholar
• Iwata , T. and Kurosawa , K. Probabilistic Higher Order Differential Attack and Higher Order Bent Functions . Proceedings of ASIACRYPT’99 (Lecture Notes in Computer Science) Vol. 1716 . pp. 62 – 74 . Berlin , , Germany : Springer-Verlag .
   Google Scholar
• Kabatiansky , G. and Tavernier , C. List Decoding of Second Order Reed–Muller Codes . Proceedings of the 18th International Symposium of Communication Theory and Applications . Ambleside , , UK
   Google Scholar
• Knudsen , L. R. and Robshaw , M. J.B. Non-linear Approximations in Linear Cryptanalysis . Proceedings of EUROCRYPT’96 (Lecture Notes in Computer Science) Vol. 1070 . pp. 224 – 236 . Berlin , , Germany : Springer-Verlag .
   Google Scholar
• N. Kolokotronis and K. Limniotis, Maiorana–MacFarland functions with high second-order nonlinearity, IACR Cryptology ePrint Archive, report 212, 2011.
   Google Scholar
• Kolokotronis , N. , Limniotis , K. and Kalouptsidis , N. 2009 . Best affine and quadratic approximations of particular classes of Boolean functions . IEEE Trans. Inform. Theory , 55 ( 11 ) : 5211 – 5222 .
   Web of Science ®Google Scholar
• Lidl , R. and Niederreiter , H. 1994 . Introduction to Finite Fields and Their Applications , Amsterdam : North-Holland .
   Google Scholar
• Li , X. , Hu , Y. and Gao , J. 2011 . Lower bounds on the second order nonlinearity of Boolean functions . Int. J. Found. Comput. Sci. , 22 ( 6 ) : 1331 – 1349 .
   Web of Science ®Google Scholar
• Lucas , E. 1887 . Thorie des functions numriques simplement priodiques . Am. J. Math. , 1 : 184 – 240 . pp. 289–321.
   Google Scholar
• MacWilliams , F. J. and Solane , N. J.A. 1978 . The Theory of Error-correcting Codes , Amsterdam : North-Holland .
   Google Scholar
• Matsui , M. Linear Cryptanalysis Method for DES Cipher . Proceedings of the EUROCRYPT’93 (Lecture Notes in Computer Science) Vol. 765 . pp. 386 – 397 .
   Google Scholar
• Maurer , U. M. New Approaches to the Design of Self-synchronizing Stream Ciphers . Proceedings of EUROCRYPT’91 (Lecture Notes in Computer Science) Vol. 547 . pp. 458 – 471 . Berlin , , Germany : Springer-Verlag .
   Google Scholar
• W. Millan, Low Order Approximation of Cipher Functions, Cryptographic Policy and Algorithms (Lecture notes in Computer Science) Vol. 1029, Springer-Verlag, Berlin, Germany, 1996, pp. 144–155.
   Google Scholar
• Rothaus , O. S. 1976 . On bent functions . J. Combin. Theory Ser. A , 20 : 300 – 305 .
   Web of Science ®Google Scholar
• Singh , D. 2011 . Second-order nonlinearities of some classes of cubic Boolean functions based on secondary constructions . Int. J. Comput. Sci. Inform. Technol. , 2 ( 2 ) : 786 – 791 .
   Google Scholar
• Sun , G. and Wu , C. 2009 . The lower bounds on the second order nonlinearity of three classes of Boolean functions with high nonlinearity . Inform. Sci. , 179 ( 3 ) : 267 – 278 .
   Web of Science ®Google Scholar
• Sun , G. and Wu , C. 2011 . The lower bound on the second-order nonlinearity of a class of Boolean function with high nonlinearity . Appl. Algebra Engrg. Comm. Comput. (AAECC) , 22 : 37 – 45 .
   Web of Science ®Google Scholar