Problem of learning with errors and modern cryptosystems

MaRDI QIDQ3390944zbMATH OpenFDO

Authors Tilen Marc

Publication date 25 March 2022

zbMATH Keywords

homomorphic encryptionquantumly secure cryptographic scheme with public key

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Learning and adaptive systems in artificial intelligence (68T05) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Recommendations

• On lattices, learning with errors, random linear codes, and cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Classical hardness of learning with errors
• On the concrete hardness of learning with errors
• Learning with errors over rings. (Abstract)

Cited in

(7)

• Dual-mode cryptosystem based on the learning with errors problem
• Secure hybrid encryption in the standard model from hard learning problems
• Improved attacks against key reuse in learning with errors key exchange
• The polynomial learning with errors problem and the smearing condition
• Generalized learning problems and applications to non-commutative cryptography. (Extended abstract)
• Post-quantum insecurity from LWE
• On the LWE cryptosystem with more general disturbance

This page was built for publication: Problem of learning with errors and modern cryptosystems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3390944)