We use the notion of covering sequence, introduced by C. Carlet and Y. Tarannikov, to give a simple characterization of bent functions. We extend it into a characterization of plateaued functions (that is bent and three-valued functions). After recalling why the class of plateaued functions provides good candidates to be used in cryptosystems, we study the known families of plateaued functions and their drawbacks. We show in particular that the class given as new by Zhang and Zheng is in fact a subclass of Maiorana-McFarland's class. We introduce a new class of plateaued functions and prove its good cryptographic properties. © International Association for Cryptoiogic Research 2003.
CITATION STYLE
Carlet, C., & Proufff, E. (2003). On plateaued functions and their constructions. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2887, 54–73. https://doi.org/10.1007/978-3-540-39887-5_6
Mendeley helps you to discover research relevant for your work.