scientific article; zbMATH DE number 3989251
From MaRDI portal
Publication:3752293
zbMATH Open0611.94007MaRDI QIDQ3752293FDOQ3752293
Publication date: 1986
Title of this publication is not available (Why is that?)
Recommendations
- Knapsack public key cryptosystems and Diophantine approximation
- scientific article
- scientific article
- On the Chor-Rivest knapsack cryptosystem
- On some cryptosystems based on algebraic codes
- scientific article
- 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)
- Joint Source-Cryptographic-Channel Coding Based on Linear Block Codes
- Computational aspects of retrieving a representation of an algebraic geometry code
- Оценки объемов окрестностей двоичных кодов в терминах их весовых спектров
- A fault attack on the Niederreiter cryptosystem using binary irreducible Goppa codes
- Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling
- A new algorithm for finding minimum-weight words in large linear codes
- Code-Based Cryptosystems Using Generalized Concatenated Codes
- ABOUT THE CONP-COMPLETE “INJECTIVE KNAPSACK” PROBLEM
- On two modifications of the McEliece PKE and the CFS signature scheme
- A Secure and Efficient Code-Based Signature Scheme
- 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
- Title not available (Why is that?)
- Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
- On the Key-Privacy Issue of McEliece Public-Key Encryption
- SPANSE: combining sparsity with density for efficient one-time code-based digital signatures
- An algorithm for generalized syndrome decoding problem
- Quantum Resistant Public Key Encryption Scheme polarRLCE
- 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
- The McEliece-type cryptosystem based on \(D\)-codes
- Two modifications for Loidreau's code-based cryptosystem
- Algorithm 1033: parallel implementations for computing the minimum distance of a random linear code on distributed-memory architectures
- A generalization of NTRUEncrypt
- 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 Novel Niederreiter-like cryptosystem based on the (u|u + υ)-construction codes
- Skew differential Goppa codes and their application to McEliece cryptosystem
- Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes
- A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes
- 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
- Asymmetric code-theoretical schemes constructed with the use of algebraic geometric codes
- 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
- Efficient error-correcting codes for the HQC post-quantum cryptosystem
- Lossy cryptography from code-based assumptions
- Retracted: Invertible matrices over some quotient rings: identification, generation, and analysis
- On the equivalence of two post-quantum cryptographic families
- Graphic lattices made by graph felicitous-type labelings and colorings of topological coding
- 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
- 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
- ON SOME CRYPTOSYSTEMS BASED ON ALGEBRAIC CODES
- Hardness estimates of the code equivalence problem in the rank metric
- Improved information set decoding algorithms over Galois ring in the Lee metric
- Identity based identification from algebraic coding theory
- A code-based signature scheme from the Lyubashevsky framework
- Title not available (Why is that?)
- Variant of Niederreiter-based signature scheme for blockchain technology
- Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy
- Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$
- Dihedral codes with prescribed minimum distance
- Decoding One Out of Many
- A knapsack-type public key cryptosystem based on arithmetic in finite fields
- A framework for cryptographic problems from linear algebra
- Enhanced public key security for the McEliece cryptosystem
- On quaternary Goppa codes
- Cryptanalysis of Public-Key Cryptosystems That Use Subcodes of Algebraic Geometry Codes
- Title not available (Why is that?)
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
- Code-Based Signature Schemes from Identification Protocols in the Rank Metric
- Parallel-CFS
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem
- A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- Efficient Implementation of Hybrid Encryption from Coding Theory
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
- Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem
- Lattice polly cracker cryptosystems
- A new post-quantum multivariate polynomial public key encapsulation algorithm
- On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes
- Quadratic compact knapsack public-key cryptosystem
- Encryption scheme based on expanded Reed-Solomon codes
- 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
- Cryptanalysis of Ivanov-Krouk-Zyablov cryptosystem
- On checkable codes in group algebras
- Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
- Mathematical problems in cryptology
- More constructions of lossy and correlation-secure trapdoor functions
- A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
- Key-recovery fault injection attack on the classic McEliece KEM
- On the unique representation of very strong algebraic geometry codes
- Efficient generation of binary words of given weight
- Security analysis of a cryptosystem based on subspace subcodes
- Quantum-assisted QD-CFS signatures
- Fast polynomial inversion for post quantum QC-MDPC cryptography
- List Decoding for Binary Goppa Codes
- Wild McEliece
- On the security of the Courtois-Finiasz-Sendrier signature
- 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)
