Analysis of information set decoding for a sub-linear error weight
From MaRDI portal
Recommendations
- Improved information set decoding for code-based cryptosystems with constrained memory
- The complexity of information set decoding
- Information-set decoding for linear codes over F_q
- On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
- Quantum information set decoding algorithms
Cited in
(48)- Generalized information-set decoding of \((L,g)\)-codes
- Quantum information set decoding algorithms
- Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures
- Lower bounds on lattice sieving and information set decoding
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Information-set decoding with hints
- Performance bounds for QC-MDPC codes decoders
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
- Reproducible families of codes and cryptographic applications
- On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Attacking code-based cryptosystems with information set decoding using special-purpose hardware
- Faster 2-regular information-set decoding
- Quantum resistant public key encryption scheme polarRLCE
- Improved information set decoding for code-based cryptosystems with constrained memory
- Information-set decoding for linear codes over F_q
- The complexity of information set decoding
- About Low DFR for QC-MDPC Decoding
- Syndrome Decoding Estimator
- A secure and efficient code-based signature scheme
- Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
- TinyKeys: a new approach to efficient multi-party computation
- 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
- Interleaved Prange: a new generic decoder for interleaved codes
- 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
- High weight code-based signature scheme from QC-LDPC codes
- Rigorous foundations for dual attacks in coding theory
- Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography
- Revisiting nearest-neighbor-based information set decoding
- A new approach based on quadratic forms to attack the McEliece cryptosystem
- Concrete time/memory trade-offs in generalised Stern's ISD algorithm
- The hardness of LPN over any integer ring and field for PCG applications
- Post-quantum cryptosystems: open problems and current solutions. Isogeny-based and code-based cryptosystems
- Efficient error-correcting codes for the HQC post-quantum cryptosystem
- CryptAttackTester: high-assurance attack analysis
- Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks
- Towards the security of McEliece's cryptosystem based on Hermitian subfield subcodes
- Worst and average case hardness of decoding via smoothing bounds
- Improvement of binary and non binary statistical decoding algorithm
- Ternary Syndrome Decoding with large weight
- Information set decoding in the Lee metric with applications to cryptography
- SoK: how (not) to design and implement post-quantum cryptography
This page was built for publication: Analysis of information set decoding for a sub-linear error weight
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802614)
