Paper 2024/1076
A More Compact AES, and More
Abstract
We reduce the number of bit operations required to implement AES to a new minimum, and also compute improvements to elements of some other ciphers. Exploring the algebra of AES allows choices of basis and streamlining of the nonlinear parts. We also compute a more efficient implementation of the linear part of each round. Similar computational optimizations apply to other cryptographic matrices and S-boxes. This work may be incorporated into a hardware AES implementation using minimal resources, or potentially in a bit-sliced software implementation to increase speed.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Preprint.
- Keywords
- AEScompacttower fieldcomposite field
- Contact author(s)
-
daosvik @ pm me
dcanright @ nps edu - History
- 2024-07-02: approved
- 2024-07-02: received
- See all versions
- Short URL
- https://ia.cr/2024/1076
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1076,
author = {Dag Arne Osvik and David Canright},
title = {A More Compact {AES}, and More},
howpublished = {Cryptology ePrint Archive, Paper 2024/1076},
year = {2024},
note = {\url{https://eprint.iacr.org/2024/1076}},
url = {https://eprint.iacr.org/2024/1076}
}
