ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Journal of Complexity
Volume 20, Issues 2-3, April-June 2004, Pages 182-204
Festschrift for Harald Niederreiter, Special Issue on Coding and Cryptography
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (345 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.jco.2003.08.013    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2003 Elsevier Inc. All rights reserved.

On the confusion and diffusion properties of Maiorana–McFarland's and extended Maiorana–McFarland's functions

Claude Carlet E-mail The Corresponding Author, 1

INRIA, Domaine de Voluceau, Rocquencourt, BP 105, 78153 Le Chesnay Cedex, France

Received 12 November 2002; 
accepted 12 August 2003. 
Available online 15 January 2004.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

A practical problem in symmetric cryptography is finding constructions of Boolean functions leading to reasonably large sets of functions satisfying some desired cryptographic criteria. The main known construction, called Maiorana–McFarland, has been recently extended. Some other constructions exist, but lead to smaller classes of functions. Here, we study more in detail the nonlinearities and the resiliencies of the functions produced by all these constructions. Further we see how to obtain functions satisfying the propagation criterion (among which bent functions) with these methods, and we give a new construction of bent functions based on the extended Maiorana–McFarland's construction.

Author Keywords: Author Keywords: Cryptography; Stream ciphers; Boolean functions, Nonlinearity; Bent; Resilient

Article Outline

• References

Journal of Complexity
Volume 20, Issues 2-3, April-June 2004, Pages 182-204
Festschrift for Harald Niederreiter, Special Issue on Coding and Cryptography
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.