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

Andrey Bogdanov, Thomas Eisenbarth, Andy Rupp, Christopher Wolf


In this paper ways to efficiently implement public-key schemes based on ultivariate uadratic polynomials ( backslashmathcalMQ -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 backslashmathcalMQ -schemes in hardware is proposed which includes a systolic architecture performing Gaussian elimination over composite binary fields.
Original languageEnglish
Title of host publicationCryptographic Hardware and Embedded Systems -- CHES 2008
EditorsElisabeth Oswald, Pankaj Rohatgi
Number of pages17
Place of PublicationBerlin, Heidelberg
PublisherSpringer Berlin Heidelberg
Publication date08.2008
ISBN (Print)978-3-540-85052-6
ISBN (Electronic)978-3-540-85053-3
Publication statusPublished - 08.2008
Event10th International Workshop on Cryptographic Hardware and Embedded Systems - Workshop, United States
Duration: 10.08.200813.08.2008


Dive into the research topics of 'Time-Area Optimized Public-Key Engines: MQ -Cryptosystems as Replacement for Elliptic Curves?'. Together they form a unique fingerprint.

Cite this