Information-set decoding for linear codes over F_q
From MaRDI portal
Information-set decoding for linear codes over \(\mathbb F q\)
Recommendations
- On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
- Quantum information set decoding algorithms
- Improved information set decoding for code-based cryptosystems with constrained memory
- Analysis of information set decoding for a sub-linear error weight
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Cited in
(55)- Generalized information-set decoding of \((L,g)\)-codes
- Quantum information set decoding algorithms
- DAGS: key encapsulation using dyadic GS codes
- Encryption scheme based on expanded Reed-Solomon codes
- On the design and security of Lee metric McEliece cryptosystems
- Construction of binary Hadamard codes and their \(s\)-PD sets
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Information-set decoding with hints
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
- Computational fuzzy extractors
- Some cryptanalytic and coding-theoretic applications of a soft Stern algorithm
- On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
- Information sets in abelian codes: defining sets and Groebner basis
- Structural cryptanalysis of McEliece schemes with compact keys
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem
- Inner-product functional encryption from random linear codes: trial and challenges
- Enhanced public key security for the McEliece cryptosystem
- Analysis of information set decoding for a sub-linear error weight
- Post-quantum cryptography: state of the art
- 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
- Optimizing information set decoding algorithms to attack cyclosymmetric MDPC codes
- On weak keys and forgery attacks against polynomial-based MAC schemes
- Faster 2-regular information-set decoding
- Wild McEliece
- Decoding one out of many
- Monoidic codes in cryptography
- Statistical Decoding of Codes over $\mathbb{F}_q$
- Wild McEliece Incognito
- Quantum resistant public key encryption scheme polarRLCE
- Improved information set decoding for code-based cryptosystems with constrained memory
- Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes
- The complexity of information set decoding
- Code-based cryptosystems using generalized concatenated codes
- IND-CCA2 secure McEliece-type modification in the standard model
- Time-memory tradeoffs for large-weight syndrome decoding in ternary codes
- Syndrome Decoding Estimator
- Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
- Generalization of the ball-collision algorithm
- On Simplifying Expressions with Mixed Boolean-Arithmetic
- On the hardness of the Lee syndrome decoding problem
- S-semantics -- an example
- An algorithm for generalized syndrome decoding problem
- On the computational hardness of the code equivalence problem in cryptography
- Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems
- Hardness estimates of the code equivalence problem in the rank metric
- Improved information set decoding algorithms over Galois ring in the Lee metric
- Lifting standard model reductions to common setup assumptions
- Wave Parameter Selection
- A new formulation of the linear equivalence problem and shorter less signatures
- A McEliece cryptosystem using permutation codes
- Information-set decoding for convolutional codes
- A novel PQ-KEM based on coding theory
- Improvement of binary and non binary statistical decoding algorithm
- Information set decoding in the Lee metric with applications to cryptography
This page was built for publication: Information-set decoding for linear codes over \(\mathbb F_q\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569139)