Information-Set Decoding for Linear Codes over F q
From MaRDI portal
Publication:3569139
DOI10.1007/978-3-642-12929-2_7zbMath1284.94101OpenAlexW1985709119MaRDI QIDQ3569139
Publication date: 17 June 2010
Published in: Post-Quantum Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12929-2_7
information-set decodingsecurity analysisStern attackgeneralized McEliece cryptosystemlinear codes over finite field
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items
Structural cryptanalysis of McEliece schemes with compact keys, Construction of binary Hadamard codes and their \(s\)-PD sets, Enhanced public key security for the McEliece cryptosystem, Information set decoding in the Lee metric with applications to cryptography, Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes, Cryptanalysis of Public-Key Cryptosystems That Use Subcodes of Algebraic Geometry Codes, Generalization of the Ball-Collision Algorithm, IND-CCA2 secure McEliece-type modification in the standard model, Information-set decoding with hints, McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD, ECC\(^2\): error correcting code and elliptic curve based cryptosystem, Time-Memory Tradeoffs for Large-Weight Syndrome Decoding in Ternary Codes, Syndrome Decoding Estimator, On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes, 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, Information sets in abelian codes: defining sets and Groebner basis, Inner-product functional encryption from random linear codes: trial and challenges, Code-Based Cryptosystems Using Generalized Concatenated Codes, Computational fuzzy extractors, Quantum Resistant Public Key Encryption Scheme polarRLCE, DAGS: key encapsulation using dyadic GS codes, Encryption scheme based on expanded Reed-Solomon codes, Post-Quantum Cryptography: State of the Art, Wild McEliece, Monoidic Codes in Cryptography, Statistical Decoding of Codes over $\mathbb{F}_q$, Wild McEliece Incognito, On the design and security of Lee metric McEliece cryptosystems
