International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

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

Authors:
Andrey Bogdanov
Thomas Eisenbarth
Andy Rupp
Christopher Wolf
Download:
URL: http://eprint.iacr.org/2008/349
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2008-18026,
  title={Time-Area Optimized Public-Key Engines: MQ-Cryptosystems as Replacement for Elliptic Curves?},
  booktitle={IACR Eprint archive},
  keywords={implementation / MQ-cryptosystems, ECC, hardware implementation, TA-product, UOV, Rainbow, amended TTS},
  url={http://eprint.iacr.org/2008/349},
  note={A revised version of the original paper accepted for CHES 2008 abogdanov@crypto.rub.de 14101 received 10 Aug 2008},
  author={Andrey Bogdanov and Thomas Eisenbarth and Andy Rupp and Christopher Wolf},
  year=2008
}