The following pages link to McEliece (Q14620):
Displaying 50 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)
- Bit-oriented quantum public-key encryption based on quantum perfect encryption (Q331901) (← links)
- Cryptographic hardness of random local functions. Survey (Q332271) (← links)
- On the permutation groups of cyclic codes (Q356726) (← links)
- E-commerce of digital items and the problem of item validation: introducing the concept of reversible degradation (Q371254) (← links)
- Identity based identification from algebraic coding theory (Q391761) (← 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)
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes (Q398980) (← links)
- Extended multivariate public key cryptosystems with secure encryption function (Q415979) (← links)
- More on average case vs approximation complexity (Q430823) (← links)
- Quantum-assisted QD-CFS signatures (Q473200) (← links)
- A general construction for monoid-based knapsack protocols (Q476358) (← links)
- Using quantum key distribution for cryptographic purposes: a survey (Q477173) (← links)
- Strongly secure authenticated key exchange from factoring, codes, and lattices (Q494585) (← links)
- Error-correction of linear codes via colon ideals (Q497727) (← links)
- Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity (Q510448) (← links)
- A code-based group signature scheme (Q510499) (← links)
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes (Q626942) (← links)
- Lattice polly cracker cryptosystems (Q633081) (← links)
- On generating invertible circulant binary matrices with a prescribed number of ones (Q680936) (← links)
- On quasi-cyclic codes as a generalization of cyclic codes (Q714456) (← links)
- The weight distributions of two classes of \(p\)-ary cyclic codes with few weights (Q730374) (← links)
- On the decoding of binary cyclic codes with the Newton identities (Q733502) (← links)
- Bounded distance decoding of linear error-correcting codes with Gröbner bases (Q733503) (← links)
- The number of public keys in the McEliece-Sidel'nikov cryptosystem (Q735556) (← links)
- On quaternary Goppa codes (Q776285) (← links)
- Cryptanalysis of a system based on twisted Reed-Solomon codes (Q780371) (← links)
- Computer algebra tales on Goppa codes and McEliece cryptography (Q782704) (← links)
- Power error locating pairs (Q782853) (← links)
- Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\) (Q832357) (← links)
- Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment (Q857394) (← links)
- Cryptanalysis of AW digital signature scheme based on error-correcting codes (Q865996) (← links)
- A survey of some applications of finite fields (Q908045) (← links)
- Error-correcting codes and cryptography (Q937222) (← links)
- Attacks and counter-attacks on the GPT public key cryptosystem (Q1009035) (← links)
- Semantic security for the McEliece cryptosystem without random oracles (Q1009060) (← links)
- Blind detection of interleaver parameters (Q1010168) (← links)
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures (Q1015359) (← links)
- Separating models of learning with faulty teachers (Q1017667) (← links)
- Cryptanalysis of an E0-like combiner with memory (Q1021238) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- A time-luck tradeoff in relativized cryptography (Q1171879) (← links)
- New approaches to reduced-complexity decoding (Q1180151) (← links)
- A modified version of the Rao--Nam algebraic-code encryption scheme (Q1275606) (← links)
- Key generation of algebraic-code cryptosystems (Q1324386) (← links)
- SPMH: A solution to the problem of malicious hosts (Q1433982) (← links)
