The following pages link to Decoding One Out of Many (Q3102783):
Displaying 25 items.
- Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension (Q310244) (← links)
- Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity (Q510448) (← links)
- Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures (Q2055702) (← links)
- Cryptanalysis of LEDAcrypt (Q2102071) (← 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)
- Reproducible families of codes and cryptographic applications (Q2239799) (← links)
- Secure Message Authentication Against Related-Key Attack (Q2946884) (← links)
- A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors (Q2958147) (← links)
- An Efficient Attack on All Concrete KKS Proposals (Q3102786) (← links)
- A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory (Q3193273) (← links)
- About Low DFR for QC-MDPC Decoding (Q5041211) (← links)
- A digital signature scheme $\mathrm{mCFS}^{\mathrm{QC{-}LDPC}}$ based on $\mathrm{QC}$-$\mathrm{LDPC}$ codes (Q5071487) (← links)
- Syndrome Decoding Estimator (Q5087253) (← links)
- Rank-Metric Codes and Their Applications (Q5863764) (← links)
- TinyKeys: a new approach to efficient multi-party computation (Q5918657) (← links)
- Improved information set decoding algorithms over Galois ring in the Lee metric (Q6131036) (← links)
- A code-based hybrid signcryption scheme (Q6175435) (← links)
- High weight code-based signature scheme from QC-LDPC codes (Q6547874) (← links)
- Theoretical analysis of decoding failure rate of non-binary QC-MDPC codes (Q6550574) (← links)
- \textsf{FuLeeca}: a Lee-based signature scheme (Q6550578) (← links)
- Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography (Q6595926) (← links)
- Short code-based one-out-of-many proofs and applications (Q6635777) (← links)
- The hardness of LPN over any integer ring and field for PCG applications (Q6637566) (← links)
- Efficient error-correcting codes for the HQC post-quantum cryptosystem (Q6651927) (← links)
