In all fairness - no one has proven that the problem is indeed difficult or not (as in can be solved in polynomial time or not). I am not disputing the fact that the problem is difficult - but just because no one knows an easy (polynomial) answer does not mean that such solution does not exist.
StvB ________________________________ From: Victor Duchovni <victor.ducho...@morganstanley.com> To: openssl-users@openssl.org Sent: Friday, June 5, 2009 8:32:29 AM Subject: Re: about the integer decomposition On Fri, Jun 05, 2009 at 03:52:07PM +0800, jaze lee wrote: > hello, > when i read some books about cryptography, it always go that the > cryptography is based on the difficult math problem, for example big
