Paper 2016/539
Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem (Full Version)
Léo Perrin, Aleksei Udovenko and Alex Biryukov
Abstract
The existence of Almost Perfect Non-linear (APN) permutations operating on an even number of bits has been a long standing open question until Dillon et al., who work for the NSA, provided an example on 6 bits in 2009.
In this paper, we apply methods intended to reverse-engineer S-Boxes with unknown structure to this permutation and find a simple decomposition relying on the cube function over
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- A major revision of an IACR publication in CRYPTO 2016
- Keywords
- Boolean functionsAPNButterfly structureS-Box decompositionCCZ-equivalenceFeistel NetworkBitsliced implementation
- Contact author(s)
- leo perrin @ uni lu
- History
- 2021-05-31: last of 2 revisions
- 2016-05-31: received
- See all versions
- Short URL
- https://ia.cr/2016/539
- License
-
CC BY