Analysis of Information Set Decoding for a Sub-linear Error Weight
From MaRDI portal
Publication:2802614
DOI10.1007/978-3-319-29360-8_10zbMath1405.94049OpenAlexW2278625784MaRDI QIDQ2802614
Rodolfo Canto Torres, Nicolas Sendrier
Publication date: 26 April 2016
Published in: Post-Quantum Cryptography (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01244886/file/sublinearISD.pdf
Related Items
SoK: how (not) to design and implement post-quantum cryptography, About Low DFR for QC-MDPC Decoding, Lower bounds on lattice sieving and information set decoding, Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes, Performance bounds for QC-MDPC codes decoders, McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD, Syndrome Decoding Estimator, Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes, New time-memory trade-offs for subset sum -- improving ISD in theory and practice, Syndrome decoding in the head: shorter signatures from zero-knowledge proofs, A study of error floor behavior in QC-MDPC codes, Improved information set decoding algorithms over Galois ring in the Lee metric, Lifting standard model reductions to common setup assumptions, Statistical decoding 2.0: reducing decoding to LPN, Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature, Quantum Resistant Public Key Encryption Scheme polarRLCE, Reproducible families of codes and cryptographic applications, TinyKeys: a new approach to efficient multi-party computation, A Secure and Efficient Code-Based Signature Scheme, Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures
Uses Software
