The following pages link to McEliece (Q14620):
Displaying 50 items.
- A correction to a code-based blind signature scheme (Q2163765) (← links)
- Performance bounds for QC-MDPC codes decoders (Q2163766) (← links)
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD (Q2170098) (← links)
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography (Q2170105) (← links)
- Dual-Ouroboros: an improvement of the McNie scheme (Q2176294) (← links)
- Properties of constacyclic codes under the Schur product (Q2182071) (← links)
- Designing efficient dyadic operations for cryptographic applications (Q2191206) (← links)
- Relationship between codes and idempotents in a dihedral group algebra (Q2191952) (← links)
- A code-based signature scheme from the Lyubashevsky framework (Q2192378) (← links)
- A post-quantum hybrid encryption based on QC-LDPC codes in the multi-user setting (Q2192382) (← links)
- On the security of a Loidreau rank metric code based encryption scheme (Q2200523) (← links)
- Amount of key information contained in plain and encrypted text sets of the symmetric randomized McEliece cryptosystem (Q2215846) (← links)
- Computational fuzzy extractors (Q2216116) (← links)
- On constant-time QC-MDPC decoders with negligible failure rate (Q2221107) (← links)
- Optimized and secure implementation of ROLLO-I (Q2221116) (← links)
- Reproducible families of codes and cryptographic applications (Q2239799) (← links)
- Reducing the key size of McEliece cryptosystem from automorphism-induced Goppa codes via permutations (Q2289447) (← links)
- Squares of matrix-product codes (Q2302565) (← links)
- Properties of syndrome distribution for blind reconstruction of cyclic codes (Q2304654) (← links)
- Cryptanalysis of a rank-based signature with short public keys (Q2306903) (← links)
- Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices (Q2310392) (← links)
- On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes (Q2324762) (← links)
- Theory of supports for linear codes endowed with the sum-rank metric (Q2324767) (← links)
- Mathematical models of modified crypto-code means of information protection based on coding theory schemes (Q2331477) (← links)
- New rank codes based encryption scheme using partial circulant matrices (Q2334447) (← links)
- \(p(x)\)-circulants over finite fields and probability methods of their construction (Q2343937) (← links)
- Efficient representation of binary nonlinear codes: constructions and minimum distance computation (Q2350921) (← links)
- On extending propelinear structures of the Nordstrom-Robinson code to the Hamming code (Q2364475) (← links)
- Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice (Q2384012) (← links)
- Survey of information security (Q2385398) (← links)
- An approach for stream ciphers design based on joint computing over random and secret data (Q2390944) (← links)
- Monomial codes seen as invariant subspaces (Q2406589) (← links)
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions (Q2408283) (← links)
- Cryptanalysis of the CLR-cryptosystem (Q2414934) (← links)
- Structural attacks for public key cryptosystems based on Gabidulin codes (Q2425529) (← links)
- Practical collisions for EnRUPT (Q2429710) (← links)
- Modified Niederreiter type of GPT cryptosystem based on reducible rank codes (Q2436558) (← links)
- On the unique representation of very strong algebraic geometry codes (Q2436568) (← links)
- On the subfield subcodes of Hermitian codes (Q2436577) (← links)
- Computational aspects of retrieving a representation of an algebraic geometry code (Q2437321) (← links)
- Asymptotic behaviour of codes in rank metric over finite fields (Q2439748) (← links)
- Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\) (Q2448084) (← links)
- Enumeration of inequivalent irreducible Goppa codes (Q2489936) (← links)
- A fuzzy vault scheme (Q2491270) (← links)
- Asymmetric code-theoretical schemes constructed with the use of algebraic geometric codes (Q2508767) (← links)
- How to mask the structure of codes for a cryptographic use (Q2572961) (← links)
- Proof of conjectures on the true dimension of some binary Goppa codes (Q2572971) (← links)
- Effective attack on the McEliece cryptosystem based on Reed-Muller codes (Q2629742) (← 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)
