Analysis of error-correcting codes for lattice-based key exchange
From MaRDI portal
Publication:1726688
DOI10.1007/978-3-030-10970-7_17zbMath1447.94038OpenAlexW2794874206MaRDI QIDQ1726688
Johanna Sepulveda, Thomas Pöppelmann, Tim Fritzmann
Publication date: 20 February 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-10970-7_17
Linear codes (general theory) (94B05) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lizard: cut off the tail -- a practical post-quantum public-key encryption from LWE and LWR
- Lattice Signatures and Bimodal Gaussians
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
- On Ideal Lattices and Learning with Errors over Rings
- Low complexity LDPC decoder with modified Sum-Product algorithm
- Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes
- An Improved Compression Technique for Signatures Based on Learning with Errors