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

Cited In (only showing first 100 items - show all)

A code-based signature scheme from the Lyubashevsky framework
Cryptanalysis of a code-based one-time signature
Computing coset leaders and leader codewords of binary codes
A gapless code-based hash proof system based on RQC and its applications
Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$
McEliece Cryptosystem Implementation: Theory and Practice
Diagnosis of Partially Observed Petri Net Based on Analytical Redundancy Relationships
Masking Large Keys in Hardware: A Masked Implementation of McEliece
An improved algorithm for learning sparse parities in the presence of noise
Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge
Performance bounds for QC-MDPC codes decoders
Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN
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
Solving systems of linear Boolean equations with noisy right-hand sides over the reals
On the Security of HB# against a Man-in-the-Middle Attack
Oblivious Transfer Based on the McEliece Assumptions
Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH
Minimal linear codes constructed from functions
Low-complexity weak pseudorandom functions in $\mathtt{AC}0[\mathtt{MOD}2]$
Minimal linear codes arising from blocking sets
A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions
On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography
On the hardnesses of several quantum decoding problems
Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
TinyKeys: a new approach to efficient multi-party computation
Structural properties of self-dual monomial codes with application to code-based cryptography
The rank-based cryptography library
Key-recovery fault injection attack on the classic McEliece KEM
Information-set decoding with hints
Security analysis of a cryptosystem based on subspace subcodes
A protocol for provably secure authentication of a tiny entity to a high performance computing one
A branch-cut-and-price algorithm for optimal decoding in digital communication systems
Computational fuzzy extractors
A new identification algorithm
Characteristic vector and weight distribution of a linear code
A Practical Group Signature Scheme Based on Rank Metric
New approaches to reduced-complexity decoding
Information set decoding for Lee-metric codes using restricted balls
Quantum machine learning: a classical perspective
Ensuring Message Embedding in Wet Paper Steganography
Computing sparse multiples of polynomials
Monotonic optimization based decoding for linear codes
A New Dynamic Code-Based Group Signature Scheme
The solution space geometry of random linear equations
Cryptanalysis of the Wu-Dawson public key cryptosystem
On the number of minimal codewords in codes generated by the adjacency matrix of a graph
An inductive construction of minimal codes
Hamming codes for wet paper steganography
A Survey of the Game “Lights Out!”
Inner-product functional encryption from random linear codes: trial and challenges
Efficient authentication from hard learning problems
Weighted counting of solutions to sparse systems of equations
Goppa codes over the $p$-adic integers and integers modulo $p^e$
Cryptanalysis of LEDAcrypt
Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius
Using low-density parity-check codes to improve the McEliece cryptosystem
Lights Out on graphs
On the weight distribution of some minimal codes
Full cryptanalysis of the Chen identification protocol
CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN
Cryptanalysis of a code-based full-time signature
Rigid linear binary codes
Identity based identification from algebraic coding theory
On the security of the modified dual-Ouroboros PKE using Gabidulin codes
Gallager error-correcting codes for binary asymmetric channels
Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme
Boolean autoencoders and hypercube clustering complexity
On the subgroup distance problem.
Improved identification schemes based on error-correcting codes
How to Encrypt with the LPN Problem
Enhanced public key security for the McEliece cryptosystem
On quaternary Goppa codes
Practical entanglement distillation scheme using recurrence method and quantum low density parity check codes
Quantum computation vs. firewalls
On covering problems of codes
On finding a cycle basis with a shortest maximal cycle
Fast simplifications for Tarski formulas based on monomial inequalities
Monadic second-order model-checking on decomposable matroids
ECC$^2$: error correcting code and elliptic curve based cryptosystem
Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
A decoding method of an $n$ length binary BCH code through $(n+1)n$ length binary cyclic code
The return of the SDitH
Parallel and concurrent security of the HB and $HB^{+}$ protocols
A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
A zero-knowledge identification scheme based on the $q$-ary syndrome decoding problem
A modified Dual-Ouroboros public-key encryption using Gabidulin codes
Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem
Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures
A new post-quantum multivariate polynomial public key encapsulation algorithm
The complexity of the weight problem for permutation and matrix groups.
Cryptanalysis of an E0-like combiner with memory
New rank codes based encryption scheme using partial circulant matrices
The weight distribution of codes over finite chain rings
Solving linear equations parameterized by Hamming weight
A method for efficiently computing the number of codewords of fixed weights in linear codes
Classification of Griesmer codes and dual transform
Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece hardware reference implementation
A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
A new decryption failure attack against HQC

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)