Jan Dušek j.d at
Fri Feb 11 11:03:52 CET 2000

I'm from Czech Rep. and I'm trying to make an RSA encrypting algorythm. But
I have a little problem. I don't know how to generate prime-number. I found
some algorythms, but there's another problem with commensurableness numbers.
I don't know how to check if two numbers are commensurableness. (I'm sorry
about my English :-))

I hope you'll help me

With regards

Jan Dušek
Czech Republic
<j.d at>

More information about the Gnupg-devel mailing list