On Wed, Aug 09, 2006, Marek Marcola wrote: > > > A side note: is it very difficult to reconstruct the whole RSA object > > if I know "*n", "*e" and "*d" elements? The "*n" and "*d" are 1024 > > bits long. > Yes :-). This is called factorization - find two prime numbers that > n = p*q. >
If you just have (n,e) it is difficult by design. If you have (n, d, e) then there is a way to determine a prime factor with minimal computational effort and from there the CRT components can be trivially obtained. The increase in efficiency and being able to then store the key in a standard form makes his worthwhile. The algorithm is mentioned in a few places for example: http://groups.google.com/group/sci.crypt/browse_frm/thread/d228e099f78164e3/7dda3b70792b639?hl=en&lr=lang_en&safe=off&rnum=5&prev=/groups%3Fhl%3Den%26lr%3Dlang_en%26safe%3Doff%26q%3Dcrt%2Bcomponents%2Brsa%26btnG%3DSearch#7dda3b70792b639 Steve. -- Dr Stephen N. Henson. Email, S/MIME and PGP keys: see homepage OpenSSL project core developer and freelance consultant. Funding needed! Details on homepage. Homepage: http://www.drh-consultancy.demon.co.uk ______________________________________________________________________ OpenSSL Project http://www.openssl.org User Support Mailing List [email protected] Automated List Manager [EMAIL PROTECTED]
