On the inherent intractability of certain coding problems (Corresp.)
From MaRDI portal
Publication:4156300
DOI10.1109/TIT.1978.1055873zbMath0377.94018WikidataQ28019921 ScholiaQ28019921MaRDI QIDQ4156300
Elwyn R. Berlekamp, Henk C. A. van Tilborg, Robert J. McEliece
Publication date: 1978
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius ⋮ On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids ⋮ A Summary of McEliece-Type Cryptosystems and their Security ⋮ Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory ⋮ Basics of Secrecy Coding ⋮ Covering Vectors by Spaces: Regular Matroids ⋮ Generalization of the Ball-Collision Algorithm ⋮ Quantum machine learning: a classical perspective ⋮ IND-CCA2 secure McEliece-type modification in the standard model ⋮ A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory ⋮ ON SOME CRYPTOSYSTEMS BASED ON ALGEBRAIC CODES ⋮ Sur la complexité d'un problème de codage ⋮ Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes ⋮ Attack on a code-based signature scheme from QC-LDPC codes ⋮ Security enhancement method using shortened error correcting codes ⋮ On Simplifying Expressions with Mixed Boolean-Arithmetic ⋮ A new key recovery attack on a code-based signature from the Lyubashevsky framework ⋮ The return of the SDitH ⋮ On the hardness of the Lee syndrome decoding problem ⋮ Assessing and Countering Reaction Attacks Against Post-Quantum Public-Key Cryptosystems Based on QC-LDPC Codes ⋮ Entanglement Between Hash Encodings and Signatures from ID Schemes with Non-binary Challenges: A Case Study on Lightweight Code-Based Signatures ⋮ Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018 ⋮ Interleaved Prange: a new generic decoder for interleaved codes ⋮ An algorithm for generalized syndrome decoding problem ⋮ Minimal codewords arising from the incidence of points and hyperplanes in projective spaces ⋮ Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems ⋮ On the (in)security of optimized Stern-like signature schemes ⋮ Improved information set decoding algorithms over Galois ring in the Lee metric ⋮ Key-recovery fault injection attack on the classic McEliece KEM ⋮ McEliece-type encryption based on Gabidulin codes with no hidden structure ⋮ 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 ⋮ A new key recovery side-channel attack on HQC with chosen ciphertext ⋮ Ternary forking lemma and its application to the analysis of one code-based signature ⋮ The weight distribution of codes over finite chain rings ⋮ On new problems in asymmetric cryptography based on error-resistant coding ⋮ Information set decoding for Lee-metric codes using restricted balls ⋮ 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 ⋮ How to Encrypt with the LPN Problem ⋮ Cryptanalysis of Harari's identification scheme ⋮ Code-Based Cryptosystems Using Generalized Concatenated Codes ⋮ Efficient and effective quantum compiling for entanglement-based machine learning on IBM Q devices ⋮ A New Efficient Threshold Ring Signature Scheme Based on Coding Theory ⋮ McEliece Cryptosystem Implementation: Theory and Practice ⋮ A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes ⋮ Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes ⋮ Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH ⋮ A survey on proper codes ⋮ TinyKeys: a new approach to efficient multi-party computation ⋮ Multisecret-sharing schemes and bounded distance decoding of linear codes ⋮ 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 ⋮ A New Dynamic Code-Based Group Signature Scheme ⋮ Parallel and Concurrent Security of the HB and HB + Protocols ⋮ On the Security of HB# against a Man-in-the-Middle Attack ⋮ Parallel and concurrent security of the HB and \(HB^{+}\) protocols ⋮ A Secure and Efficient Code-Based Signature Scheme ⋮ A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model ⋮ Counting faces of randomly projected polytopes when the projection radically lowers dimension ⋮ Diagnosis of Partially Observed Petri Net Based on Analytical Redundancy Relationships ⋮ On quantiles of minimal codeword weights of random linear codes over $\mathbf{F}_p$ ⋮ A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem ⋮ Weighted counting of solutions to sparse systems of equations ⋮ Reducing Key Length of the McEliece Cryptosystem ⋮ The solution space geometry of random linear equations ⋮ Full Cryptanalysis of the Chen Identification Protocol ⋮ Decoding One Out of Many ⋮ A new identification algorithm ⋮ Ensuring Message Embedding in Wet Paper Steganography ⋮ Gallager error-correcting codes for binary asymmetric channels ⋮ Oblivious Transfer Based on the McEliece Assumptions ⋮ Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme ⋮ Computing coset leaders and leader codewords of binary codes ⋮ A Novel Niederreiter-like cryptosystem based on the (u|u + υ)-construction codes ⋮ A Practical Group Signature Scheme Based on Rank Metric ⋮ The security of the code-based signature scheme based on the Stern identification protocol ⋮ An inductive construction of minimal codes ⋮ Toward secure implementation of McEliece decryption ⋮ Enhanced public key security for the McEliece cryptosystem ⋮ On the security of the modified dual-Ouroboros PKE using Gabidulin codes ⋮ Cryptography from Learning Parity with Noise ⋮ Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy ⋮ Quantum computation vs. firewalls ⋮ Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2\)] ⋮ Factorization properties of lattices over the integers ⋮ Solving linear equations parameterized by Hamming weight ⋮ On finding a cycle basis with a shortest maximal cycle ⋮ Improved identification schemes based on error-correcting codes ⋮ Structural properties of self-dual monomial codes with application to code-based cryptography ⋮ On the ideal associated to a linear code ⋮ The hardness of approximate optima in lattices, codes, and systems of linear equations ⋮ Minimal linear codes constructed from functions ⋮ Decoding of Reed Solomon codes beyond the error-correction bound ⋮ The rank-based cryptography library ⋮ Security analysis of a cryptosystem based on subspace subcodes ⋮ Information-set decoding with hints ⋮ Performance bounds for QC-MDPC codes decoders
This page was built for publication: On the inherent intractability of certain coding problems (Corresp.)
