A Compact 16-bit S-box over Tower Field $\F_{(((2^2)^2)^2)^2}$ with High Security
Bahram Rashidi, Behrooz Khadem

TL;DR
This paper presents a compact, secure 16-bit S-box designed over a tower field that balances high cryptographic security with hardware efficiency, suitable for scalable cryptographic applications.
Contribution
The paper introduces a novel 16-bit S-box over a complex tower field with optimized hardware implementation and proven security against various cryptanalytic attacks.
Findings
Lower hardware resource consumption compared to existing S-boxes
Enhanced security metrics such as high nonlinearity and algebraic degree
Demonstrated feasibility in 65 nm CMOS technology
Abstract
This paper introduces a compact and secure 16-bit substitution box (S-box) designed over the composite field , optimized for both hardware efficiency and cryptographic robustness. The proposed S-box decomposes operations into subfields, leveraging a tower field architecture. This enables significant hardware reduction through optimized field inversion and a low-cost affine transformation. Security evaluations confirm resilience against linear, differential, algebraic and DPA attacks, validated via metrics including Nonlinearity (32512), Differential Uniformity (4), Algebraic Degree (15), Transparency order (15.9875) and SNR (0.34e-08). The hardware results, in 65 nm CMOS technology, show the proposed 16-bit S-box has lower hardware resources consumption and lower critical path delay (CPD) than those of other 16-bit S-boxes. By integrating high algebraic complexity…
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
TopicsCryptographic Implementations and Security · Cryptography and Residue Arithmetic · Coding theory and cryptography
