how to calculate very large primes

[vlakas1981]

hello everyone,

i need to calculate random prime numbers, having at least 230 digits of length, with no noticable delay. Is it possible to do on-the-fly? I was thinking of a list having some hundreds of them which i would use and pick randomly one. Does anybody know of such a list? I will use it to implement rsa encryption.
Thanks

 

[qednick]

I don't know of any large integer type that can handle numbers that big! Maybe you'll have to look at implementing your own type for this purpose though my binary math is not that good so I wouldn't know where to start. Also, if you do manage to get something working, I doubt it will be able to calculate without any noticable delay.
Try looking on Code Project (see the link bottom left) to see if there's anything workable there and perhaps also post a query on usenet. If you manage to find something that can handle numbers that big then I'd love to know about it!

[sup]programmer (prog'ram'er), n A hot-headed, anorak wearing, pimple-faced computer geek.[/sup]​

 

[hnd]

I have read abbout algorithms to create Large Prime numbers.
It was described in Garfinkels Book on PGP. I don't have it available in the Moment but i will have a look in that.



hnd
hasso55@yahoo.com

 

[vlakas1981]

happy new year everybody,

no need to bother with this thread anymore, aphrodita gave the solution to all my problems. if anyone is interested, you should download the MIRACL library. it is great!!

Thanks