On the concrete hardness of learning with errors
From MaRDI portal
Publication:745110
DOI10.1515/jmc-2015-0016zbMath1352.94023MaRDI QIDQ745110
Martin R. Albrecht, Rachel Player, Sam Scott
Publication date: 13 October 2015
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc-2015-0016
94A60: Cryptography
Related Items
Privacy-Friendly Forecasting for the Smart Grid Using Homomorphic Encryption and the Group Method of Data Handling, On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL, Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges, Fiat-Shamir and correlation intractability from strong KDM-secure encryption, Homomorphic lower digits removal and improved FHE bootstrapping, Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data, Bootstrapping for approximate homomorphic encryption, On the asymptotic complexity of solving LWE, Post-quantum key exchange for the Internet and the open quantum safe project, Assessing the feasibility of single trace power analysis of Frodo, Public key compression for constrained linear signature schemes, A full RNS variant of approximate homomorphic encryption, Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes, HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption, Comparison analysis of Ding's RLWE-based key exchange protocol and NewHope variants, A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack, Estimation of the hardness of the learning with errors problem with a restricted number of samples, Parallel Implementation of BDD Enumeration for LWE, Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems, Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds, A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$
Uses Software
