Mixed Bases for Efficient Inversion in ${{\mathbb F}{((2^2)^2)}{2}}$ and Conversion Matrices of SubBytes of AES

DOI10.1007/978-3-642-15031-9_16zbMath1297.94095OpenAlexW2055722319MaRDI QIDQ3583455

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

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)

Related Items (4)

Logic minimization techniques with applications to cryptology ⋮ AES side-channel countermeasure using random tower field constructions ⋮ Small low-depth circuits for cryptographic applications ⋮ Implementing Grover oracles for quantum key search on AES and LowMC

This page was built for publication: Mixed Bases for Efficient Inversion in ${{\mathbb F}{((2^2)^2)}{2}}$ and Conversion Matrices of SubBytes of AES