Pages that link to "Item:Q2894429"
From MaRDI portal
The following pages link to Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding (Q2894429):
Displaying 50 items.
- Structural cryptanalysis of McEliece schemes with compact keys (Q264131) (← links)
- Enhanced public key security for the McEliece cryptosystem (Q271573) (← links)
- Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension (Q310244) (← links)
- Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications (Q398976) (← links)
- Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity (Q510448) (← links)
- A code-based group signature scheme (Q510499) (← links)
- Information set decoding in the Lee metric with applications to cryptography (Q825935) (← links)
- CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN (Q1981773) (← links)
- An algorithmic framework for the generalized birthday problem (Q1999907) (← links)
- A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions (Q2025352) (← links)
- Encryption scheme based on expanded Reed-Solomon codes (Q2025358) (← 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)
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory (Q2055649) (← 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)
- Cryptanalysis of LEDAcrypt (Q2102071) (← 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)
- How to meet ternary LWE keys (Q2128581) (← links)
- Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes (Q2129008) (← links)
- Structural properties of self-dual monomial codes with application to code-based cryptography (Q2149783) (← links)
- How to find ternary LWE keys using locality sensitive hashing (Q2149799) (← links)
- A new approach for finding low-weight polynomial multiples (Q2151296) (← links)
- A rank metric code-based group signature scheme (Q2163756) (← links)
- Information-set decoding with hints (Q2163764) (← links)
- Performance bounds for QC-MDPC codes decoders (Q2163766) (← links)
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD (Q2170098) (← links)
- A code-based signature scheme from the Lyubashevsky framework (Q2192378) (← links)
- Reproducible families of codes and cryptographic applications (Q2239799) (← links)
- A new coding-based algorithm for finding closest pair of vectors (Q2420648) (← links)
- Computational aspects of retrieving a representation of an algebraic geometry code (Q2437321) (← 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)
- Improved classical and quantum algorithms for subset-sum (Q2692398) (← links)
- On the dimension and structure of the square of the dual of a Goppa code (Q2697482) (← 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)
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature (Q2698345) (← links)
- Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN (Q2835589) (← links)
- A sieve algorithm based on overlattices (Q2878827) (← links)
- A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors (Q2958147) (← links)
- Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory (Q3452571) (← links)
- Code-Based Cryptosystems Using Generalized Concatenated Codes (Q4610024) (← links)
- (Q4638056) (← links)
- Bounded Independence Plus Noise Fools Products (Q4641587) (← links)
- About Low DFR for QC-MDPC Decoding (Q5041211) (← links)
- Syndrome Decoding Estimator (Q5087253) (← links)
