Verifying solutions to LWE with implications for concrete security

DOI10.3934/amc.2020057zbMath1464.94049OpenAlexW2999365019MaRDI QIDQ2025364

Palash Sarkar, Subhadip Singha

Publication date: 12 May 2021

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2020057

zbMATH Keywords

latticesstatistical testlearning with errorsdiscrete Gaussian samplingconcrete analysis

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60) Sampling theory in information and communication theory (94A20)

Related Items (2)

Classical reduction of gap SVP to LWE: a concrete security analysis ⋮ Concrete security from worst-case to average-case lattice reductions

Uses Software

• Magma
• SageMath
• FrodoKEM

Cites Work

• The Magma algebra system. I: The user language
• Another look at tightness. II: Practical issues in cryptography
• Public-key cryptosystems from the worst-case shortest vector problem
• On Ideal Lattices and Learning with Errors over Rings
• Classical hardness of learning with errors
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Verifying solutions to LWE with implications for concrete security