Paper 2018/1036
If a Generalised Butterfly is APN then it Operates on 6 Bits
Anne Canteaut, Léo Perrin, and Shizhu Tian
Abstract
Whether there exist Almost Perfect Non-linear permutations (APN) operating on an even number of bit is the so-called Big APN Problem. It has been solved in the 6-bit case by Dillon et al. in 2009 but, since then, the general case has remained an open problem.
In 2016, Perrin et al. discovered the butterfly structure which contains Dillon et al.'s permutation over
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- Boolean functionSboxAPNDifferential uniformityButterflies
- Contact author(s)
- perrin leo @ gmail com
- History
- 2018-10-30: received
- Short URL
- https://ia.cr/2018/1036
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/1036, author = {Anne Canteaut and Léo Perrin and Shizhu Tian}, title = {If a Generalised Butterfly is {APN} then it Operates on 6 Bits}, howpublished = {Cryptology {ePrint} Archive, Paper 2018/1036}, year = {2018}, url = {https://eprint.iacr.org/2018/1036} }