Decoding One Out of Many
From MaRDI portal
Publication:3102783
DOI10.1007/978-3-642-25405-5_4zbMath1290.94167OpenAlexW1872498068MaRDI QIDQ3102783
Publication date: 25 November 2011
Published in: Post-Quantum Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25405-5_4
Related Items (27)
About Low DFR for QC-MDPC Decoding ⋮ Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension ⋮ A digital signature scheme $\mathrm{mCFS}^{\mathrm{QC{-}LDPC}}$ based on $\mathrm{QC}$-$\mathrm{LDPC}$ codes ⋮ A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory ⋮ Performance bounds for QC-MDPC codes decoders ⋮ McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD ⋮ Syndrome Decoding Estimator ⋮ Secure Message Authentication Against Related-Key Attack ⋮ Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems ⋮ Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes ⋮ On codes and learning with errors over function fields ⋮ Interleaved Prange: a new generic decoder for interleaved codes ⋮ A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors ⋮ Improved information set decoding algorithms over Galois ring in the Lee metric ⋮ Analysis of (U,U+V)-code problem with Gramian over binary and ternary fields ⋮ Non-interactive secure computation of inner-product from LPN and LWE ⋮ Exploring decryption failures of BIKE: new class of weak keys and key recovery attacks ⋮ A new key recovery side-channel attack on HQC with chosen ciphertext ⋮ Lifting standard model reductions to common setup assumptions ⋮ A code-based hybrid signcryption scheme ⋮ Reproducible families of codes and cryptographic applications ⋮ Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity ⋮ TinyKeys: a new approach to efficient multi-party computation ⋮ Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures ⋮ An Efficient Attack on All Concrete KKS Proposals ⋮ Cryptanalysis of LEDAcrypt ⋮ Rank-Metric Codes and Their Applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved identification schemes based on error-correcting codes
- An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
- Really Fast Syndrome-Based Hashing
- Parallel-CFS
- Attacking and Defending the McEliece Cryptosystem
- Code-based cryptography
- Security Bounds for the Design of Code-Based Cryptosystems
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- The Knapsack Hash Function proposed at Crypto’89 can be broken
- On the inherent intractability of certain coding problems (Corresp.)
- A new identification scheme based on syndrome decoding
- 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
- On the complexity of some cryptographic problems based on the general decoding problem
- Smaller Decoding Exponents: Ball-Collision Decoding
- Linearization Attacks Against Syndrome Based Hashes
This page was built for publication: Decoding One Out of Many
