Pages that link to "Item:Q4650077"
From MaRDI portal
The following pages link to Compact McEliece keys based on quasi-dyadic Srivastava codes (Q4650077):
Displaying 23 items.
- Structural cryptanalysis of McEliece schemes with compact keys (Q264131) (← links)
- Secure key encapsulation mechanism with compact ciphertext and public key from generalized Srivastava code (Q776356) (← links)
- Computer algebra tales on Goppa codes and McEliece cryptography (Q782704) (← links)
- DAGS: key encapsulation using dyadic GS codes (Q1755960) (← links)
- Cryptanalysis of a code-based full-time signature (Q1981793) (← links)
- Generic authenticated key exchange in the quantum random oracle model (Q2055699) (← 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)
- On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes (Q2946883) (← links)
- Compact McEliece Keys from Goppa Codes (Q3651272) (← links)
- McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks (Q5199224) (← links)
- Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$ (Q5739026) (← links)
- On the structural security of a McEliece-type cryptosystem based on the sum of tensor products of binary Reed - Muller codes (Q5871426) (← links)
- Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling (Q6047445) (← links)
- Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes (Q6057208) (← links)
- Automating the functional correspondence between higher-order evaluators and abstract machines (Q6102250) (← links)
- Two classes of quasi-cyclic codes via irreducible polynomials (Q6107459) (← links)
- The syndromes decoding algorithm in group codes (Q6156920) (← 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)
