scientific article; zbMATH DE number 3989251
From MaRDI portal
Publication:3752293
Recommendations
- Knapsack public key cryptosystems and Diophantine approximation
- scientific article; zbMATH DE number 4087587
- scientific article; zbMATH DE number 4033660
- On the Chor-Rivest knapsack cryptosystem
- On some cryptosystems based on algebraic codes
- scientific article; zbMATH DE number 6622827
- A knapsack-type public key cryptosystem based on arithmetic in finite fields
- COMBINATORIAL OPTIMIZATION AND THE KNAPSACK CIPHER
- Nonassociative algebraic structures in cryptography and coding
Cited in
(only showing first 100 items - show all)- Bounded distance decoding of linear error-correcting codes with Gröbner bases
- Identity based identification from algebraic coding theory
- Survey on side-channel attacks on code-based key encapsulation mechanism
- A code-based signature scheme from the Lyubashevsky framework
- Variant of Niederreiter-based signature scheme for blockchain technology
- Hardness estimates of the code equivalence problem in the rank metric
- Improved information set decoding algorithms over Galois ring in the Lee metric
- scientific article; zbMATH DE number 4033660 (Why is no real title available?)
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy
- Computational aspects of retrieving a representation of an algebraic geometry code
- Joint Source-Cryptographic-Channel Coding Based on Linear Block Codes
- A novel PQ-KEM based on coding theory
- Dihedral codes with prescribed minimum distance
- Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme
- A knapsack-like code using recurrence sequence representations
- A new algorithm for finding minimum-weight words in large linear codes
- A fault attack on the Niederreiter cryptosystem using binary irreducible Goppa codes
- MinRank Gabidulin encryption scheme on matrix codes
- Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling
- ABOUT THE CONP-COMPLETE “INJECTIVE KNAPSACK” PROBLEM
- On the structure of the Schur squares of twisted generalized Reed-Solomon codes and application to cryptanalysis
- On the parameters of a McEliece-type cryptosystem on D-codes based on binary Reed-Muller codes
- On two modifications of the McEliece PKE and the CFS signature scheme
- Enhanced public key security for the McEliece cryptosystem
- scientific article; zbMATH DE number 6622827 (Why is no real title available?)
- A framework for cryptographic problems from linear algebra
- A knapsack-type public key cryptosystem based on arithmetic in finite fields
- On quaternary Goppa codes
- Roadmap of post-quantum cryptography standardization: side-channel attacks and countermeasures
- Exploring decryption failures of BIKE: new class of weak keys and key recovery attacks
- Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
- Graphic lattice constructed by graceful-difference total colorings
- scientific article; zbMATH DE number 1846851 (Why is no real title available?)
- On the Key-Privacy Issue of McEliece Public-Key Encryption
- Parallel-CFS
- SPANSE: combining sparsity with density for efficient one-time code-based digital signatures
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- Code-Based Signature Schemes from Identification Protocols in the Rank Metric
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem
- An algorithm for generalized syndrome decoding problem
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
- Lattice polly cracker cryptosystems
- Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem
- Quadratic compact knapsack public-key cryptosystem
- A new post-quantum multivariate polynomial public key encapsulation algorithm
- On the square code of group codes
- Fault-injection attacks against NIST's post-quantum cryptography round 3 KEM candidates
- 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\)
- Encryption scheme based on expanded Reed-Solomon codes
- The McEliece-type cryptosystem based on D-codes
- Two modifications for Loidreau's code-based cryptosystem
- On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography
- The non-gap sequence of a subcode of a generalized Reed-Solomon code
- Algorithm 1033: parallel implementations for computing the minimum distance of a random linear code on distributed-memory architectures
- A generalization of NTRUEncrypt
- Monoidic codes in cryptography
- On some cryptosystems based on algebraic codes
- Key-recovery by side-channel information on the matrix-vector product in code-based cryptosystems
- Cryptanalysis of Ivanov-Krouk-Zyablov cryptosystem
- Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
- Mathematical problems in cryptology
- On checkable codes in group algebras
- More constructions of lossy and correlation-secure trapdoor functions
- A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
- Quasi-cyclic binary extended and expurgated Goppa codes and their parameters
- A zero-knowledge proof for the syndrome decoding problem in the Lee metric
- Higher-genus McEliece
- A side-channel attack against \textit{Classic McEliece} when loading the Goppa polynomial
- A secure and efficient code-based signature scheme
- A McEliece cryptosystem using permutation codes
- Square code attack on a modified Sidelnikov cryptosystem
- Estimates of the neighborhood volumes of binary codes via their weight spectra
- A NP-complete problem in coding theory with application to code based cryptography
- Efficient implementation of hybrid encryption from coding theory
- On the unique representation of very strong algebraic geometry codes
- Key-recovery fault injection attack on the classic McEliece KEM
- Skew differential Goppa codes and their application to McEliece cryptosystem
- Threshold Niederreiter: chosen-ciphertext security and improved distributed decoding
- Security analysis of a cryptosystem based on subspace subcodes
- Code-based cryptosystems using generalized concatenated codes
- Efficient generation of binary words of given weight
- On the maximum-likelihood decoding problem
- Quantum-assisted QD-CFS signatures
- Edge-difference total labeling and coloring of some bipartite graphs
- An algorithm for computing generalized Hamming weights and the Sage package \texttt{GHWs}
- Fast polynomial inversion for post quantum QC-MDPC cryptography
- Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes
- List Decoding for Binary Goppa Codes
- Asymmetric code-theoretical schemes constructed with the use of algebraic geometric codes
- A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes
- Wild McEliece
- On the hardness of the Lee syndrome decoding problem
- Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018
- The syndromes decoding algorithm in group codes
- Integer syndrome decoding in the presence of noise
- Cryptanalysis of a system based on twisted Reed-Solomon codes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3752293)