Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems

By Tim Erhan Güneysu, Vadim Lyubashevsky, Thomas Pöppelmann. Workshop on Cryptographic Hardware and Embedded Systems, 2012

361 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A Toolkit for Ring-LWE Cryptography (2013, background): “, [25, 24, 21, 14, 15, 26, 33, 9, 8, 17, 18, 22, 5, 28, 20, 16]), often to the exclusion of all other rings.”
Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives (2017, background): “More efficient lattice-based schemes are based on ring analogues of classical lattice problems [3, 10, 11, 36, 53] whose security is related to hardness assumptions in ideal lattices.”
Software Speed Records for Lattice-Based Signatures (2013, methodology): “In this section we briefly recall the notation from [14].”
Lattice Signatures and Bimodal Gaussians (2013, methodology): “2 In [15], a 100-bit security level was claimed, but the cryptanalysis we use in the full version of this paper [5], which combines lattice-reduction attacks with combinatorial meet-in-the-middle techniques [20], estimates the actual security to be around 75-80 bits.”
CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme (2018, methodology): “Dilithium therefore only uses uniform sampling, as was originally proposed in [Lyu09, GLP12, BG14].”
Towards Post-Quantum Blockchain: A Review on Blockchain Cryptography Resistant to Quantum Computing Attacks (2020, background): “Finally, it is worth mentioning the lattice-based signature schemes presented in [174], [175].”