A proof of two conjectures on APN functions
Elodie Leducq
TL;DR
This paper proves two conjectures proposing that specific families of power mappings are APN functions, confirming their cryptographic significance.
Contribution
It provides a formal proof of two longstanding conjectures about APN functions, advancing understanding in cryptography.
Findings
Confirmed two families of power mappings are APN functions
Validated conjectures by Dobbertin et al.
Strengthened theoretical foundation of APN functions in cryptography.
Abstract
Dobbertin, Mills, M\"uller, Pott and Willems conjecture that two families of power mapping are families of APN functions. Here we prove those two conjectures.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · semigroups and automata theory