The following pages link to Solving Low Density Knapsacks (Q5019315):
Displaying 13 items.
- A semantically secure public key cryptoscheme using bit-pair shadows (Q344780) (← links)
- A provably secure non-iterative hash function resisting birthday attack (Q344781) (← links)
- A public key cryptosystem based on three new provable problems (Q418738) (← links)
- Quadratic compact knapsack public-key cryptosystem (Q980333) (← links)
- A pseudorandom number generator based on worst-case lattice problems (Q1675485) (← links)
- A new fully polynomial time approximation scheme for the interval subset sum problem (Q1675574) (← links)
- Improved broadcast attacks against subset sum problems via lattice oracle (Q2195373) (← links)
- A knapsack-based probabilistic encryption scheme (Q2384519) (← links)
- Safer parameters for the Chor-Rivest cryptosystem (Q2389473) (← links)
- A New Non-Merkle-Damgård Structural Hash Function with Provable Security (Q3196424) (← links)
- A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security (Q3196425) (← links)
- (Q5150580) (← links)
- Subset Sum Quantumly in 1.17 n . (Q5889072) (← links)
