Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography

DOI10.1007/978-981-99-8739-9_9zbMATH Open1546.94054MaRDI QIDQ6595926

Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard

Publication date: 30 August 2024

decoding problem OHCP worst-case to average-case search-to-decision reductions

Linear codes (general theory) (94B05) Cryptography (94A60) Decoding (94B35) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

Title not available (Why is that?)
On the ring-LWE and polynomial-LWE problems
Efficient pseudorandom correlation generators from ring-LPN
Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
Worst-case hardness for LPN and cryptographic hashing via code smoothing
Worst-case to average-case reductions for module lattices
Towards classical hardness of module-LWE: the linear rank case
Analysis of Information Set Decoding for a Sub-linear Error Weight
An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
Decoding One Out of Many
On Ideal Lattices and Learning with Errors over Rings
Asymptotic Improvement of the Gilbert–Varshamov Bound for Linear Codes
Efficient Public Key Encryption Based on Ideal Lattices
On the inherent intractability of certain coding problems (Corresp.)
Random codes: minimum distances and error exponents
Pseudorandomness of ring-LWE for any ring and modulus
Leftover Hash Lemma, Revisited
On lattices, learning with errors, random linear codes, and cryptography
An efficient key recovery attack on SIDH
A direct key recovery attack on SIDH
Breaking SIDH in polynomial time
On codes and learning with errors over function fields
On the hardness of the NTRU problem
Statistical decoding 2.0: reducing decoding to LPN
Correlated pseudorandomness from the hardness of quasi-abelian decoding

This page was built for publication: Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography

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