Software Speed Records for Lattice-Based Signatures

87 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.

XPIR : Private Information Retrieval for Everyone (2016, methodology): “To generate this noise, we use Salsa20/20 [37] (Salsa20/20 is able to provide up to 256 bits of security), and thus even if a set of parameters for Ring-LWE is able to provide theoretically more security, 256 is thus an upper bound (this is the standard maximum security usually considered).”
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM (2017, methodology): “Essentially, our implementation of the NTT follows the same approach as [41] and [4], except that we carefully optimize for n = 256 and q = 7681.”
CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme (2018, methodology): “The design of the scheme is based on the “Fiat-Shamir with Aborts” approach [Lyu09] and bears most resemblance to the schemes proposed in [GLP12, BG14].”
Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography (2016, methodology): “[16] includes an NTT implementation using n = 512 and q = 8383489 that targets latticebased signatures.”
Post-quantum Key Exchange - A New Hope (2016, methodology): “In the end it turned out that floating-point arithmetic beats all of those more sophisticated approaches, so we are now using an approach that is very similar to the approach in [45].”