[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

*To*: [email protected]*Subject*: Tabling Results for Primes Considered Hard*From*: [email protected] (Timothy C. May)*Date*: Thu, 19 Oct 1995 12:18:32 -0700*Sender*: [email protected]

At 3:29 PM 10/19/95, Dr. Frederick B. Cohen wrote: >And how secure is the hash? It it possible to create values that will >hash to each prime (or something else that does the job)? Is the hash >something we can figure a way to precompute using massively parallel >processing so that we can then provide a set of codes which will produce >the desired results? (etc.) There are a lot of primes. Parallel processors will not help much. (These are deliberately understated points, natch.) With even such "small" RSA moduli as 200 digits, made up of primes of roughly 100 digits each, the computed hashes of these numbers would fill the universe many times over. (There are estimated to be about 10^75 particles of all types in the entire universe, so each particle would be "responsible" for storing the results (?) for about 10^20 or more primes.) There may be many more flaws and points of attack in Netscape and SSl, but precomputing hashes of the primes is not one of them. --Tim May Views here are not the views of my Internet Service Provider or Government. ---------:---------:---------:---------:---------:---------:---------:---- Timothy C. May | Crypto Anarchy: encryption, digital money, [email protected] 408-728-0152 | anonymous networks, digital pseudonyms, zero Corralitos, CA | knowledge, reputations, information markets, Higher Power: 2^756839 | black markets, collapse of governments. "National borders are just speed bumps on the information superhighway."

- Prev by Date:
**Re: [NOISE] Re: Postscript in Netscape** - Next by Date:
**Re: Netscape rewards are an insult** - Prev by thread:
**[NOISE], period** - Next by thread:
**textbooks** - Index(es):