I success to catch the numbers with a blank passphrase and pgpdump.
I found something strange with the number d. The operation e*d mod phi
is not equal to 1, as expected with the RSA algo. I looked in
cipher/rsa.c and I found that d is evaluated to match e*d mod f = 1 ,
with f = phi/gcd((p-1),(q-1)) .
Why is it coded like that ? Is it safe ?
Le 04/08/2011 15:05, Jerome Baum a écrit :
I know that gpg is an hybrid system.
I want to know these numbers to check with a mathematica-like program that
numbers supposed to be primes are actually real prime numbers.
What is that supposed to tell you? It's not like Mathematica does an
exhaustive check either.
A healthy dose of paranoia is good though, so maybe you can decrypt
the key (set an empty password or remove the password) before sending
it to pgpdump?
_______________________________________________
Gnupg-users mailing list
Gnupg-users@gnupg.org
http://lists.gnupg.org/mailman/listinfo/gnupg-users
