The following pages link to Monoidic Codes in Cryptography (Q3102791):
Displaying 9 items.
- Structural cryptanalysis of McEliece schemes with compact keys (Q264131) (← links)
- DAGS: key encapsulation using dyadic GS codes (Q1755960) (← 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)
- Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$ (Q5739026) (← links)
- Two classes of quasi-cyclic codes via irreducible polynomials (Q6107459) (← links)
- A code-based hybrid signcryption scheme (Q6175435) (← 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)
