Cited in
(only showing first 100 items - show all)- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- Bounded distance decoding of linear error-correcting codes with Gröbner bases
- Overview of the McEliece cryptosystem and its security
- Identity based identification from algebraic coding theory
- The dual geometry of Hermitian two-point codes
- scientific article; zbMATH DE number 177617 (Why is no real title available?)
- Error-correcting codes and post-quantum cryptography
- A code-based signature scheme from the Lyubashevsky framework
- Variant of Niederreiter-based signature scheme for blockchain technology
- Enumeration of inequivalent irreducible Goppa codes
- Moderate-density parity-check codes from projective bundles
- Syndrome Decoding Estimator
- Modified Niederreiter type of GPT cryptosystem based on reducible rank codes
- Computational aspects of retrieving a representation of an algebraic geometry code
- Structural cryptanalysis of McEliece schemes with compact keys
- McEliece Cryptosystem Implementation: Theory and Practice
- scientific article; zbMATH DE number 4070796 (Why is no real title available?)
- Cryptographic one-way function based on boson sampling
- Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension
- Amount of key information contained in plain and encrypted text sets of the symmetric randomized McEliece cryptosystem
- Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)
- A fuzzy vault scheme
- A new algorithm for finding minimum-weight words in large linear codes
- An improved algorithm for learning sparse parities in the presence of noise
- On constant-time QC-MDPC decoders with negligible failure rate
- Optimized and secure implementation of ROLLO-I
- An efficient attack on all concrete KKS proposals
- The minimum distance of some narrow-sense primitive BCH codes
- Squares of matrix-product codes
- Efficient compression of SIDH public keys
- Improving code rate of McEliece's public-key cryptosystem
- Theory of supports for linear codes endowed with the sum-rank metric
- About Low DFR for QC-MDPC Decoding
- A Distinguisher for High-Rate McEliece Cryptosystems
- scientific article; zbMATH DE number 1618037 (Why is no real title available?)
- Enhanced public key security for the McEliece cryptosystem
- Block encryption of quantum messages
- Counting extended irreducible Goppa codes
- A framework for cryptographic problems from linear algebra
- Mathematical models of modified crypto-code means of information protection based on coding theory schemes
- On quaternary Goppa codes
- Asymptotic behaviour of codes in rank metric over finite fields
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge
- Hash-based signatures revisited: a dynamic FORS with adaptive chosen message security
- 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
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- Performance bounds for QC-MDPC codes decoders
- Extended multivariate public key cryptosystems with secure encryption function
- Differential power analysis of a McEliece cryptosystem
- On the design and security of Lee metric McEliece cryptosystems
- Construction of binary Hadamard codes and their \(s\)-PD sets
- Extension of Overbeck's attack for Gabidulin-based cryptosystems
- Monomial codes seen as invariant subspaces
- Parallel-CFS
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- Coding for locality in reconstructing permutations
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem
- Quantum public-key encryption schemes based on conjugate coding
- Improvement of lattice-based cryptography using CRT
- Variations of the McEliece cryptosystem
- Relationship between codes and idempotents in a dihedral group algebra
- Algebraic geometry codes and some appliations
- On the decoding of binary cyclic codes with the Newton identities
- Analysis of information set decoding for a sub-linear error weight
- Input-trees of finite automata and application to cryptanalysis
- Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment
- A key recovery attack on MDPC with CCA security using decoding errors
- \(p(x)\)-circulants over finite fields and probability methods of their construction
- A modified version of the Rao--Nam algebraic-code encryption scheme
- On the key space of the McEliece cryptosystem based on binary Reed–Muller codes
- A modified Dual-Ouroboros public-key encryption using Gabidulin codes
- Proof of conjectures on the true dimension of some binary Goppa codes
- Generalization of the ball-collision algorithm
- Deterministic root finding in finite fields
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
- A zero-knowledge identification scheme based on the \(q\)-ary syndrome decoding problem
- Post-quantum cryptography: state of the art
- Lattice polly cracker cryptosystems
- Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem
- Survey of information security
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Reproducible families of codes and cryptographic applications
- More on average case vs approximation complexity
- Efficient representation of binary nonlinear codes: constructions and minimum distance computation
- Cardinal rank metric codes over Galois rings
- A key-recovery timing attack on post-quantum primitives using the Fujisaki-Okamoto transformation and its application on FrodoKEM
- Cryptanalysis of an E0-like combiner with memory
- A new post-quantum multivariate polynomial public key encapsulation algorithm
- Rotation-equivalence classes of binary vectors
- Simple power analysis attack on the QC-LDPC McEliece cryptosystem
- Cryptanalysis of AW digital signature scheme based on error-correcting codes
- Susceptibility of digital signature schemes based on error-correcting codes to universal forgery
- The use of the direct sum decomposition algorithm for analyzing the strength of some McEliece-type cryptosystems
- Dual-Ouroboros: an improvement of the McNie scheme
- On the equivalence of cyclic and quasi-cyclic codes over finite fields
- On the structural security of a McEliece-type cryptosystem based on the sum of tensor products of binary Reed - Muller codes
- The security of the code-based signature scheme based on the Stern identification protocol
- Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
This page was built for software: McEliece
