HELEN: a public-key cryptosystem based on the LPN and the decisional minimal distance problems

DOI10.1007/978-3-642-38553-7_6MaRDI QIDQ4924675zbMATH OpenOpenAlexFDO

Authors Alexandre Duc, Serge Vaudenay

Publication date 7 June 2013

Published in Progress in Cryptology – AFRICACRYPT 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38553-7_6

zbMATH Keywords

code-based cryptosystemlearning from parity with noise problemminimum distance problempublic-key cryptostemrandom linear code

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• How to Encrypt with the LPN Problem
• IND-CCA secure cryptography based on a variant of the LPN problem
• Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification
• Simple chosen-ciphertext security from low-noise LPN
• Cramer-Shoup like chosen ciphertext security from LPN

Cited in

(6)

• Towards efficient LPN-based symmetric encryption
• Solving LPN using covering codes
• On solving LPN using BKW and variants, Implementation and analysis
• Optimization of \(\mathsf {LPN}\) solving algorithms
• An iterative correction method for practically LPN solving
• Learning with errors with output dependencies: LWE, LWR, and physical learning problems under the same umbrella

This page was built for publication: HELEN: a public-key cryptosystem based on the LPN and the decisional minimal distance problems

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