HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption
From MaRDI portal
Publication:1746967
DOI10.1007/978-3-319-72565-9_10zbMath1384.94098OpenAlexW2781263269MaRDI QIDQ1746967
Publication date: 26 April 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-72565-9_10
Related Items
A novel classical and quantum cryptographic scheme for data encryption ⋮ Polar coding for ring-LWE-based public key encryption
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum cryptography: public key distribution and coin tossing
- On the concrete hardness of learning with errors
- Post-quantum key exchange for the Internet and the open quantum safe project
- Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
- Speeding up the number theoretic transform for faster ideal lattice-based cryptography
- Revisiting the expected cost of solving uSVP and applications to LWE
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- Lattice Cryptography for the Internet
- Fast polynomial transform algorithms for digital convolution
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- On Ideal Lattices and Learning with Errors over Rings
- Some Recent Progress in Lattice-Based Cryptography
- Privacy Amplification by Public Discussion
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Post-Quantum Key Exchange on ARMv8-A: A New Hope for NEON Made Simple
- A Toolkit for Ring-LWE Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography