Solving Circuit Optimisation Problems in Cryptography and Cryptanalysis

Nicolas T.  Courtois; Daniel Hulme; Theodosis Mourouzis

Paper 2011/475 Original: eprint.iacr.org/2011/475 ↗

Solving Circuit Optimisation Problems in Cryptography and Cryptanalysis

Nicolas T. Courtois

Daniel Hulme

Theodosis Mourouzis

Abstract

One of the hardest problems in computer science is the problem of gate-eficient implementation. Such optimizations are particularly important in industrial hardware implementations of standard cryptographic algorithms. In this paper we focus on optimizing some small circuits such as S-boxes in cryptographic algorithms. We consider the notion of Multiplicative Complexity studied in 2008 by Boyar and Peralta and applied to find interesting optimizations for the S-box of the AES cipher. We applied this methodology to produce a compact implementation of several ciphers. In this short paper we report our results on PRESENT and GOST, two block ciphers known for their exceptionally low hardware cost. This kind of representation seems to be very promising in implementations aiming at preventing side channel attacks on cryptographic chips such as DPA. More importantly, we postulate that this kind of minimality is also an important and interesting tool in cryptanalysis.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Preprint.
History: 2012-04-30: last updated; 2011-09-06: published
Short URL: https://ia.cr/2011/475
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2011/475,
      author = {Nicolas T.  Courtois and Daniel Hulme and Theodosis Mourouzis},
      title = {Solving Circuit Optimisation Problems in Cryptography and Cryptanalysis},
      howpublished = {Cryptology {ePrint} Archive, Paper 2011/475},
      year = {2011},
      url = {https://eprint.iacr.org/2011/475}
}