Pages that link to "Item:Q3650687"

The following pages link to Security Bounds for the Design of Code-Based Cryptosystems (Q3650687):

Displaying 32 items.

• Structural cryptanalysis of McEliece schemes with compact keys (Q264131) (← links)
• Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications (Q398976) (← links)
• Quantum-assisted QD-CFS signatures (Q473200) (← links)
• A code-based group signature scheme (Q510499) (← links)
• Information set decoding in the Lee metric with applications to cryptography (Q825935) (← links)
• Improved combinatorial algorithms for the inhomogeneous short integer solution problem (Q1715853) (← links)
• Public key compression for constrained linear signature schemes (Q1726681) (← links)
• An algorithmic framework for the generalized birthday problem (Q1999907) (← links)
• Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures (Q2055702) (← links)
• Cryptanalysis of the binary permuted kernel problem (Q2117060) (← 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 rank metric code-based group signature scheme (Q2163756) (← links)
• A code-based signature scheme from the Lyubashevsky framework (Q2192378) (← links)
• Computational aspects of retrieving a representation of an algebraic geometry code (Q2437321) (← links)
• Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece'' hardware reference implementation (Q2692373) (← links)
• Faster 2-Regular Information-Set Decoding (Q3005582) (← links)
• Zero-Sum Distinguishers for Iterated Permutations and Application to Keccak-f and Hamsi-256 (Q3084240) (← links)
• Wild McEliece (Q3084251) (← links)
• Parallel-CFS (Q3084252) (← links)
• Full Cryptanalysis of the Chen Identification Protocol (Q3102782) (← links)
• Decoding One Out of Many (Q3102783) (← links)
• An Efficient Attack on All Concrete KKS Proposals (Q3102786) (← links)
• Monoidic Codes in Cryptography (Q3102791) (← links)
• A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory (Q3193273) (← links)
• Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model (Q3195263) (← links)
• Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes (Q3294870) (← links)
• Quantum Resistant Public Key Encryption Scheme polarRLCE (Q3294872) (← links)
• (Q4638056) (← links)
• On the hardness of the Lee syndrome decoding problem (Q6089464) (← links)
• An algorithm for generalized syndrome decoding problem (Q6112190) (← links)
• Improved information set decoding algorithms over Galois ring in the Lee metric (Q6131036) (← links)