Decoding one out of many
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3989251 (Why is no real title available?)
- 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 1284420 (Why is no real title available?)
- scientific article; zbMATH DE number 1942427 (Why is no real title available?)
- scientific article; zbMATH DE number 2081064 (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
- A new identification scheme based on syndrome decoding
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- An efficient pseudo-random generator provably as secure as syndrome decoding
- Attacking and Defending the McEliece Cryptosystem
- Code-based cryptography
- Improved identification schemes based on error-correcting codes
- Linearization Attacks Against Syndrome Based Hashes
- On the complexity of some cryptographic problems based on the general decoding problem
- On the inherent intractability of certain coding problems (Corresp.)
- Parallel-CFS
- Really fast syndrome-based hashing
- Security bounds for the design of code-based cryptosystems
- Smaller decoding exponents: ball-collision decoding
- The Knapsack Hash Function proposed at Crypto’89 can be broken
Cited in
(42)- 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
- Syndrome Decoding Estimator
- Somewhat homomorphic encryption based on random codes
- Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension
- Non-interactive secure computation of inner-product from LPN and LWE
- Reducing the number of qubits in quantum information set decoding
- An efficient attack on all concrete KKS proposals
- About Low DFR for QC-MDPC Decoding
- Exploring decryption failures of BIKE: new class of weak keys and key recovery attacks
- The hardness of LPN over any integer ring and field for PCG applications
- On the complexity of some cryptographic problems based on the general decoding problem
- Performance bounds for QC-MDPC codes decoders
- Secure message authentication against related-key attack
- A key recovery attack on MDPC with CCA security using decoding errors
- Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures
- Reproducible families of codes and cryptographic applications
- Rigorous foundations for dual attacks in coding theory
- A new key recovery side-channel attack on HQC with chosen ciphertext
- Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography
- Lifting standard model reductions to common setup assumptions
- Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
- Smaller decoding exponents: ball-collision decoding
- A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
- TinyKeys: a new approach to efficient multi-party computation
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
- Key recovery from side-channel power analysis attacks on non-SIMD HQC decryption
- Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes
- Short code-based one-out-of-many proofs and applications
- Rank-metric codes and their applications
- A code-based hybrid signcryption scheme
- Efficient error-correcting codes for the HQC post-quantum cryptosystem
- Wave Parameter Selection
- On codes and learning with errors over function fields
- A digital signature scheme \(\text{mCFS}^{\text{QC-LDPC}}\) based on QC-LDPC codes
- Interleaved Prange: a new generic decoder for interleaved codes
- Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity
- Cryptanalysis of LEDAcrypt
- Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems
- High weight code-based signature scheme from QC-LDPC codes
- \textsf{FuLeeca}: a Lee-based signature scheme
- Theoretical analysis of decoding failure rate of non-binary QC-MDPC codes
This page was built for publication: Decoding one out of many
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3102783)
