Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency
DOI10.1007/s10623-019-00654-5zbMath1469.94114OpenAlexW2949282077WikidataQ121366380 ScholiaQ121366380MaRDI QIDQ2334442
Raymond K. Zhao, Ron Steinfeld, Amin Sakzad
Publication date: 7 November 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-019-00654-5
public-key encryptionquantum-resistant cryptography\(\mathsf{MP} \text{- }\mathsf{LWE}\)cryptography implementationkemLattice-based cryptographymiddle-product learning with errors
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Finding shortest lattice vectors faster using quantum search
- On the ring-LWE and polynomial-LWE problems
- Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
- Middle-product Learning with Errors
- A modular analysis of the Fujisaki-Okamoto transformation
- The middle product algorithm. I: Speeding up the division and square root of power series
- Worst-case to average-case reductions for module lattices
- Large modulus ring-LWE \(\geq \) module-LWE
- Faster arithmetic for number-theoretic transforms
- Weak Instances of PLWE
- Concentration Inequalities
- Provably Weak Instances of Ring-LWE Revisited
- How (Not) to Instantiate Ring-LWE
- Lattice Cryptography for the Internet
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
- On the Efficacy of Solving LWE by Reduction to Unique-SVP
- Provably Weak Instances of Ring-LWE
- On Ideal Lattices and Learning with Errors over Rings
- Generalized Compact Knapsacks Are Collision Resistant
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Efficient Public Key Encryption Based on Ideal Lattices
- Minkowski's Convex Body Theorem and Integer Programming
- Efficient computation of the DFT with only a subset of input or output points
- Secure integration of asymmetric and symmetric encryption schemes
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Short Stickelberger Class Relations and Application to Ideal-SVP
- Recovering Short Generators of Principal Ideals in Cyclotomic Rings
- 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: Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency
