Syndrome Decoding Estimator

DOI10.1007/978-3-030-97121-2_5MaRDI QIDQ5087253zbMATH OpenOpenAlexFDO

Authors Andre Esser, Emanuele Bellini

Publication date 8 July 2022

Published in Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-97121-2_5

zbMATH Keywords

nearest neighborestimatorsyndrome decodingcode-basedISD

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Syndrome-decoding algorithms for static-diagnosis models
• An algorithm for generalized syndrome decoding problem
• A new identification scheme based on syndrome decoding
• scientific article; zbMATH DE number 5380293
• Syndrome decoding of binary-rate<tex>k/n</tex>convolutional codes
• Decoding of convolutional codes using a syndrome trellis
• The syndromes decoding algorithm in group codes
• Statistical Decoding Revisited
• Reliability-based syndrome decoding of linear block codes

Cites work

• scientific article; zbMATH DE number 4070796 (Why is no real title available?)
• scientific article; zbMATH DE number 4112524 (Why is no real title available?)
• scientific article; zbMATH DE number 1942427 (Why is no real title available?)
• scientific article; zbMATH DE number 1775450 (Why is no real title available?)
• A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
• Analysis of information set decoding for a sub-linear error weight
• Attacking and Defending the McEliece Cryptosystem
• Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
• Decoding linear codes with high error rate and its impact for LPN security
• Decoding one out of many
• Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
• Grover vs. McEliece
• Improved quantum information set decoding
• Information-set decoding for linear codes over \(\mathbb F_q\)
• LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
• LPN decoded
• Lower bounds on lattice sieving and information set decoding
• On computing nearest neighbors with applications to decoding of binary linear codes
• Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms
• Quantum information set decoding algorithms
• Security bounds for the design of code-based cryptosystems
• Smaller decoding exponents: ball-collision decoding
• Syndrome Decoding Estimator

Cited in

(13)

• Concrete time/memory trade-offs in generalised Stern's ISD algorithm
• Ternary forking lemma and its application to the analysis of one code-based signature
• CryptAttackTester: high-assurance attack analysis
• Syndrome Decoding Estimator
• The hardness of LPN over any integer ring and field for PCG applications
• New time-memory trade-offs for subset sum -- improving ISD in theory and practice
• An estimator for the hardness of the MQ problem
• Memory-efficient quantum information set decoding algorithm
• Hybrid decoding -- classical-quantum trade-offs for information set decoding
• Partial key exposure attacks on BIKE, Rainbow and NTRU
• Revisiting nearest-neighbor-based information set decoding
• Integer syndrome decoding in the presence of noise
• McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD

Describes a project that uses

Uses Software

• McEliece
• BIKE

This page was built for publication: Syndrome Decoding Estimator

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