Re: Question from an intelligent (?) layman
- From: Unruh <unruh-spam@xxxxxxxxxxxxxx>
- Date: 23 Nov 2006 22:38:48 GMT
"Al" <alanpeg@xxxxxxxxx> writes:
I understand that one element of cryptography is to publish a large
number that is the product of two primes. It is believed impossible to
factor that number (call it N). But can't one make a table of products
Not impossible, just difficult.
of pimes and just compare the key with values in the table? ForHOw many entries would the table have if one wanted all numbers of lenght
example take the primes 2, 3, 5, and 7:
1000 bits? HOw much disk space is there in the world? Compare the two
numbers. Discuss.
N Primes
--- ---------
6 2*3
10 2*5
14 2*7
15 3*5
21 3*7
35 5*7
Now if N =21, one goes to the table and reads off the answer (3*7). Is
this wrong or am I missing something? I will appreciate any comments.
No you are not wrong, but see above.
Al Rosenfield
Columbus OH
.
- References:
- Prev by Date: Re: Strongest encryption algorithm
- Next by Date: Re: Strongest encryption algorithm
- Previous by thread: Re: Question from an intelligent (?) layman
- Next by thread: Question from an intelligent (?) layman
- Index(es):
Relevant Pages
|
