Pages that link to "Item:Q3569139"
From MaRDI portal
The following pages link to Information-Set Decoding for Linear Codes over F q (Q3569139):
Displaying 36 items.
- Structural cryptanalysis of McEliece schemes with compact keys (Q264131) (← links)
- Enhanced public key security for the McEliece cryptosystem (Q271573) (← links)
- Information set decoding in the Lee metric with applications to cryptography (Q825935) (← links)
- DAGS: key encapsulation using dyadic GS codes (Q1755960) (← links)
- Encryption scheme based on expanded Reed-Solomon codes (Q2025358) (← links)
- On the design and security of Lee metric McEliece cryptosystems (Q2115742) (← links)
- Construction of binary Hadamard codes and their \(s\)-PD sets (Q2119850) (← links)
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes (Q2129008) (← links)
- Information-set decoding with hints (Q2163764) (← links)
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD (Q2170098) (← links)
- Computational fuzzy extractors (Q2216116) (← links)
- Information sets in abelian codes: defining sets and Groebner basis (Q2436565) (← links)
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem (Q2663594) (← links)
- Inner-product functional encryption from random linear codes: trial and challenges (Q2697925) (← links)
- Post-Quantum Cryptography: State of the Art (Q2803619) (← links)
- On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes (Q2946883) (← links)
- Wild McEliece (Q3084251) (← links)
- Monoidic Codes in Cryptography (Q3102791) (← links)
- Statistical Decoding of Codes over $\mathbb{F}_q$ (Q3102793) (← links)
- Wild McEliece Incognito (Q3102796) (← links)
- Quantum Resistant Public Key Encryption Scheme polarRLCE (Q3294872) (← links)
- Cryptanalysis of Public-Key Cryptosystems That Use Subcodes of Algebraic Geometry Codes (Q3460457) (← links)
- Code-Based Cryptosystems Using Generalized Concatenated Codes (Q4610024) (← links)
- IND-CCA2 secure McEliece-type modification in the standard model (Q5071466) (← links)
- Time-Memory Tradeoffs for Large-Weight Syndrome Decoding in Ternary Codes (Q5087252) (← links)
- Syndrome Decoding Estimator (Q5087253) (← links)
- Generalization of the Ball-Collision Algorithm (Q5855596) (← links)
- On Simplifying Expressions with Mixed Boolean-Arithmetic (Q6057724) (← links)
- On the hardness of the Lee syndrome decoding problem (Q6089464) (← links)
- S-semantics -- an example (Q6102251) (← links)
- An algorithm for generalized syndrome decoding problem (Q6112190) (← links)
- On the computational hardness of the code equivalence problem in cryptography (Q6112221) (← links)
- Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems (Q6112240) (← links)
- Hardness estimates of the code equivalence problem in the rank metric (Q6130620) (← links)
- Improved information set decoding algorithms over Galois ring in the Lee metric (Q6131036) (← links)
- Lifting standard model reductions to common setup assumptions (Q6169031) (← links)