Pages that link to "Item:Q3535349"
From MaRDI portal
The following pages link to Attacking and Defending the McEliece Cryptosystem (Q3535349):
Displayed 42 items.
- Structural cryptanalysis of McEliece schemes with compact keys (Q264131) (← links)
- Enhanced public key security for the McEliece cryptosystem (Q271573) (← links)
- Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension (Q310244) (← links)
- Practical cryptanalysis of ISO 9796-2 and EMV signatures (Q315558) (← links)
- 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)
- Computer algebra tales on Goppa codes and McEliece cryptography (Q782704) (← links)
- Information set decoding in the Lee metric with applications to cryptography (Q825935) (← links)
- Encryption scheme based on expanded Reed-Solomon codes (Q2025358) (← links)
- On the dimension of the subfield subcodes of 1-point Hermitian codes (Q2025360) (← links)
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD (Q2170098) (← links)
- Computational aspects of retrieving a representation of an algebraic geometry code (Q2437321) (← links)
- Using low-density parity-check codes to improve the McEliece cryptosystem (Q2658068) (← links)
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem (Q2663594) (← 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)
- Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes (Q3294870) (← links)
- Quantum Resistant Public Key Encryption Scheme polarRLCE (Q3294872) (← 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)
- (Q5041362) (← links)
- A digital signature scheme $\mathrm{mCFS}^{\mathrm{QC{-}LDPC}}$ based on $\mathrm{QC}$-$\mathrm{LDPC}$ codes (Q5071487) (← links)
- Syndrome Decoding Estimator (Q5087253) (← links)
- Quantum Cryptography: Key Distribution and Beyond (Q5134949) (← links)
- A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies (Q5854432) (← links)
- TinyKeys: a new approach to efficient multi-party computation (Q5918657) (← links)
- New time-memory trade-offs for subset sum -- improving ISD in theory and practice (Q6083669) (← links)
- A new security notion for PKC in the standard model: weaker, simpler, and still realizing secure channels (Q6113961) (← links)
- Breaking Goppa-based McEliece with hints (Q6116182) (← links)
- Improved information set decoding algorithms over Galois ring in the Lee metric (Q6131036) (← links)
- Decoding McEliece with a hint -- secret Goppa key parts reveal everything (Q6134806) (← links)
- Roadmap of post-quantum cryptography standardization: side-channel attacks and countermeasures (Q6145533) (← links)
- On new problems in asymmetric cryptography based on error-resistant coding (Q6173457) (← links)