2018
DOI: 10.1007/s12095-018-0310-9
|View full text |Cite
|
Sign up to set email alerts
|

On an algorithm generating 2-to-1 APN functions and its applications to “the big APN problem”

Abstract: Almost perfect nonlinear (APN) functions are of great interest to many researchers since they have the optimal resistance to the differential attack. The existence of bijective APN functions in even number of variables is an important open problem, and there is only one known example of such a function at present. In this paper we consider a special subclass of 2-to-1 vectorial Boolean functions that can allow us to search and construct APN permutations. We proved that each 2-to-1 function is potentially EA-eq… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
11
0
4

Year Published

2018
2018
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(15 citation statements)
references
References 34 publications
(22 reference statements)
0
11
0
4
Order By: Relevance
“…In the second part of the paper we focus on 2-1 subfunctions of permutations, that are obtained by discarding one coordinate function. In [8], Idrisova has shown a necessary property on the subfunctions of APN permutations. In particular, for a subfunction S :…”
Section: Introductionmentioning
confidence: 99%
“…In the second part of the paper we focus on 2-1 subfunctions of permutations, that are obtained by discarding one coordinate function. In [8], Idrisova has shown a necessary property on the subfunctions of APN permutations. In particular, for a subfunction S :…”
Section: Introductionmentioning
confidence: 99%
“…Можно заметить, что тогда любая (n − 1)-подфункция взаимно однозначной векторной функции принадлежит T n . Имеет место следующее утверждение [8].…”
unclassified
“…Тогда любая её (n − 1)-подфункция является дифференциально 4-равномерной функцией из T n . В [8,9] рассматривается алгоритм построения 2-в-1 APN-функций при помощи специальных так называемых допустимых символьных последовательностей. В [8] доказана следующая Теорема 1.…”
unclassified
See 2 more Smart Citations