Hello, On Mon, 16 Nov 2009, Girish Venkatachalam wrote: > Basically RSA relies on the NP complete problem of prime number > factorization and Diffie Hellman relies on discrete log problem.
First of all, I should clarify that my aim is not to try to prove anyone wrong. However, when a statement is made on a public channel that is used by newbies and this statement may (IMNSHO!) mislead some of them, I feel that it should be corrected. The case in point: factorisation is not known to be an NP complete problem. However, people who study algorithms do believe that it is unlikely that there is a P algorithm for factorisation. A P algorithm for factorisation is one which will factorise a large number N in log(N)^k steps for some fixed k (independent of N). Regards, Kapil. -- _______________________________________________ To unsubscribe, email [email protected] with "unsubscribe <password> <address>" in the subject or body of the message. http://www.ae.iitm.ac.in/mailman/listinfo/ilugc
