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

Cited in

(only showing first 100 items - show all)

A practical group signature scheme based on rank metric
Identity based identification from algebraic coding theory
Rigid linear binary codes
Parallel and Concurrent Security of the HB and HB + Protocols
On the security of the modified dual-Ouroboros PKE using Gabidulin codes
A code-based signature scheme from the Lyubashevsky framework
Cryptanalysis of a code-based one-time signature
On the (in)security of optimized Stern-like signature schemes
Improved information set decoding algorithms over Galois ring in the Lee metric
McEliece-type encryption based on Gabidulin codes with no hidden structure
A gapless code-based hash proof system based on RQC and its applications
Gallager error-correcting codes for binary asymmetric channels
Sufficient conditions for monotonicity of the undetected error probability for large channel error probabilities
Boolean autoencoders and hypercube clustering complexity
Multisecret-sharing schemes and bounded distance decoding of linear codes
Computing coset leaders and leader codewords of binary codes
McEliece Cryptosystem Implementation: Theory and Practice
Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme
On the subgroup distance problem.
An improved algorithm for learning sparse parities in the presence of noise
On two modifications of the McEliece PKE and the CFS signature scheme
Improved identification schemes based on error-correcting codes
Enhanced public key security for the McEliece cryptosystem
Quantum computation vs. firewalls
Practical entanglement distillation scheme using recurrence method and quantum low density parity check codes
On quaternary Goppa codes
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
Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge
How to Encrypt with the LPN Problem
On covering problems of codes
Performance bounds for QC-MDPC codes decoders
On finding a cycle basis with a shortest maximal cycle
Fast simplifications for Tarski formulas based on monomial inequalities
Differential power analysis of a McEliece cryptosystem
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
Minimal linear codes constructed from partial spreads
The parameterized complexity of finding minimum bounded chains
Efficient and effective quantum compiling for entanglement-based machine learning on IBM Q devices
Monadic second-order model-checking on decomposable matroids
SPANSE: combining sparsity with density for efficient one-time code-based digital signatures
Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
ECC\(^2\): error correcting code and elliptic curve based cryptosystem
Solving systems of linear Boolean equations with noisy right-hand sides over the reals
An algorithm for generalized syndrome decoding problem
On the rank decoding problem over finite principal ideal rings
Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting
On the Security of HB# against a Man-in-the-Middle Attack
A decoding method of an \(n\) length binary BCH code through \((n+1)n\) length binary cyclic code
A modified Dual-Ouroboros public-key encryption using Gabidulin codes
Generalization of the ball-collision algorithm
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
Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem
On the parameterized complexity of \textsc{Girth} and \textsc{Connectivity} problems on linear matroids
Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures
The return of the SDitH
Parallel and concurrent security of the HB and \(HB^{+}\) protocols
Reproducible families of codes and cryptographic applications
The complexity of the weight problem for permutation and matrix groups.
On new problems in asymmetric cryptography based on error-resistant coding
Cryptanalysis of an E0-like combiner with memory
Minimal linear codes constructed from functions
A new post-quantum multivariate polynomial public key encapsulation algorithm
Oblivious Transfer Based on the McEliece Assumptions
Randomized decoding of Gabidulin codes beyond the unique decoding radius
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 security of the code-based signature scheme based on the Stern identification protocol
Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\)
Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography
Minimal linear codes arising from blocking sets
SDitH in the QROM
A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions
Two modifications for Loidreau's code-based cryptosystem
New rank codes based encryption scheme using partial circulant matrices
Solving linear equations parameterized by Hamming weight
On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography
On the hardnesses of several quantum decoding problems
Toward secure implementation of McEliece decryption
A method for efficiently computing the number of codewords of fixed weights in linear codes
The weight distribution of codes over finite chain rings
On quantiles of minimal codeword weights of random linear codes over \(\mathbf{F}_p\)
On some cryptosystems based on algebraic codes
Cryptanalysis of Harari's identification scheme
Classification of Griesmer codes and dual transform
Key-recovery by side-channel information on the matrix-vector product in code-based cryptosystems
On Simplifying Expressions with Mixed Boolean-Arithmetic
Security enhancement method using shortened error correcting codes
Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece hardware reference implementation
Structural properties of self-dual monomial codes with application to code-based cryptography
Attack on a code-based signature scheme from QC-LDPC codes
Diagnosis of partially observed Petri net based on analytical redundancy relationships
A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
TinyKeys: a new approach to efficient multi-party computation
A side-channel attack against \textit{Classic McEliece} when loading the Goppa polynomial
A secure and efficient code-based signature scheme

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)