The following pages link to (Q3835408):
Displaying 50 items.
- Structural cryptanalysis of McEliece schemes with compact keys (Q264131) (← 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)
- On generating invertible circulant binary matrices with a prescribed number of ones (Q680936) (← links)
- Information set decoding in the Lee metric with applications to cryptography (Q825935) (← links)
- Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\) (Q832357) (← links)
- Semantic security for the McEliece cryptosystem without random oracles (Q1009060) (← links)
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme (Q1633440) (← links)
- CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN (Q1981773) (← links)
- Encryption scheme based on expanded Reed-Solomon codes (Q2025358) (← links)
- An improved algorithm for learning sparse parities in the presence of noise (Q2034402) (← 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)
- Cryptanalysis of the binary permuted kernel problem (Q2117060) (← links)
- Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric (Q2118524) (← links)
- Construction of binary Hadamard codes and their \(s\)-PD sets (Q2119850) (← 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)
- A new approach for finding low-weight polynomial multiples (Q2151296) (← links)
- Information-set decoding with hints (Q2163764) (← links)
- Reproducible families of codes and cryptographic applications (Q2239799) (← links)
- Computational aspects of retrieving a representation of an algebraic geometry code (Q2437321) (← links)
- Using low-density parity-check codes to improve the McEliece cryptosystem (Q2658068) (← 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)
- On the dimension and structure of the square of the dual of a Goppa code (Q2697482) (← links)
- Optimization of $$\mathsf {LPN}$$ Solving Algorithms (Q2958144) (← links)
- Faster 2-Regular Information-Set Decoding (Q3005582) (← links)
- Really Fast Syndrome-Based Hashing (Q3011909) (← links)
- Wild McEliece (Q3084251) (← links)
- A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem (Q3084253) (← links)
- Decoding One Out of Many (Q3102783) (← links)
- An Efficient Attack on All Concrete KKS Proposals (Q3102786) (← links)
- Quantum Resistant Public Key Encryption Scheme polarRLCE (Q3294872) (← links)
- Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory (Q3452571) (← links)
- Basics of Secrecy Coding (Q3462200) (← links)
- Attacking Reduced Round SHA-256 (Q3506406) (← links)
- Attacking and Defending the McEliece Cryptosystem (Q3535349) (← links)
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes (Q3540050) (← links)
- A new algorithm for finding minimum-weight words in large linear codes (Q4608514) (← links)
- (Q4638056) (← links)
- Syndrome Decoding Estimator (Q5087253) (← links)
- TinyKeys: a new approach to efficient multi-party computation (Q5918657) (← links)
- On the hardness of the Lee syndrome decoding problem (Q6089464) (← links)
- An algorithm for generalized syndrome decoding problem (Q6112190) (← links)
- Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems (Q6112240) (← links)
