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 language | English |
|---|---|
| Title of host publication | Cryptographic Hardware and Embedded Systems – CHES 2008. Proceedings |
| Publisher | Springer |
| Publication date | 2008 |
| Pages | 45-61 |
| ISBN (Print) | 978-3-540-85052-6 |
| ISBN (Electronic) | 978-3-540-85053-3 |
| DOIs | |
| Publication status | Published - 2008 |
| Externally published | Yes |
| Event | 10th International Workshop on Cryptographic Hardware and Embedded Systems (CHES 2008) - Washington, United States Duration: 10 Aug 2008 → 13 Aug 2008 Conference number: 10 |
Workshop
| Workshop | 10th International Workshop on Cryptographic Hardware and Embedded Systems (CHES 2008) |
|---|---|
| Number | 10 |
| Country/Territory | United States |
| City | Washington |
| Period | 10/08/2008 → 13/08/2008 |
| Series | Lecture Notes in Computer Science |
|---|---|
| Volume | 5154 |
| ISSN | 0302-9743 |