Pages that link to "Item:Q3535349"
From MaRDI portal
The following pages link to Attacking and Defending the McEliece Cryptosystem (Q3535349):
Displayed 16 items.
- The dual geometry of Hermitian two-point codes (Q394203) (← links)
- Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications (Q398976) (← links)
- Error-correction of linear codes via colon ideals (Q497727) (← links)
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes (Q626942) (← links)
- Computational aspects of retrieving a representation of an algebraic geometry code (Q2437321) (← links)
- List Decoding for Binary Goppa Codes (Q3005580) (← links)
- Faster 2-Regular Information-Set Decoding (Q3005582) (← links)
- Wild McEliece (Q3084251) (← links)
- Decoding One Out of Many (Q3102783) (← links)
- Implementation of McEliece Based on Quasi-dyadic Goppa Codes for Embedded Devices (Q3102789) (← links)
- Simplified High-Speed High-Distance List Decoding for Alternant Codes (Q3102792) (← links)
- Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model (Q3195263) (← links)
- Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory (Q3452571) (← links)
- Basics of Secrecy Coding (Q3462200) (← links)
- A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model (Q3623048) (← links)
- Reducing Key Length of the McEliece Cryptosystem (Q3637133) (← links)