Name
Title | ||
|---|---|---|
Time-Area Optimized Public-Key Engines: Mq-Cryptosystems As Replacement For Elliptic Curves? |
Abstract | ||
|---|---|---|
In this paper ways to efficiently implement public-key schemes based on Multivariate 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 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. |
Year | Venue | Keywords |
|---|---|---|
2008 | CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS - CHES 2008, PROCEEDINGS | MQ-cryptosystems, ECC, hardware implementation, TA-product, UOV, rainbow, amended TTS |
DocType | Volume | ISSN |
Journal | 5154 | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrey Bogdanov | 1 | 2067 | 98.10 |
| Thomas Eisenbarth | 2 | 840 | 61.33 |
| Andy Rupp | 3 | 196 | 16.95 |
| Christopher Wolf | 4 | 221 | 9.93 |