Pages that link to "Item:Q3637133"

The following pages link to Reducing Key Length of the McEliece Cryptosystem (Q3637133):

Displaying 33 items.

• Structural cryptanalysis of McEliece schemes with compact keys (Q264131) (← links)
• On quasi-cyclic codes as a generalization of cyclic codes (Q714456) (← links)
• Cryptanalysis of a system based on twisted Reed-Solomon codes (Q780371) (← 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)
• Properties of constacyclic codes under the Schur product (Q2182071) (← links)
• A post-quantum hybrid encryption based on QC-LDPC codes in the multi-user setting (Q2192382) (← links)
• Dihedral codes with prescribed minimum distance (Q2232216) (← links)
• Reproducible families of codes and cryptographic applications (Q2239799) (← links)
• Computational aspects of retrieving a representation of an algebraic geometry code (Q2437321) (← links)
• ECC\(^2\): error correcting code and elliptic curve based cryptosystem (Q2663594) (← links)
• A Multivariate Encryption Scheme with Rainbow (Q2801772) (← links)
• Reducing the Key Size of Rainbow Using Non-commutative Rings (Q2889995) (← 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)
• Monoidic Codes in Cryptography (Q3102791) (← links)
• Statistical Decoding of Codes over $\mathbb{F}_q$ (Q3102793) (← links)
• Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes (Q3294870) (← links)
• New Variant of the McEliece Cryptosystem (Q3460478) (← links)
• Basics of Secrecy Coding (Q3462200) (← links)
• Code-Based Public-Key Cryptosystems and Their Applications (Q4931667) (← links)
• Quantum Cryptography: Key Distribution and Beyond (Q5134949) (← 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)
• On checkable codes in group algebras (Q5863515) (← 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)
• The syndromes decoding algorithm in group codes (Q6156920) (← links)
• On new problems in asymmetric cryptography based on error-resistant coding (Q6173457) (← links)
• A code-based hybrid signcryption scheme (Q6175435) (← links)