David McClain <dbm_at_refined-audiometrics.com> writes Re: generating self-contained dlls: sf or swiftx?

> You will need to be able to generate a 1024-bit prime number of the form
> P = 2*N+1, ...

Would you approve of:

 1. generating a 511 bit random number N (bit 511 = 1)
 2. calculate 2*N+1
 3. test with Miller-Rabin for p times.

How sure do you need to be that it is really a prime number?
How fast should it be?

-marcel

----------------------------------------------------------------------
sftalk_at_forth.com The SwiftForth programming discussion email list
To unsubscribe, send subject "unsubscribe" to sftalk-request_at_forth.com
For list command help, send subject "help" to sftalk-request_at_forth.com
Message archives are located at http://www.forth.com/archive/sftalk
----------------------------------------------------------------------
This list is a forum for SwiftForth users. For product support and
bug reports, please send email to support_at_forth.com
----------------------------------------------------------------------
Received on Sun Jan 31 2010 - 03:20:02 PST