Mixed bases for efficient inversion in F_((2²)^2)^2 and conversion matrices of \texttt{SubBytes} of AES

DOI10.1007/978-3-642-15031-9_16MaRDI QIDQ3583455zbMATH OpenOpenAlexFDO

Authors Yasuyuki Nogami, Kenta Nekado, Tetsumi Toyota, Naoto Hongo, Yoshitaka Morikawa

Publication date 17 August 2010

Published in Cryptographic Hardware and Embedded Systems, CHES 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15031-9_16

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07)

Recommendations

• Using Normal Bases for Compact Hardware Implementations of the AES S-Box
• Very Short Critical Path Implementation of AES with Direct Logic Gates
• Highly efficient \(\mathrm{GF}(2^8)\) inversion circuit based on redundant GF arithmetic and its application to AES design
• A Very Compact S-Box for AES
• A More Compact AES

Cited in

(6)

• Implementing Grover oracles for quantum key search on AES and LowMC
• Small low-depth circuits for cryptographic applications
• Using Normal Bases for Compact Hardware Implementations of the AES S-Box
• Logic minimization techniques with applications to cryptology
• AES side-channel countermeasure using random tower field constructions
• Highly efficient \(\mathrm{GF}(2^8)\) inversion circuit based on redundant GF arithmetic and its application to AES design

This page was built for publication: Mixed bases for efficient inversion in \({\mathbb F}_{((2^2)^2)^2}\) and conversion matrices of \texttt{SubBytes} of AES

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3583455)