Pages that link to "Item:Q2798769"
From MaRDI portal
The following pages link to Chosen-Ciphertext Security from Subset Sum (Q2798769):
Displaying 8 items.
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory (Q2055649) (← links)
- Naor-Yung paradigm with shared randomness and applications (Q2401764) (← links)
- Naor-Yung Paradigm with Shared Randomness and Applications (Q2827710) (← links)
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum (Q3408206) (← links)
- Chosen Ciphertext Security with Optimal Ciphertext Overhead (Q3600385) (← links)
- (Q4950040) (← links)
- Subset Sum Quantumly in 1.17 n . (Q5889072) (← links)
- Algebraic algorithms for variants of subset sum (Q6102280) (← links)