Pages that link to "Item:Q4156300"
From MaRDI portal
The following pages link to On the inherent intractability of certain coding problems (Corresp.) (Q4156300):
Displaying 50 items.
- A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions (Q2025352) (← links)
- A modified Dual-Ouroboros public-key encryption using Gabidulin codes (Q2032306) (← links)
- An improved algorithm for learning sparse parities in the presence of noise (Q2034402) (← links)
- Characteristic vector and weight distribution of a linear code (Q2040349) (← links)
- A branch-cut-and-price algorithm for optimal decoding in digital communication systems (Q2052394) (← links)
- Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures (Q2055702) (← links)
- Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem (Q2056746) (← links)
- On the number of minimal codewords in codes generated by the adjacency matrix of a graph (Q2065789) (← links)
- Goppa codes over the \(p\)-adic integers and integers modulo \(p^e\) (Q2081332) (← links)
- Lights Out on graphs (Q2088176) (← links)
- A gapless code-based hash proof system based on RQC and its applications (Q2099170) (← links)
- Cryptanalysis of LEDAcrypt (Q2102071) (← links)
- A new post-quantum multivariate polynomial public key encapsulation algorithm (Q2102772) (← links)
- On the design and security of Lee metric McEliece cryptosystems (Q2115742) (← links)
- Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric (Q2118524) (← links)
- An inductive construction of minimal codes (Q2119851) (← links)
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
- Structural properties of self-dual monomial codes with application to code-based cryptography (Q2149783) (← links)
- Minimal linear codes constructed from functions (Q2154886) (← links)
- The rank-based cryptography library (Q2163759) (← links)
- Security analysis of a cryptosystem based on subspace subcodes (Q2163762) (← links)
- Information-set decoding with hints (Q2163764) (← links)
- Performance bounds for QC-MDPC codes decoders (Q2163766) (← links)
- Designing efficient dyadic operations for cryptographic applications (Q2191206) (← links)
- A code-based signature scheme from the Lyubashevsky framework (Q2192378) (← links)
- A post-quantum hybrid encryption based on QC-LDPC codes in the multi-user setting (Q2192382) (← links)
- Cryptanalysis of a code-based one-time signature (Q2200516) (← links)
- Computational fuzzy extractors (Q2216116) (← links)
- Reproducible families of codes and cryptographic applications (Q2239799) (← links)
- Properties of syndrome distribution for blind reconstruction of cyclic codes (Q2304654) (← links)
- New rank codes based encryption scheme using partial circulant matrices (Q2334447) (← links)
- Hamming codes for wet paper steganography (Q2350929) (← links)
- Toward secure implementation of McEliece decryption (Q2360179) (← links)
- Sufficient conditions for monotonicity of the undetected error probability for large channel error probabilities (Q2432944) (← links)
- On the weight distribution of some minimal codes (Q2657132) (← links)
- Using low-density parity-check codes to improve the McEliece cryptosystem (Q2658068) (← links)
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem (Q2663594) (← links)
- On the hardnesses of several quantum decoding problems (Q2677282) (← links)
- On the equivalence of two post-quantum cryptographic families (Q2687966) (← links)
- A new decryption failure attack against HQC (Q2692347) (← links)
- Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece'' hardware reference implementation (Q2692373) (← links)
- Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge (Q2693627) (← links)
- Inner-product functional encryption from random linear codes: trial and challenges (Q2697925) (← links)
- Code-based signatures from new proofs of knowledge for the syndrome decoding problem (Q2698342) (← links)
- Differential Power Analysis of a McEliece Cryptosystem (Q2794516) (← links)
- Masking Large Keys in Hardware: A Masked Implementation of McEliece (Q2807215) (← links)
- Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN (Q2835589) (← links)
- A Survey of the Game “Lights Out!” (Q2848975) (← links)
- A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code (Q2863727) (← links)
- Cryptography from Learning Parity with Noise (Q2891361) (← links)
