Choosing the Hash and cyphering algorithm

npellegr at npellegr at
Wed Dec 29 10:03:55 CET 2004

It looks like i made a mistake switching q and d ...

i modify the initial msg !

Nicolas Pellegrin

>>Well about he whole point and especially RSA I should be able to cypher with
>>private key since the exponents are inverses :

>>d = e^-1 mod (p-1)(q-1)  with q the private exponent and e the public one.

>>Actually when you sign something it's 
>>c = RSA(priv,H(m))  with H the Hash function.

>>So I know it's possible. I only want to "c = m^d mod n"

Nicolas Pellegrin

More information about the Gnupg-users mailing list