Name
Title | ||
|---|---|---|
Time-Area Optimized Public-Key Engines: -Cryptosystems as Replacement for Elliptic Curves? |
Abstract | ||
|---|---|---|
In this paper ways to efficiently implement public-key schemesbased on Multivariate Qua- dratic 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 im- plementation 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 MQ-schemes in hardware is proposed which includes a systolic architecture performing Gaussian elimination over composite binary fields. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-85053-3_4 | CHES |
Keywords | Field | DocType |
quantum computer,elliptic curve,public key,gaussian elimination | Multivariate cryptography,Polynomial,Computer science,Quantum computer,Field-programmable gate array,Algorithm,Theoretical computer science,Cryptosystem,Gaussian elimination,Public-key cryptography,Elliptic curve | Conference |
Citations | PageRank | References |
39 | 1.71 | 15 |
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 |