2008
DOI: 10.1134/s003294600801002x
|View full text |Cite
|
Sign up to set email alerts
|

Bent and hyper-bent functions over a field of 2ℓ elements

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 11 publications
0
5
0
Order By: Relevance
“…A large number of works are devoted to the study of various classes of approximating functions and to the construction of functions that are most difficult to such approximations. In these papers, bent functions (Logachev et al, 2004;Dobbertin & Leander, 2004;Chee et al, 1994) are considered, which are Boolean functions from an even number of variables that are maximally distant from the set of all linear functions in the Hamming metric, as well as their generalizations: semi-bent functions (Dobbertin & Leander, 2005), partially bent functions (Qu et al, 2000), Z−bent functions (Pfitzmann, 2003), homogeneous bent functions (Kuzmin et al, 2006), hyper best functions (Carlet & Gaborit, 2006;Youssef, 2007;Kuz'min et al, 2008;Knudsen & Robshaw, 1996). The main idea of using linear cryptanalysis of nonlinear approximations (Knudsen & Robshaw, 1996) is to enrich the class of approximating functions (of m variables) with nonlinear functions and increase the quality of approximation due to this.…”
Section: Linear Cryptanalysismentioning
confidence: 99%
“…A large number of works are devoted to the study of various classes of approximating functions and to the construction of functions that are most difficult to such approximations. In these papers, bent functions (Logachev et al, 2004;Dobbertin & Leander, 2004;Chee et al, 1994) are considered, which are Boolean functions from an even number of variables that are maximally distant from the set of all linear functions in the Hamming metric, as well as their generalizations: semi-bent functions (Dobbertin & Leander, 2005), partially bent functions (Qu et al, 2000), Z−bent functions (Pfitzmann, 2003), homogeneous bent functions (Kuzmin et al, 2006), hyper best functions (Carlet & Gaborit, 2006;Youssef, 2007;Kuz'min et al, 2008;Knudsen & Robshaw, 1996). The main idea of using linear cryptanalysis of nonlinear approximations (Knudsen & Robshaw, 1996) is to enrich the class of approximating functions (of m variables) with nonlinear functions and increase the quality of approximation due to this.…”
Section: Linear Cryptanalysismentioning
confidence: 99%
“…For more on this topic, see [9,61]. A. V. Ivanov also studied [3,4] the monomial approximations of Boolean functions.…”
Section: Hyper-bent Functionsmentioning
confidence: 99%
“…For q = 2, Definitions 14 and 15 coincide. A detailed study of these generalized hyper-bent functions appears in [7]. Let us present here only one construction of them.…”
Section: Hyper-bent Functionsmentioning
confidence: 99%
See 2 more Smart Citations