A larger class of cryptographic boolean functions via a study of the maiorana-McFarland construction

92Citations
Citations of this article
45Readers
Mendeley users who have this article in their library.

Abstract

Thanks to a new upper bound, we study more precisely the nonlinearities of Maiorana-McFarland’s resilient functions. We characterize those functions with optimum nonlinearities and we give examples of functions with high nonlinearities. But these functions have a peculiarity which makes them potentially cryptographically weak. We study a natural super-class of Maiorana-McFarland’s class whose elements do not have the same drawback and we give examples of such functions achieving high nonlinearities.

Cite

CITATION STYLE

APA

Carlet, C. (2002). A larger class of cryptographic boolean functions via a study of the maiorana-McFarland construction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2442, pp. 549–564). Springer Verlag. https://doi.org/10.1007/3-540-45708-9_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free