On the inherent intractability of certain coding problems (Corresp.)

Cited in

(only showing first 100 items - show all)

Randomized decoding of Gabidulin codes beyond the unique decoding radius
Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
A practical group signature scheme based on rank metric
Information-set decoding with hints
Security analysis of a cryptosystem based on subspace subcodes
On the weight distribution of some minimal codes
On the design and security of Lee metric McEliece cryptosystems
Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge
McEliece Cryptosystem Implementation: Theory and Practice
Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
Efficient authentication from hard learning problems
An inductive construction of minimal codes
Quantum machine learning: a classical perspective
Lights Out on graphs
Weighted counting of solutions to sparse systems of equations
A code-based signature scheme from the Lyubashevsky framework
A branch-cut-and-price algorithm for optimal decoding in digital communication systems
The rank-based cryptography library
Computational fuzzy extractors
Ensuring Message Embedding in Wet Paper Steganography
Cryptanalysis of a code-based one-time signature
Characteristic vector and weight distribution of a linear code
A new identification algorithm
Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
Computing sparse multiples of polynomials
Masking large keys in hardware: a masked implementation of McEliece
On the hardnesses of several quantum decoding problems
Goppa codes over the \(p\)-adic integers and integers modulo \(p^e\)
Full cryptanalysis of the Chen identification protocol
Hamming codes for wet paper steganography
Inner-product functional encryption from random linear codes: trial and challenges
CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN
Cryptanalysis of a code-based full-time signature
Minimal linear codes arising from blocking sets
A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions
Diagnosis of partially observed Petri net based on analytical redundancy relationships
On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography
Key-recovery fault injection attack on the classic McEliece KEM
Cryptanalysis of LEDAcrypt
Cryptography with auxiliary input and trapdoor from constant-noise LPN
A Survey of the Game “Lights Out!”
The solution space geometry of random linear equations
Using low-density parity-check codes to improve the McEliece cryptosystem
New approaches to reduced-complexity decoding
An improved algorithm for learning sparse parities in the presence of noise
Monotonic optimization based decoding for linear codes
Computing coset leaders and leader codewords of binary codes
Solving systems of linear Boolean equations with noisy right-hand sides over the reals
TinyKeys: a new approach to efficient multi-party computation
Cryptanalysis of the Wu-Dawson public key cryptosystem
Performance bounds for QC-MDPC codes decoders
On the number of minimal codewords in codes generated by the adjacency matrix of a graph
Oblivious Transfer Based on the McEliece Assumptions
Information set decoding for Lee-metric codes using restricted balls
Parameterized intractability of even set and shortest vector problem from Gap-ETH
A gapless code-based hash proof system based on RQC and its applications
A protocol for provably secure authentication of a tiny entity to a high performance computing one
A New Dynamic Code-Based Group Signature Scheme
Structural properties of self-dual monomial codes with application to code-based cryptography
On the Security of HB# against a Man-in-the-Middle Attack
Minimal linear codes constructed from functions
Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\)
New rank codes based encryption scheme using partial circulant matrices
A method for efficiently computing the number of codewords of fixed weights in linear codes
The complexity of the weight problem for permutation and matrix groups.
A Summary of McEliece-Type Cryptosystems and their Security
Rigid linear binary codes
Enhanced public key security for the McEliece cryptosystem
How to Encrypt with the LPN Problem
On finding a cycle basis with a shortest maximal cycle
Identity based identification from algebraic coding theory
Cryptanalysis of an E0-like combiner with memory
Minimal codewords arising from the incidence of points and hyperplanes in projective spaces
A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
On the subgroup distance problem.
A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
Key masking using biometry
A zero-knowledge identification scheme based on the \(q\)-ary syndrome decoding problem
Computing sharp recovery structures for locally recoverable codes
Monadic second-order model-checking on decomposable matroids
On quaternary Goppa codes
Reducing Key Length of the McEliece Cryptosystem
Fast simplifications for Tarski formulas based on monomial inequalities
On the security of the modified dual-Ouroboros PKE using Gabidulin codes
The weight distribution of codes over finite chain rings
A modified Dual-Ouroboros public-key encryption using Gabidulin codes
Practical entanglement distillation scheme using recurrence method and quantum low density parity check codes
Classification of Griesmer codes and dual transform
ECC\(^2\): error correcting code and elliptic curve based cryptosystem
Quantum computation vs. firewalls
A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
Decoding one out of many
Secure and practical randomized stream ciphers based on Reed-Solomon codes
A new decryption failure attack against HQC
DAGS: key encapsulation using dyadic GS codes
Counting faces of randomly projected polytopes when the projection radically lowers dimension
Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
Boolean autoencoders and hypercube clustering complexity
Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy

This page was built for publication: On the inherent intractability of certain coding problems (Corresp.)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4156300)