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

Cited in

(only showing first 100 items - show all)

A method for efficiently computing the number of codewords of fixed weights in linear codes
Semantic security for the McEliece cryptosystem without random oracles
On the subgroup distance problem.
Separating models of learning with faulty teachers
Cryptanalysis of an E0-like combiner with memory
Cryptography with constant input locality
Classification of Griesmer codes and dual transform
On the covering radius of cyclic linear codes and arithmetic codes
New approaches to reduced-complexity decoding
Rigid linear binary codes
Factorization properties of lattices over the integers
On finding a cycle basis with a shortest maximal cycle
Improved identification schemes based on error-correcting codes
The hardness of approximate optima in lattices, codes, and systems of linear equations
Decoding of Reed Solomon codes beyond the error-correction bound
Efficient authentication from hard learning problems
Solving systems of linear Boolean equations with noisy right-hand sides over the reals
DAGS: key encapsulation using dyadic GS codes
A protocol for provably secure authentication of a tiny entity to a high performance computing one
Cryptanalysis of the Wu-Dawson public key cryptosystem
Computing sparse multiples of polynomials
Monotonic optimization based decoding for linear codes
Decomposition of modular codes for computing test sets and Graver basis
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
A modified Dual-Ouroboros public-key encryption using Gabidulin codes
An improved algorithm for learning sparse parities in the presence of noise
Characteristic vector and weight distribution of a linear code
A branch-cut-and-price algorithm for optimal decoding in digital communication systems
Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures
Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem
On the number of minimal codewords in codes generated by the adjacency matrix of a graph
Goppa codes over the \(p\)-adic integers and integers modulo \(p^e\)
Lights Out on graphs
A gapless code-based hash proof system based on RQC and its applications
Cryptanalysis of LEDAcrypt
A new post-quantum multivariate polynomial public key encapsulation algorithm
On the design and security of Lee metric McEliece cryptosystems
Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
An inductive construction of minimal codes
Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\)
Structural properties of self-dual monomial codes with application to code-based cryptography
Minimal linear codes constructed from functions
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
Designing efficient dyadic operations for cryptographic applications
A code-based signature scheme from the Lyubashevsky framework
A post-quantum hybrid encryption based on QC-LDPC codes in the multi-user setting
Cryptanalysis of a code-based one-time signature
Computational fuzzy extractors
Reproducible families of codes and cryptographic applications
Properties of syndrome distribution for blind reconstruction of cyclic codes
New rank codes based encryption scheme using partial circulant matrices
Hamming codes for wet paper steganography
Toward secure implementation of McEliece decryption
Sufficient conditions for monotonicity of the undetected error probability for large channel error probabilities
On the weight distribution of some minimal codes
Using low-density parity-check codes to improve the McEliece cryptosystem
ECC\(^2\): error correcting code and elliptic curve based cryptosystem
On the hardnesses of several quantum decoding problems
On the equivalence of two post-quantum cryptographic families
A new decryption failure attack against HQC
Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece hardware reference implementation
Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge
Inner-product functional encryption from random linear codes: trial and challenges
Code-based signatures from new proofs of knowledge for the syndrome decoding problem
Enhanced public key security for the McEliece cryptosystem
Differential power analysis of a McEliece cryptosystem
Masking large keys in hardware: a masked implementation of McEliece
Cryptography with auxiliary input and trapdoor from constant-noise LPN
A Survey of the Game “Lights Out!”
A decoding method of an n length binary BCH code through (n+1)n length binary cyclic code
Cryptography from learning parity with noise
Quantum computation vs. firewalls
Counting faces of randomly projected polytopes when the projection radically lowers dimension
A zero-knowledge identification scheme based on the q-ary syndrome decoding problem
Solving linear equations parameterized by Hamming weight
Full cryptanalysis of the Chen identification protocol
Decoding one out of many
Ensuring Message Embedding in Wet Paper Steganography
A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
On the ideal associated to a linear code
Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
On quantiles of minimal codeword weights of random linear codes over \(\mathbf{F}_p\)
On the parameterized complexity of \textsc{Girth} and \textsc{Connectivity} problems on linear matroids
Improved information set decoding for code-based cryptosystems with constrained memory
Basics of secrecy coding
How to Encrypt with the LPN Problem
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
Parallel and Concurrent Security of the HB and HB + Protocols
On the Security of HB# against a Man-in-the-Middle Attack
A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
Reducing Key Length of the McEliece Cryptosystem
Sur la complexité d'un problème de codage

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)