On the Design of Hardware Building Blocks for Modern Lattice-Based Encryption Schemes
By Norman Göttert, Thomas Feller, Michael Schneider, J. Buchmann, S. Huss. 2012
172 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Information Systems
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Peter Schwabe
- Sujoy Sinha Roy
- Thomas Pöppelmann
- Ingrid M. R. Verbauwhede
- Léo Ducas
- Frederik Vercauteren
- E. Alkım
- Laurent Fousse
In Information Systems
- Peter Schwabe
- Carlos Aguilar Melchor
- Ingrid M. R. Verbauwhede
- Laurent Fousse
- Frederik Vercauteren
- Léo Ducas
- Marc-Olivier Killijian
- Sujoy Sinha Roy
Citations in the corpus
- XPIR : Private Information Retrieval for Everyone (2016, methodology): “In XPIR we use a mixed NTT-CRT representation to reduce computational costs: Number-Theoretic Transform (NTT) for polynomials [39] and Chinese Remainder Theorem (CRT) for integers.”
- Compact Ring-LWE Cryptoprocessor (2014, methodology): “For paramater set P2 we expect it to offer a high security level consistent with AES-256 (following [9]).”
- Software Speed Records for Lattice-Based Signatures (2013, methodology): “The advantages offered by the NTT have recently been shown by a hard- and software implementation of an ideal lattice-based public key cryptosystem [12].”
- Post-quantum Key Exchange - A New Hope (2016, methodology): “Security level over-shoot? With all our improvements, it would be possible to build a scheme with n = 512 (and k = 24, q = 12289) and to obtain security somewhat similar to the one of [20, 42], and therefore further improve efficiency.”