2003
DOI: 10.1007/978-3-540-39887-5_6
|View full text |Cite
|
Sign up to set email alerts
|

On Plateaued Functions and Their Constructions

Abstract: Abstract. 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 subcl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
53
0

Year Published

2004
2004
2021
2021

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 62 publications
(53 citation statements)
references
References 33 publications
0
53
0
Order By: Relevance
“…Carlet and Prouff present another way of concatenating quadratic functions in [6].We denote the class by Q. Definition 3 [6] For any positive integers r and s such that n=r+s, an Q function f is defined by…”
Section: Q's Functionsmentioning
confidence: 99%
See 2 more Smart Citations
“…Carlet and Prouff present another way of concatenating quadratic functions in [6].We denote the class by Q. Definition 3 [6] For any positive integers r and s such that n=r+s, an Q function f is defined by…”
Section: Q's Functionsmentioning
confidence: 99%
“…As a result, the study of Plateaued functions becomes necessary and important. As for the construction of Plateaued functions, there only exist three main classes (see [4][5][6]). The class in [7] is in fact a subclass of [4].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…This is an important class of functions with many applications in cryptography, for example see [2,4,5,20,27]. We give several new constructions of resilient Boolean functions with high nonlinearity and optimally low additive autocorrelation.…”
Section: Introductionmentioning
confidence: 99%
“…Moreover, the Maiorana-McFarland function in equation (4) becomes linear when we fix (n − 1)/2 input bits y. Our construction can avoid this possible weakness:…”
mentioning
confidence: 99%