Pages that link to "Item:Q3651272"
From MaRDI portal
The following pages link to Compact McEliece Keys from Goppa Codes (Q3651272):
Displaying 32 items.
- Structural cryptanalysis of McEliece schemes with compact keys (Q264131) (← links)
- Computer algebra tales on Goppa codes and McEliece cryptography (Q782704) (← links)
- DAGS: key encapsulation using dyadic GS codes (Q1755960) (← links)
- On the dimension of the subfield subcodes of 1-point Hermitian codes (Q2025360) (← links)
- A modified Dual-Ouroboros public-key encryption using Gabidulin codes (Q2032306) (← links)
- Non-binary irreducible quasi-cyclic parity-check subcodes of Goppa codes and extended Goppa codes (Q2153754) (← links)
- Security analysis of a cryptosystem based on subspace subcodes (Q2163762) (← links)
- Designing efficient dyadic operations for cryptographic applications (Q2191206) (← links)
- Reproducible families of codes and cryptographic applications (Q2239799) (← links)
- Computational aspects of retrieving a representation of an algebraic geometry code (Q2437321) (← links)
- Secure Message Authentication Against Related-Key Attack (Q2946884) (← links)
- Weaknesses in Two RFID Authentication Protocols (Q2947080) (← links)
- Square Code Attack on a Modified Sidelnikov Cryptosystem (Q2947081) (← links)
- Wild McEliece (Q3084251) (← links)
- A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem (Q3084253) (← links)
- Implementation of McEliece Based on Quasi-dyadic Goppa Codes for Embedded Devices (Q3102789) (← links)
- Monoidic Codes in Cryptography (Q3102791) (← links)
- Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes (Q3294870) (← links)
- Compact McEliece keys based on quasi-dyadic Srivastava codes (Q4650077) (← links)
- Code-Based Public-Key Cryptosystems and Their Applications (Q4931667) (← links)
- Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$ (Q5739026) (← links)
- A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography (Q5739036) (← links)
- Counting extended irreducible Goppa codes (Q5919148) (← links)
- Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes (Q6057208) (← links)
- A new key recovery attack on a code-based signature from the Lyubashevsky framework (Q6072205) (← links)
- Code-Based Signature Schemes from Identification Protocols in the Rank Metric (Q6104627) (← links)
- Two classes of quasi-cyclic codes via irreducible polynomials (Q6107459) (← links)
- Decoding McEliece with a hint -- secret Goppa key parts reveal everything (Q6134806) (← links)
- A code-based hybrid signcryption scheme (Q6175435) (← links)
- On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography (Q6487414) (← links)
- Factorization of invariant polynomials under actions of projective linear groups and its applications in coding theory (Q6542660) (← links)
- A new approach based on quadratic forms to attack the McEliece cryptosystem (Q6604863) (← links)
