Searching for "Efficient Cryptographic Schemes Provably as Secure as Subset Sum." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Efficient Cryptographic Schemes Provably as Secure as Subset Sum
by Russell Impagliazzo, Moni Naor — 1996 — Journal of Cryptology
…Efficient Cryptographic Schemes Provably as Secure as Subset Sum Russell Impagliazzo y…
Cited by 63 (6 self) – Add To MetaCart

Mclnnes, J., "Cryptography Using Weak Sources of Randomness," Tech. Report 194/87, U. of Toronto, 1987.
by Naor Personal Communication, Secure Pseudo-r, Om Number Generation — 1991
… Provably as Secure as Subset Sum", 30 t FOCS, 1989, pp. 236-241. [18] Impagliazzo, R. and Rudich, S…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB