Name
Abstract | ||
|---|---|---|
With this work we provide further evidence that lattice-based cryptography is a promising and efficient alternative to secure embedded applications. So far it is known for solid security reductions but implementations of specific instances have often been reported to be too complex beyond any practicability. In this work, we present an efficient and scalable micro-code engine for Ring-LWE encryption that combines polynomial multiplication based on the Number Theoretic Transform (NTT), polynomial addition, subtraction, and Gaussian sampling in a single unit. This unit can encrypt and decrypt a block in 26.19 mu s and 16.80 mu s on a Virtex-6 LX75T FPGA, respectively - at moderate resource requirements of about 1506 slices and a few block RAMs. Additionally, we provide solutions for several practical issues with Ring-LWE encryption, including the reduction of ciphertext expansion, error rate and constant-time operation. We hope that this contribution helps to pave the way for the deployment of ideal lattice-based encryption in future real-world systems. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-662-43414-7_4 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
Ideal lattices,Ring-LWE,FPGA implementation | Polynomial,Cryptography,Ciphertext expansion,Encryption,40-bit encryption,Probabilistic encryption,Computer engineering,Public-key cryptography,Mathematics,Reconfigurable computing,Distributed computing | Conference |
Volume | ISSN | Citations |
8282 | 0302-9743 | 28 |
PageRank | References | Authors |
0.99 | 38 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Pöppelmann | 1 | 357 | 17.96 |
| Tim Güneysu | 2 | 924 | 77.37 |