swMATH2076MaRDI QIDQ14620FDOQ14620
Author name not available (Why is that?)
Official website: http://www.springerlink.com/content/j734g77022505534/
Cited In (only showing first 100 items - show all)
- A code-based signature scheme from the Lyubashevsky framework
- Moderate-density parity-check codes from projective bundles
- Cryptographic one-way function based on boson sampling
- An efficient attack on all concrete KKS proposals
- An improved algorithm for learning sparse parities in the presence of noise
- About Low DFR for QC-MDPC Decoding
- Block encryption of quantum messages
- Hash-based signatures revisited: a dynamic FORS with adaptive chosen message security
- 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
- On the design and security of Lee metric McEliece cryptosystems
- Construction of binary Hadamard codes and their \(s\)-PD sets
- Monomial codes seen as invariant subspaces
- Quantum public-key encryption schemes based on conjugate coding
- Algebraic geometry codes and some appliations
- Deterministic root finding in finite fields
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
- A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions
- Encryption scheme based on expanded Reed-Solomon codes
- On the dimension of the subfield subcodes of 1-point Hermitian codes
- On the hardnesses of several quantum decoding problems
- Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices
- \textit{Encode-then-encrypt}: a novel framework for reliable and secure communication
- Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
- Mathematical problems in cryptology
- Structural properties of self-dual monomial codes with application to code-based cryptography
- On the subfield subcodes of Hermitian codes
- Faster 2-regular information-set decoding
- LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding
- A NP-complete problem in coding theory with application to code based cryptography
- The rank-based cryptography library
- A new approach for finding low-weight polynomial multiples
- CCA secure \textit{a posteriori} openable encryption in the standard model
- Information-set decoding with hints
- Security analysis of a cryptosystem based on subspace subcodes
- Modeling Bit Flipping Decoding Based on Nonorthogonal Check Sums With Application to Iterative Decoding Attack of McEliece Cryptosystem
- Semantic security and indistinguishability in the quantum world
- CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
- Fast polynomial inversion for post quantum QC-MDPC cryptography
- Efficient finite field multiplication for isogeny based post quantum cryptography
- Properties of constacyclic codes under the Schur product
- Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice
- Cryptanalysis of a rank-based signature with short public keys
- BearSSL
- Inner-product functional encryption from random linear codes: trial and challenges
- A digital signature scheme \(\text{mCFS}^{\text{QC-LDPC}}\) based on QC-LDPC codes
- Classification of Hadamard products of one-codimensional subcodes of Reed-Muller codes
- Invertible matrices over some quotient rings: identification, generation, and analysis
- Goppa codes over the \(p\)-adic integers and integers modulo \(p^e\)
- Cryptanalysis of LEDAcrypt
- PQClean
- Cryptography with auxiliary input and trapdoor from constant-noise LPN
- Title not available (Why is that?)
- LESS is more: code-based signatures without syndromes
- Cryptanalysis of a code-based full-time signature
- 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?)
- Enhanced public key security for the McEliece cryptosystem
- 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
- 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
- Lattice polly cracker cryptosystems
- Cryptanalysis of an E0-like combiner with memory
- 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
- Column scrambler for the GPT cryptosystem
- M4RI
- NTL
- NAXOS
- QC-LDPC
- LDPC
- HECC
- matrixss
- eBASH
- GUAVA
- mpFq
- AETG
- CFS
- eBACS
- gf2x
- MicroEliece
- Statistics Toolbox
- brnoeth.lib
- SUPERCOP
This page was built for software: McEliece
