A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$
From MaRDI portal
Publication:2988333
DOI10.1007/978-3-319-53177-9_3zbMath1381.94067OpenAlexW2592509728MaRDI QIDQ2988333
Changmin Lee, Kyoohyung Han, Jung Hee Cheon, Yongha Son, Jin-Su Kim
Publication date: 19 May 2017
Published in: Information Security and Cryptology – ICISC 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53177-9_3
Related Items (2)
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the concrete hardness of learning with errors
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\)
- Algorithmic number theory. 3rd international symposium, ANTS-III, Portland, OR, USA, June 21--25, 1998. Proceedings
- Efficient ring-LWE encryption on 8-bit AVR processors
- Sieving for closest lattice vectors (with preprocessing)
- A Decade of Lattice Cryptography
- On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Lattice Signatures and Bimodal Gaussians
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Cryptography for the Internet
- High-Speed Signatures from Standard Lattices
- Better Algorithms for LWE and LWR
- Improvement and Efficient Implementation of a Lattice-Based Signature Scheme
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- New Algorithms for Learning in Presence of Errors
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
- On the Efficacy of Solving LWE by Reduction to Unique-SVP
- Lossy Trapdoor Functions and Their Applications
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Coded-BKW: Solving LWE Using Lattice Codes
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
- Trapdoors for hard lattices and new cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- New directions in nearest neighbor searching with applications to lattice sieving
- On the Design of Hardware Building Blocks for Modern Lattice-Based Encryption Schemes
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- A Toolkit for Ring-LWE Cryptography
- Lattice Decoding Attacks on Binary LWE
- Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
- Compact Ring-LWE Cryptoprocessor
- An Improved Compression Technique for Signatures Based on Learning with Errors
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$
