Polar coding for ring-LWE-based public key encryption
From MaRDI portal
Publication:6159450
DOI10.1007/s12095-022-00607-1zbMath1520.94067OpenAlexW3175209871WikidataQ114849064 ScholiaQ114849064MaRDI QIDQ6159450
Publication date: 20 June 2023
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-022-00607-1
Cryptography (94A60) Other types of codes (94B60) Channel models (including quantum) in information and communication theory (94A40) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Unnamed Item
- Unnamed Item
- On the concrete hardness of learning with errors
- HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption
- Estimate all the {LWE, NTRU} schemes!
- Discretisation and product distributions in ring-LWE
- \(\delta\)-subgaussian random variables in cryptography
- The impact of error dependencies on Ring/Mod-LWE/LWR based schemes
- Unified Scaling of Polar Codes: Error Exponent, Scaling Exponent, Moderate Deviations, and Error Floors
- List Decoding of Polar Codes
- On Ideal Lattices and Learning with Errors over Rings
- Efficient Public Key Encryption Based on Ideal Lattices
- Coset codes. I. Introduction and geometrical classification
- Bit-interleaved coded modulation
- Sphere-bound-achieving coset codes and multilevel coset codes
- A Toolkit for Ring-LWE Cryptography
- Bit-Interleaved Coded Modulation Revisited: A Mismatched Decoding Perspective
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
- Isochronous Gaussian Sampling: From Inception to Implementation
- FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers
- How to Construct Polar Codes
- On lattices, learning with errors, random linear codes, and cryptography
