Pages that link to "Item:Q626942"
From MaRDI portal
The following pages link to Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes (Q626942):
Displaying 15 items.
- Enhanced public key security for the McEliece cryptosystem (Q271573) (← links)
- On generating invertible circulant binary matrices with a prescribed number of ones (Q680936) (← links)
- Encryption scheme based on expanded Reed-Solomon codes (Q2025358) (← links)
- Properties of constacyclic codes under the Schur product (Q2182071) (← links)
- Secure Message Authentication Against Related-Key Attack (Q2946884) (← links)
- Monoidic Codes in Cryptography (Q3102791) (← links)
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes (Q3540050) (← links)
- Reducing Key Length of the McEliece Cryptosystem (Q3637133) (← links)
- Code-Based Public-Key Cryptosystems and Their Applications (Q4931667) (← links)
- An Improved Rao–Nam Cryptosystem Based on Fractional Order Hyperchaotic System and EDF–QC–LDPC (Q5197653) (← links)
- Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling (Q6047445) (← links)
- Two classes of quasi-cyclic codes via irreducible polynomials (Q6107459) (← links)
- A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes (Q6204542) (← links)
- Theoretical analysis of decoding failure rate of non-binary QC-MDPC codes (Q6550574) (← links)
- Lossy cryptography from code-based assumptions (Q6652889) (← links)
