On Mon, Nov 16, 2009 at 7:15 AM, Kapil Hari Paranjape <[email protected]> wrote: > > Which RSA algorithm? > > RSA encryption does not require a message digest algorithm.
You get me wrong. > The RSA signature algorithm usually uses message digest algorithms for > efficiency and for a few other reasons. You get me right now. > However, the RSA encryption and decryption algorithms are inverses of > each other so one could make a signature by applying RSA decryption to > a message text. Only the person having the private key is capable of > doing this! What are you talking now? It does not make any sense to me. > The recipient would then apply RSA encryption (since the public key is > public!) to read the message and if this works then it verifies the > sender as well! Hey, I was talking math and you are talking something else. >> RSA is basically an implementation of this concept a^b^c = a ^c^b = >> a^bc with modulo N thrown in. > > I think you are confusing the Diffie-Hellman key exchange with RSA. Absolutely not true! I am talking RSA. Not Diffie Hellman. Since we are digressing a lot here I don't want to get into specifics. Please read "Applied Cryptography" by Bruce Schneier. Basically RSA relies on the NP complete problem of prime number factorization and Diffie Hellman relies on discrete log problem. Sure, DH looks like the exponentiation equation I gave above. But RSA also employs it . I will explain in a hazy manner. The prime number multiplication is performed in exponentiation. That is it for now. More later. Today is a very busy day for me. -Girish -- Gayatri Hitech web: http://gayatri-hitech.com SpamCheetah Spam filter: http://spam-cheetah.com _______________________________________________ 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
