The following pages link to McEliece (Q14620):
Displaying 50 items.
- Input-trees of finite automata and application to cryptanalysis (Q1581120) (← links)
- On the security of the Courtois-Finiasz-Sendrier signature (Q1643411) (← links)
- Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes (Q1647553) (← links)
- Improved cryptanalysis of rank metric schemes based on Gabidulin codes (Q1650811) (← links)
- A reaction attack on the QC-LDPC McEliece cryptosystem (Q1673587) (← links)
- A pseudorandom number generator based on worst-case lattice problems (Q1675485) (← links)
- Extension of Overbeck's attack for Gabidulin-based cryptosystems (Q1696047) (← links)
- Coding for locality in reconstructing permutations (Q1696052) (← links)
- Variations of the McEliece cryptosystem (Q1742160) (← links)
- DAGS: key encapsulation using dyadic GS codes (Q1755960) (← links)
- Column scrambler for the GPT cryptosystem (Q1811105) (← links)
- Two varieties of finite automaton public key cryptosystem and digital signatures (Q1820751) (← links)
- Severely denting the Gabidulin version of the McEliece public key cryptosystem (Q1894268) (← links)
- Mathematical problems in cryptology (Q1910812) (← links)
- McEliece public key cryptosystems using algebraic-geometric codes (Q1923811) (← links)
- The non-gap sequence of a subcode of a generalized Reed-Solomon code (Q1934242) (← links)
- More constructions of lossy and correlation-secure trapdoor functions (Q1946593) (← links)
- Cryptanalysis of a code-based full-time signature (Q1981793) (← links)
- On the number of roots of Boolean polynomials (Q1991649) (← links)
- A framework for cryptographic problems from linear algebra (Q2023808) (← links)
- A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions (Q2025352) (← 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)
- A modified Dual-Ouroboros public-key encryption using Gabidulin codes (Q2032306) (← links)
- An improved algorithm for learning sparse parities in the presence of noise (Q2034402) (← links)
- LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding (Q2034992) (← links)
- Fast polynomial inversion for post quantum QC-MDPC cryptography (Q2051829) (← links)
- Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem (Q2056746) (← links)
- Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem (Q2068390) (← links)
- Variant of Niederreiter-based signature scheme for blockchain technology (Q2079919) (← links)
- Invertible matrices over some quotient rings: identification, generation, and analysis (Q2081006) (← links)
- Classification of Hadamard products of one-codimensional subcodes of Reed-Muller codes (Q2081012) (← links)
- Goppa codes over the \(p\)-adic integers and integers modulo \(p^e\) (Q2081332) (← links)
- A key-recovery timing attack on post-quantum primitives using the Fujisaki-Okamoto transformation and its application on FrodoKEM (Q2096530) (← links)
- Moderate-density parity-check codes from projective bundles (Q2099159) (← links)
- Cryptanalysis of LEDAcrypt (Q2102071) (← links)
- A new post-quantum multivariate polynomial public key encapsulation algorithm (Q2102772) (← links)
- Cryptographic one-way function based on boson sampling (Q2106039) (← links)
- On the design and security of Lee metric McEliece cryptosystems (Q2115742) (← links)
- Cryptanalysis of the binary permuted kernel problem (Q2117060) (← links)
- Construction of binary Hadamard codes and their \(s\)-PD sets (Q2119850) (← links)
- Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes (Q2129008) (← links)
- Structural properties of self-dual monomial codes with application to code-based cryptography (Q2149783) (← links)
- A new approach for finding low-weight polynomial multiples (Q2151296) (← links)
- CCA secure \textit{a posteriori} openable encryption in the standard model (Q2152171) (← links)
- A rank metric code-based group signature scheme (Q2163756) (← links)
- The rank-based cryptography library (Q2163759) (← links)
- Security analysis of a cryptosystem based on subspace subcodes (Q2163762) (← links)
- Information-set decoding with hints (Q2163764) (← links)
