MadSci Network: Computer Science

Subject: Can a table of p*q numbers be used to crack a pub. key encrypted message?

Date: Mon Apr 8 15:22:57 2002
Posted by Thomas
Grade level: undergrad School: Southwark College
City: London State/Province: No state entered. Country: U.K.
Area of science: Computer Science
ID: 1018293777.Cs

Hi.  I very only semi understand the public key crypto system.  I know that the 
number of primes are infinate, but the frequency at which they occur gets less 
the higher you go.  Most people therefore, when 'choosing' their primes for p 
and q therefore in practice have a limited choice, so why can't you crack a 
message simply by trying it against a table of all the possible factors of all 
the primes we know of?  oh. I have been looking just now round the web and i 
found a list of the first 98 million primes.  How many primes have been found 
then in total? (alot)? And I suppose a table of all the possible combinations 
multiplied together would be pretty long. My question still stands though as we 
haven't always known about so many primes...  Thanks! 

Re: Can a table of p*q numbers be used to crack a pub. key encrypted message?

Current Queue | Current Queue for Computer Science | Computer Science archives

Try the links in the MadSci Library for more information on Computer Science.

MadSci Home | Information | Search | Random Knowledge Generator | MadSci Archives | Mad Library | MAD Labs | MAD FAQs | Ask a ? | Join Us! | Help Support MadSci

MadSci Network,
© 1995-2002. All rights reserved.