惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Last Week in AI
Last Week in AI
阮一峰的网络日志
阮一峰的网络日志
P
Proofpoint News Feed
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
MongoDB | Blog
MongoDB | Blog
云风的 BLOG
云风的 BLOG
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
J
Java Code Geeks
WordPress大学
WordPress大学
T
The Blog of Author Tim Ferriss
V
Visual Studio Blog
小众软件
小众软件
Microsoft Azure Blog
Microsoft Azure Blog
博客园_首页
IT之家
IT之家
Vercel News
Vercel News
C
Check Point Blog
Google DeepMind News
Google DeepMind News
月光博客
月光博客
D
DataBreaches.Net
酷 壳 – CoolShell
酷 壳 – CoolShell
美团技术团队
Y
Y Combinator Blog
Hugging Face - Blog
Hugging Face - Blog

Cryptology ePrint Archive

Fast Isogeny Evaluation on Binary Curves Quick Draw Queries: Lightweight Searchable Public-key Ciphertexts with Hidden Structures via Non-Interactive Key Exchange A Constructive Treatment of Authentication Boolean Arithmetic over $\mathbb{F}_2$ from Group Commutators HAWK with Hint: Algebraic Key Recovery from Side-Channel Leakage Post-Quantum Secure k-Times Traceable Ring Signature A Key Schedule Design and Evaluation under Boundary Round-Key Leakage 2G2T: Constant-Size, Statistically Sound MSM Outsourcing Proximity Signatures Breaking Optimized HQC: The First Cache-Timing Full Decryption Oracle Key-Recovery Attack in Post-Quantum Cryptography Efficient Partially Blind Signatures from Isogenies Evaluating PQC KEMs, Combiners, and Cascade Encryption via Adaptive IND-CPA Testing Using Deep Learning High-Throughput Side-Channel-Protected Stream Cipher Hardware for 6G Systems Efficient e = 3 Threshold RSA via Integer Coordinates for Intel SGX Zeal: PIR for Non-Cooperative Databases VEIL: Lightweight Zero-Knowledge for Hash-Based Multilinear Proof Systems Witness-Indistinguishable Arguments of Knowledge and One-Way Functions The many faces of Schnorr: a touch-up Open Problems in List Decoding and Correlated Agreement Compressed Key Exchange Protocol from Orientations of Large Discriminant Using AVX-512 SPLASH: SPeculative Leakage-Adaptive Secure Hardware An Efficient Identity-Based Blind Signature Scheme from SM9 Efficient Batch Threshold Encryption Using Partial Fraction Techniques A note on the Unsuitability of LIGA for Linkable Ring Signatures: The perils of non-commutativity Verification Facade: Masquerading Insecure Cryptographic Implementations as Verified Code Cryptographic Implications of Worst-Case Hardness of Time-Bounded Kolmogorov Complexity Efficient Merkle-Tree Consistent Accumulator FLOSS: Fast Linear Online Secret-Shared Shuffling Which Privacy Blanket is Optimal in the Shuffle Model? Applications of Bruhat-Chevalley-Renner Decomposition to Metric-Aware Code-Based Cryptography
Linear self-equivalence of the known families of APN func...
Jules Baudrin, Versailles Saint-Quentin-en-Yvelines University · 2026-05-20 · via Cryptology ePrint Archive

Paper 2026/1012

Linear self-equivalence of the known families of APN functions: a unified point of view

Anne Canteaut, French Institute for Research in Computer Science and Automation

Léo Perrin, French Institute for Research in Computer Science and Automation

Abstract

The only known solution to the big APN problem was found by exploring the CCZ-equivalence class of a specific quadratic function, the Kim mapping, which is linearly equivalent to various highly-structured functions. For example, one of these functions has a univariate representation with a specific factorisation highlighting its subspace property and that it is a cyclotomic mapping, while another has a bivariate representation corresponding to a $(q,q)$-projective mapping. In this paper, we show that the properties of this kind all correspond to a type of functions we introduce: multivariate projective mappings. These are multivariate functions whose coordinates are homogeneous. Furthermore, while a function might not have this form, it can still be equivalent to another function that has it. To handle this case, we describe how to identify the presence of a multivariate projective mapping in the linear-equivalence class of a function. We then derive our main result: for almost all known infinite families of APN functions, there exists a multivariate projective mapping, or a function commuting with the Frobenius mapping, that is CCZ-equivalent to them. Despite the widely different initial representations of these families (univariate, bivariate, or trivariate), this pattern holds. We also discuss concrete techniques to detect (or rule out) the presence of a multivariate projective mapping equivalent to a given function.

BibTeX

@misc{cryptoeprint:2026/1012,
      author = {Jules Baudrin and Anne Canteaut and Léo Perrin},
      title = {Linear self-equivalence of the known families of {APN} functions: a unified point of view},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/1012},
      year = {2026},
      url = {https://eprint.iacr.org/2026/1012}
}