HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems

DOI10.1007/978-3-642-38553-7_6zbMath1312.94047OpenAlexW1593488290MaRDI QIDQ4924675

Serge Vaudenay, Alexandre Duc

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

minimum distance problemcode-based cryptosystemrandom linear codelearning from parity with noise problempublic-key cryptostem

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

On solving LPN using BKW and variants, Implementation and analysis ⋮ Optimization of $$\mathsf {LPN}$$ Solving Algorithms ⋮ Solving LPN using covering codes ⋮ Towards efficient LPN-based symmetric encryption

This page was built for publication: HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems