# Re: RSA question

Okay, guess I should measure the primes in the size of their bits, not
digits. Have to work that into the system... I guess I'll use then 300
bit numbers, that should be good enough. I've heard about a 640 bit
number being factored. But, as I recall, it was a distributed network,
which I'm sure won't really make any kind of a difference to me. I'm
just planning on running a program on my own computer. The program will
be multi-user, to open a database of files, that will have different
keys. Occasionally, a new key will need to be passed to a user, which
after careful consideration, I decided the best way to do so was via
RSA. Thanks for the help!

.

## Relevant Pages

• Re: prime numbers and different number bases.
... didn't proofread, then thought of something i should add. ... Okay; here we go then. ... but creating primes is harder. ... If x is the number of digits, ...
(sci.math)
• Re: A way to find the minimum number of digits for a factor of a compound number.
... Factoring would then have reduced to numbers containing at ... least that many digits. ... primes to divide into the composite. ... and realized how big the keys are these days. ...
(sci.math)
• Re: RSA question
... Okay, so in other words, I probably want to use 2 primes, of slightly ... the one being maybe 100 digits and the other being 102 ... though the multi-prime senerio can't improve performance any, ...
(sci.crypt)
• Todays Mr. Pin Classified: Taxi
... doesn't have the keys, so I couldn't check the boards. ... The playfield ... I played a game and everything seemed to be working okay. ... The owner doesn't want the hassle of shipping, so it will need to be a ...
(rec.games.pinball)
• Re: Memorisable/handwriteable/typeable key styles
... >>> all of which have four letters. ... > with random digits. ... those keys are too long - so we use letter/digit ... Not for secret keys, ...
(sci.crypt)