Time-Area Optimized Public-Key Engines: MQ-Cryptosystems as Replacement for Elliptic Curves?

Andrey Bogdanov; Thomas Eisenbarth; Andy Rupp; Christopher Wolf

Paper 2008/349

Time-Area Optimized Public-Key Engines: MQ-Cryptosystems as Replacement for Elliptic Curves?

Andrey Bogdanov, Thomas Eisenbarth, Andy Rupp, and Christopher Wolf

Abstract

In this paper ways to efficiently implement public-key schemes based onMultivariate Quadratic polynomials (MQ-schemes for short) are investigated. In particular, they are claimed to resist quantum computer attacks. It is shown that such schemes can have a much better time-area product than elliptic curve cryptosystems. For instance, an optimised FPGA implementation of amended TTS is estimated to be over 50 times more efficient with respect to this parameter. Moreover, a general framework for implementing small-field MQ-schemes in hardware is proposed which includes a systolic architecture performing Gaussian elimination over composite binary fields.

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Published elsewhere. A revised version of the original paper accepted for CHES 2008
Keywords: MQ-cryptosystems ECC hardware implementation TA-product UOV Rainbow amended TTS
Contact author(s): abogdanov @ crypto rub de
History: 2008-08-11: received
Short URL: https://ia.cr/2008/349
License: CC BY

BibTeX

@misc{cryptoeprint:2008/349,
      author = {Andrey Bogdanov and Thomas Eisenbarth and Andy Rupp and Christopher Wolf},
      title = {Time-Area Optimized Public-Key Engines: {MQ}-Cryptosystems as Replacement for Elliptic Curves?},
      howpublished = {Cryptology {ePrint} Archive, Paper 2008/349},
      year = {2008},
      url = {https://eprint.iacr.org/2008/349}
}