Abstract
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 language | English |
---|---|
Title of host publication | Cryptographic Hardware and Embedded Systems -- CHES 2008 |
Editors | Elisabeth Oswald, Pankaj Rohatgi |
Number of pages | 17 |
Volume | 5154 |
Place of Publication | Berlin, Heidelberg |
Publisher | Springer Berlin Heidelberg |
Publication date | 08.2008 |
Pages | 45-61 |
ISBN (Print) | 978-3-540-85052-6 |
ISBN (Electronic) | 978-3-540-85053-3 |
DOIs | |
Publication status | Published - 08.2008 |
Event | 10th International Workshop on Cryptographic Hardware and Embedded Systems - Workshop, United States Duration: 10.08.2008 → 13.08.2008 |