By Topic

Comments on "Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Carlet, C. ; LAGA, Department of Mathematics, Universities of Paris 8 and Paris 13 and CNRS, Saint-Denis, France

We show that the first of the two constructions by Q. Wang, J. Peng, H. Kan, and X. Xue, IEEE Transactions on Information Theory, vol. 56, no. 6, pp. 3048-3053, 2010, of Boolean functions satisfying the main criteria for filter functions in stream ciphers, is the same as the construction studied by K. Feng and the author at Asiacrypt 2008, LNCS 5350, pp. 425-440. We observe that the bounds shown on the nonlinearities of the functions in this IEEE paper are similar to those shown in the Asiacrypt paper. We point out that these kinds of functions can be implemented in a more efficient way than usually believed.

Published in:

Information Theory, IEEE Transactions on  (Volume:57 ,  Issue: 7 )