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)- On the security of the Courtois-Finiasz-Sendrier signature
- A survey of some applications of finite fields
- Information set decoding for ring-linear codes
- Sneaking up the ranks: partial key exposure attacks on rank-based schemes
- LowMS: a new rank metric code-based KEM without ideal structure
- Post-quantum cryptosystems: open problems and current solutions. Isogeny-based and code-based cryptosystems
- Properties of constacyclic codes under the Schur product
- McEliece parameter sets optimized for processing in memory architectures
- On the security of two IKKR-type code-based cryptosystems
- A knapsack-based probabilistic encryption scheme
- Computer algebra tales on Goppa codes and McEliece cryptography
- A code-based hybrid signcryption scheme
- Decoding one out of many
- Wild McEliece Incognito
- Efficient error-correcting codes for the HQC post-quantum cryptosystem
- Lossy cryptography from code-based assumptions
- Attacking and Defending the McEliece Cryptosystem
- On a class of algebraic geometric codes
- 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
- Reducing Key Length of the McEliece Cryptosystem
- Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes
- Graphic lattices made by graph felicitous-type labelings and colorings of topological coding
- A post-quantum hybrid encryption based on QC-LDPC codes in the multi-user setting
- On weak keys and forgery attacks against polynomial-based MAC schemes
- Semantic security for the McEliece cryptosystem without random oracles
- 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
- On quasi-cyclic codes as a generalization of cyclic codes
- Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
- Post-quantum key exchange for the Internet and the open quantum safe project
- A novel Niederreiter-like cryptosystem based on the \((u|u + \upsilon)\)-construction codes
- Memory-efficient quantum information set decoding algorithm
- A combinatorial approach to avoiding weak keys in the BIKE cryptosystem
- Quantum resistant public key encryption scheme polarRLCE
- 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
- High weight code-based signature scheme from QC-LDPC codes
- \textsf{PALOMA}: binary separable Goppa-based \textsf{KEM}
- Theoretical analysis of decoding failure rate of non-binary QC-MDPC codes
- 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
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)