Worst and average case hardness of decoding via smoothing bounds

DOI10.1007/978-3-031-91823-0_12MaRDI QIDQ6951440zbMATH OpenFDO

Authors Thomas Debris-Alazard, Nicolas Resch

Publication date 29 July 2025

Full work available at URL https://doi.org/10.1007/978-3-031-91823-0_12

zbMATH Keywords

code-based cryptographydecoding

Mathematics Subject Classification ID

Cryptography (94A60) Decoding (94B35)

Cites work

• A new identification scheme based on syndrome decoding
• Analysis of information set decoding for a sub-linear error weight
• Bounds on Distance Distributions in Codes of Known Size
• scientific article; zbMATH DE number 1250549 (Why is no real title available?)
• scientific article; zbMATH DE number 2081064 (Why is no real title available?)
• Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• On the hardness of the NTRU problem
• On the ring-LWE and polynomial-LWE problems
• Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography
• Pseudorandomness of ring-LWE for any ring and modulus
• Random codes: minimum distances and error exponents
• Smoothing codes and lattices: systematic study and new bounds
• 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

Cited in

(1)

• A minrank-based encryption scheme à la Alekhnovich-Regev

This page was built for publication: Worst and average case hardness of decoding via smoothing bounds

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