http://cryptocrats.com/crypto/new-algorithm-based-on-the-three-pass-protocol/ Mon, 12 Jan 2009 16:49:43 -0600 http://wordpress.org/?v=2.8.6 hourly 1 http://cryptocrats.com/crypto/new-algorithm-based-on-the-three-pass-protocol/comment-page-1/#comment-78 Rohit Pandharkar Sun, 27 Jul 2008 13:25:46 +0000 http://cryptocrats.com/?p=37#comment-78 Sir, I looked over for the cryptanalysis of Massey Omura and found that Samuel S. Wagstaff has given the detailed cryptanalysis of Massey Omura in his book "Crytanalysis of Number Theoretic Ciphers". What you say is correct though, my algorithm still needs A and B to agree over p, and it only reduces the "waiting time" involved in Massey Omura as Bob has to wait for Alice to send message first as he will raise the same message in Massey Omura system.I am looking over the possible solutions for authentication problems in general. I am working on the same. Sir,
I looked over for the cryptanalysis of Massey Omura and found that Samuel S. Wagstaff has given the detailed cryptanalysis of Massey Omura in his book “Crytanalysis of Number Theoretic Ciphers”. What you say is correct though, my algorithm still needs A and B to agree over p, and it only reduces the “waiting time” involved in Massey Omura as Bob has to wait for Alice to send message first as he will raise the same message in Massey Omura system.I am looking over the possible solutions for authentication problems in general. I am working on the same.

]]> http://cryptocrats.com/crypto/new-algorithm-based-on-the-three-pass-protocol/comment-page-1/#comment-76 Virendra Sule Sun, 27 Jul 2008 04:30:24 +0000 http://cryptocrats.com/?p=37#comment-76 Massey Omura also has elliptic curve version. It would be interesting to know your solution of "salting" but in the proposal you are indicating, do you still want Alice and Bob to agree on the prime p? You will only be cutting down on exponentiation time by this approach. Problem of authentication will still remain in practical application. I am not recalling of serious cryptanalysis of Massey Omura scheme. If you know any reference it would be worth reading and do let me know. Massey Omura also has elliptic curve version. It would be interesting to know your solution of “salting” but in the proposal you are indicating, do you still want Alice and Bob to agree on the prime p? You will only be cutting down on exponentiation time by this approach. Problem of authentication will still remain in practical application. I am not recalling of serious cryptanalysis of Massey Omura scheme. If you know any reference it would be worth reading and do let me know.

]]>