Time-area optimized public-key engines: MQ-cryptosystems as replacement for elliptic curves?

Andrey Bogdanov, Thomas Eisenbarth, Andy Rupp, Christopher Wolf

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Abstract

In this paper ways to efficiently implement public-key schemes based on ultivariate uadratic polynomials ( -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 -schemes in hardware is proposed which includes a systolic architecture performing Gaussian elimination over composite binary fields. © 2008 Springer-Verlag Berlin Heidelberg.
Original languageEnglish
Title of host publicationCryptographic Hardware and Embedded Systems – CHES 2008. Proceedings
PublisherSpringer
Publication date2008
Pages45-61
ISBN (Print)978-3-540-85052-6
ISBN (Electronic)978-3-540-85053-3
DOIs
Publication statusPublished - 2008
Externally publishedYes
Event10th International Workshop on Cryptographic Hardware and Embedded Systems (CHES 2008) - Washington, United States
Duration: 10 Aug 200813 Aug 2008
Conference number: 10

Workshop

Workshop10th International Workshop on Cryptographic Hardware and Embedded Systems (CHES 2008)
Number10
CountryUnited States
CityWashington
Period10/08/200813/08/2008
SeriesLecture Notes in Computer Science
Volume5154
ISSN0302-9743

Cite this

Bogdanov, A., Eisenbarth, T., Rupp, A., & Wolf, C. (2008). Time-area optimized public-key engines: MQ-cryptosystems as replacement for elliptic curves? In Cryptographic Hardware and Embedded Systems – CHES 2008. Proceedings (pp. 45-61). Springer. Lecture Notes in Computer Science, Vol.. 5154 https://doi.org/10.1007/978-3-540-85053-3_4