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)- Semantic security for the McEliece cryptosystem without random oracles
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
- On the security of the Courtois-Finiasz-Sendrier signature
- Post-quantum key exchange for the Internet and the open quantum safe project
- Mathematical problems in cryptology
- The non-gap sequence of a subcode of a generalized Reed-Solomon code
- More constructions of lossy and correlation-secure trapdoor functions
- A framework for cryptographic problems from linear algebra
- Encryption scheme based on expanded Reed-Solomon codes
- Fast polynomial inversion for post quantum QC-MDPC cryptography
- Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem
- Variant of Niederreiter-based signature scheme for blockchain technology
- 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
- A new post-quantum multivariate polynomial public key encapsulation algorithm
- Security analysis of a cryptosystem based on subspace subcodes
- Properties of constacyclic codes under the Schur product
- A code-based signature scheme from the Lyubashevsky framework
- A post-quantum hybrid encryption based on QC-LDPC codes in the multi-user setting
- Dihedral codes with prescribed minimum distance
- On the Chor-Rivest knapsack cryptosystem
- A knapsack-based probabilistic encryption scheme
- On the unique representation of very strong algebraic geometry codes
- Computational aspects of retrieving a representation of an algebraic geometry code
- Asymmetric code-theoretical schemes constructed with the use of algebraic geometric codes
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem
- Retracted: Invertible matrices over some quotient rings: identification, generation, and analysis
- On the equivalence of two post-quantum cryptographic families
- Inner-product functional encryption from random linear codes: trial and challenges
- Enhanced public key security for the McEliece cryptosystem
- On weak keys and forgery attacks against polynomial-based MAC schemes
- Square code attack on a modified Sidelnikov cryptosystem
- List Decoding for Binary Goppa Codes
- Wild McEliece
- Parallel-CFS
- Decoding one out of many
- Monoidic codes in cryptography
- Wild McEliece Incognito
- scientific article; zbMATH DE number 6622827 (Why is no real title available?)
- A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
- Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
- Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
- Quantum resistant public key encryption scheme polarRLCE
- Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes
- Attacking and Defending the McEliece Cryptosystem
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
- Reducing Key Length of the McEliece Cryptosystem
- scientific article; zbMATH DE number 4033660 (Why is no real title available?)
- A knapsack-type public key cryptosystem based on arithmetic in finite fields
- Identity based identification from algebraic coding theory
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
- Efficient generation of binary words of given weight
- A new algorithm for finding minimum-weight words in large linear codes
- Code-based cryptosystems using generalized concatenated codes
- A knapsack-like code using recurrence sequence representations
- Quantum-assisted QD-CFS signatures
- scientific article; zbMATH DE number 1846851 (Why is no real title available?)
- Estimates of the neighborhood volumes of binary codes via their weight spectra
- A novel Niederreiter-like cryptosystem based on the \((u|u + \upsilon)\)-construction codes
- On some cryptosystems based on algebraic codes
- ABOUT THE CONP-COMPLETE “INJECTIVE KNAPSACK” PROBLEM
- A secure and efficient code-based signature scheme
- Joint Source-Cryptographic-Channel Coding Based on Linear Block Codes
- On the Key-Privacy Issue of McEliece Public-Key Encryption
- Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme
- Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
- A NP-complete problem in coding theory with application to code based cryptography
- Efficient implementation of hybrid encryption from coding theory
- On checkable codes in group algebras
- 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
- Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling
- Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes
- Skew differential Goppa codes and their application to McEliece cryptosystem
- On the hardness of the Lee syndrome decoding problem
- Graphic lattices made by graph felicitous-type labelings and colorings of topological coding
- Code-Based Signature Schemes from Identification Protocols in the Rank Metric
- Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018
- An algorithm for generalized syndrome decoding problem
- Hardness estimates of the code equivalence problem in the rank metric
- Improved information set decoding algorithms over Galois ring in the Lee metric
- Key-recovery fault injection attack on the classic McEliece KEM
- 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
- The syndromes decoding algorithm in group codes
- Fault-injection attacks against NIST's post-quantum cryptography round 3 KEM candidates
- Cryptanalysis of Ivanov-Krouk-Zyablov cryptosystem
- A code-based hybrid signcryption scheme
- Key-recovery by side-channel information on the matrix-vector product in code-based cryptosystems
- A side-channel attack against \textit{Classic McEliece} when loading the Goppa polynomial
- A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- Lattice polly cracker cryptosystems
- On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography
- LowMS: a new rank metric code-based KEM without ideal structure
- Memory-efficient quantum information set decoding algorithm
- A Hadamard product of linear codes: algebraic properties and algorithms for calculating it
- Complete classification of Hadamard products of codimension 1 subcodes of Reed-Muller 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)