A Comment on “Cryptographic Applications of Brahmagupta–Bhãskara Equation”

Murthy and Swamy proposed a symmetric key encryption system based on Brahmagupta-Bhaskara equation over GF(p). In this comment, we show that breaking this system is equivalent to solving a set of linear equations over the field of rational numbers. Our attack, typically, requires as low as three known plaintext-ciphertext pairs and allows the cryptanalyst to fully recover the secret key

[1]  염흥렬,et al.  [서평]「Applied Cryptography」 , 1997 .

[2]  W. B..  History of the Theory of Numbers , Nature.

[3]  S.P. Voinigescu,et al.  30-100-GHz inductors and transformers for millimeter-wave (Bi)CMOS integrated circuits , 2005, IEEE Transactions on Microwave Theory and Techniques.

[4]  N. Rama Murthy,et al.  Cryptographic applications of Brahmagupta-Bha/spl tilde/skara equation , 2006, IEEE Transactions on Circuits and Systems I: Regular Papers.