Name
Abstract | ||
|---|---|---|
Nearly all of the currently used signature schemes, such as RSA or DSA, are based either on the factoring assumption or the presumed intractability of the discrete logarithm problem. As a consequence, the appearance of quantum computers or algorithmic advances on these problems may lead to the unpleasant situation that a large number of today’s schemes will most likely need to be replaced with more secure alternatives. In this work we present such an alternative—an efficient signature scheme whose security is derived from the hardness of lattice problems. It is based on recent theoretical advances in lattice-based cryptography and is highly optimized for practicability and use in embedded systems. The public and secret keys are roughly kB and kB long, while the signature size is approximately kB for a security level of around bits. We provide implementation results on reconfigurable hardware (Spartan/Virtex-6) and demonstrate that the scheme is scalable, has low area consumption, and even outperforms classical schemes. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/TC.2014.2346177 | Computers, IEEE Transactions |
Keywords | Field | DocType |
fpga,public key cryptosystems,ideal lattices,reconfigurable hardware,signature scheme,lattice based cryptography,optimization,lattices,digital signatures,public key,polynomials,discrete logarithm problem,cryptography,hardware | Cryptography,Computer science,Parallel computing,Quantum computer,Lattice problem,Lattice-based cryptography,Public-key cryptography,Discrete logarithm,Scalability,Reconfigurable computing | Journal |
Volume | Issue | ISSN |
64 | 7 | 0018-9340 |
Citations | PageRank | References |
10 | 0.58 | 38 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tim Güneysu | 1 | 924 | 77.37 |
| Vadim Lyubashevsky | 2 | 1174 | 59.91 |
| Thomas Pöppelmann | 3 | 12 | 0.96 |