McEliece

swMATH2076MaRDI QIDQ14620FDOQ14620

Author name not available (Why is that?)

Described by source

• Practical power analysis attacks on software implementations of McEliece

Cited In (only showing first 100 items - show all)

• Identity based identification from algebraic coding theory
• The dual geometry of Hermitian two-point codes
• Enumeration of inequivalent irreducible Goppa codes
• Title not available (Why is that?)
• Structural cryptanalysis of McEliece schemes with compact keys
• A fuzzy vault scheme
• Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension
• A Distinguisher for High-Rate McEliece Cryptosystems
• On constant-time QC-MDPC decoders with negligible failure rate
• Optimized and secure implementation of ROLLO-I
• Title not available (Why is that?)
• A framework for cryptographic problems from linear algebra
• Enhanced public key security for the McEliece cryptosystem
• Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
• Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
• Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications
• Extended multivariate public key cryptosystems with secure encryption function
• Parallel-CFS
• ECC\(^2\): error correcting code and elliptic curve based cryptosystem
• Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
• On the decoding of binary cyclic codes with the Newton identities
• A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
• Proof of conjectures on the true dimension of some binary Goppa codes
• Cardinal rank metric codes over Galois rings
• Efficient representation of binary nonlinear codes: constructions and minimum distance computation
• Lattice polly cracker cryptosystems
• Cryptanalysis of an E0-like combiner with memory
• More on average case vs approximation complexity
• On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
• Polynomial time attack on wild McEliece over quadratic extensions
• The non-gap sequence of a subcode of a generalized Reed-Solomon code
• On decoding algorithms for generalized Reed-Solomon codes with errors and erasures
• Implementation of McEliece based on quasi-dyadic Goppa codes for embedded devices
• Monoidic codes in cryptography
• Related-key attack on full-round PICARO
• On checkable codes in group algebras
• Статистические характеристики весовых спектров случайных линейных кодов над $\mathrm{GF}(p)$
• Practical cryptanalysis of ISO 9796-2 and EMV signatures
• A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
• Column scrambler for the GPT cryptosystem
• On the unique representation of very strong algebraic geometry codes
• Bit-oriented quantum public-key encryption based on quantum perfect encryption
• Cryptographic hardness of random local functions. Survey
• Cryptography with constant input locality
• Quantum-assisted QD-CFS signatures
• A general construction for monoid-based knapsack protocols
• Using quantum key distribution for cryptographic purposes: a survey
• Structural attacks for public key cryptosystems based on Gabidulin codes
• List Decoding for Binary Goppa Codes
• Wild McEliece
• How to mask the structure of codes for a cryptographic use
• Rank-metric codes and their applications
• A CCA2 Secure Variant of the McEliece Cryptosystem
• Strongly secure authenticated key exchange from factoring, codes, and lattices
• Decoding one out of many
• On the permutation groups of cyclic codes
• Smaller keys for code-based cryptography: QC-MDPC McEliece implementations on embedded devices
• Wild McEliece Incognito
• Attacking and Defending the McEliece Cryptosystem
• Computer algebra tales on Goppa codes and McEliece cryptography
• Reducing Key Length of the McEliece Cryptosystem
• Error-correction of linear codes via colon ideals
• E-commerce of digital items and the problem of item validation: introducing the concept of reversible degradation
• A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
• Semantic security for the McEliece cryptosystem without random oracles
• Enumeration of extended irreducible binary Goppa codes of degree \(2^m\) and length \(2^n+1\)
• Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\)
• A code-based group signature scheme
• Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity
• Quantum McEliece public-key cryptosystem
• A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
• Quantum cryptography: key distribution and beyond
• Weak keys in the McEliece public-key cryptosystem
• Title not available (Why is that?)
• On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
• New criteria for MRD and Gabidulin codes and some rank-metric code constructions
• Title not available (Why is that?)
• Bounded distance decoding of linear error-correcting codes with Gröbner bases
• Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)
• Squares of matrix-product codes
• Theory of supports for linear codes endowed with the sum-rank metric
• Asymptotic behaviour of codes in rank metric over finite fields
• On quaternary Goppa codes
• Extension of Overbeck's attack for Gabidulin-based cryptosystems
• Improvement of lattice-based cryptography using CRT
• Coding for locality in reconstructing permutations
• Relationship between codes and idempotents in a dihedral group algebra
• Analysis of information set decoding for a sub-linear error weight
• A key recovery attack on MDPC with CCA security using decoding errors
• Input-trees of finite automata and application to cryptanalysis
• On the key space of the McEliece cryptosystem based on binary Reed–Muller codes
• Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment
• Generalization of the ball-collision algorithm
• A modified version of the Rao--Nam algebraic-code encryption scheme
• A zero-knowledge identification scheme based on the \(q\)-ary syndrome decoding problem
• A modified Dual-Ouroboros public-key encryption using Gabidulin codes
• Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem
• Survey of information security
• A key-recovery timing attack on post-quantum primitives using the Fujisaki-Okamoto transformation and its application on FrodoKEM
• A new post-quantum multivariate polynomial public key encapsulation algorithm

This page was built for software: McEliece