A practical post-quantum public-key cryptosystem based on spLWE

Recommendations

Lizard: cut off the tail -- a practical post-quantum public-key encryption from LWE and LWR
On lattices, learning with errors, random linear codes, and cryptography
Efficient public key encryption based on ideal lattices (extended abstract)
On lattices, learning with errors, random linear codes, and cryptography
Polar coding for ring-LWE-based public key encryption

Cites work

A decade of lattice cryptography
A Subfield Lattice Attack on Overstretched NTRU Assumptions
A toolkit for ring-LWE cryptography
Algorithmic number theory. 3rd international symposium, ANTS-III, Portland, OR, USA, June 21--25, 1998. Proceedings
An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
An improved BKW algorithm for LWE with applications to cryptography and lattices
An improved compression technique for signatures based on learning with errors
Analyzing blockwise lattice algorithms using dynamical systems
Better algorithms for LWE and LWR
Better key sizes (and attacks) for LWE-based encryption
Classical hardness of learning with errors
Coded-BKW: solving LWE using lattice codes
Compact ring-LWE cryptoprocessor
Efficient ring-LWE encryption on 8-bit AVR processors
High-speed signatures from standard lattices
scientific article; zbMATH DE number 1256724 (Why is no real title available?)
scientific article; zbMATH DE number 1962809 (Why is no real title available?)
Improvement and efficient implementation of a lattice-based signature scheme
Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\)
Lattice cryptography for the internet
Lattice decoding attacks on binary LWE
Lattice signatures and bimodal Gaussians
Lossy Trapdoor Functions and Their Applications
New Algorithms for Learning in Presence of Errors
New directions in nearest neighbor searching with applications to lattice sieving
On ideal lattices and learning with errors over rings
On lattices, learning with errors, random linear codes, and cryptography
On lattices, learning with errors, random linear codes, and cryptography
On the concrete hardness of learning with errors
On the design of hardware building blocks for modern lattice-based encryption schemes
On the efficacy of solving LWE by reduction to unique-SVP
On the hardness of LWE with binary error: revisiting the hybrid lattice-reduction and meet-in-the-middle attack
Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
Sieving for closest lattice vectors (with preprocessing)
Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
Trapdoors for hard lattices and new cryptographic constructions
Trapdoors for lattices: simpler, tighter, faster, smaller

Cited in

(10)

Lizard: cut off the tail -- a practical post-quantum public-key encryption from LWE and LWR
Improved efficiency of MP12
Quantum indistinguishability for public key encryption
More efficient post-quantum KEMTLS with pre-distributed public keys
Ciphertext-only attacks against compact-LWE submitted to NIST PQC project
Tightly secure ring-LWE based key encapsulation with short ciphertexts
On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
Polar coding for ring-LWE-based public key encryption
Post-quantum insecurity from LWE
\textsf{SMAUG}: pushing lattice-based key encapsulation mechanisms to the limits

Describes a project that uses

Uses Software

ring-LWE

This page was built for publication: A practical post-quantum public-key cryptosystem based on spLWE

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988333)