hello,
when i read some books about cryptography, it always go that the
cryptography is based on the difficult math problem, for example big
integer decomposition,
i don't understand it, for if we know that n = p*q , p, q are prime ,
why it's difficult to get p and q ? i think ,if we know the big
integer and it is mul of two prime number. we can get prime number
and test whether p*q == n, why people say it 's a difficult problem?
may be my understanding is not right? someone who knows please tell me
, thank you very much
sincerely
jazz-lee
______________________________________________________________________
OpenSSL Project http://www.openssl.org
User Support Mailing List openssl-users@openssl.org
Automated List Manager majord...@openssl.org
