The following pages link to (Q3803024):
Displayed 42 items.
- Structural cryptanalysis of McEliece schemes with compact keys (Q264131) (← links)
- Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity (Q510448) (← links)
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes (Q626942) (← links)
- Information set decoding in the Lee metric with applications to cryptography (Q825935) (← links)
- Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\) (Q832357) (← links)
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme (Q1633440) (← links)
- Severely denting the Gabidulin version of the McEliece public key cryptosystem (Q1894268) (← links)
- Encryption scheme based on expanded Reed-Solomon codes (Q2025358) (← links)
- Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem (Q2056746) (← links)
- Cryptanalysis of LEDAcrypt (Q2102071) (← links)
- On the design and security of Lee metric McEliece cryptosystems (Q2115742) (← links)
- Construction of binary Hadamard codes and their \(s\)-PD sets (Q2119850) (← links)
- Structural properties of self-dual monomial codes with application to code-based cryptography (Q2149783) (← links)
- Information-set decoding with hints (Q2163764) (← links)
- A code-based signature scheme from the Lyubashevsky framework (Q2192378) (← links)
- Computational fuzzy extractors (Q2216116) (← links)
- Computational aspects of retrieving a representation of an algebraic geometry code (Q2437321) (← links)
- Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece'' hardware reference implementation (Q2692373) (← links)
- On the dimension and structure of the square of the dual of a Goppa code (Q2697482) (← links)
- Faster 2-Regular Information-Set Decoding (Q3005582) (← links)
- Really Fast Syndrome-Based Hashing (Q3011909) (← links)
- Decoding One Out of Many (Q3102783) (← links)
- A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory (Q3193273) (← links)
- Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory (Q3452571) (← links)
- Attacking and Defending the McEliece Cryptosystem (Q3535349) (← links)
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes (Q3540050) (← links)
- Reducing Key Length of the McEliece Cryptosystem (Q3637133) (← links)
- A new algorithm for finding minimum-weight words in large linear codes (Q4608514) (← links)
- Code-Based Cryptosystems Using Generalized Concatenated Codes (Q4610024) (← links)
- Susceptibility of digital signature schemes based on error-correcting codes to universal forgery (Q4637797) (← links)
- Syndrome Decoding Estimator (Q5087253) (← links)
- A Secure and Efficient Code-Based Signature Scheme (Q5205021) (← links)
- Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$ (Q5739026) (← links)
- Generalization of the Ball-Collision Algorithm (Q5855596) (← links)
- TinyKeys: a new approach to efficient multi-party computation (Q5918657) (← links)
- Punctured syndrome decoding problem. Efficient side-channel attacks against \textit{Classic McEliece} (Q6088710) (← links)
- S-semantics -- an example (Q6102251) (← links)
- Solving the learning parity with noise problem using quantum algorithms (Q6103086) (← links)
- Hybrid decoding -- classical-quantum trade-offs for information set decoding (Q6111571) (← links)
- An algorithm for generalized syndrome decoding problem (Q6112190) (← links)
- Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems (Q6112240) (← links)
- Key-recovery by side-channel information on the matrix-vector product in code-based cryptosystems (Q6176064) (← links)