Pages that link to "Item:Q4677588"
From MaRDI portal
The following pages link to On the complexity of some cryptographic problems based on the general decoding problem (Q4677588):
Displaying 9 items.
- Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures (Q2055702) (← links)
- A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors (Q2958147) (← links)
- Parallel-CFS (Q3084252) (← links)
- Decoding One Out of Many (Q3102783) (← links)
- Basics of Secrecy Coding (Q3462200) (← links)
- (Q3755354) (← links)
- (Q5875794) (← links)
- On the computational hardness of the code equivalence problem in cryptography (Q6112221) (← links)
- A code-based hybrid signcryption scheme (Q6175435) (← links)