Title :
A Comment on “Cryptographic Applications of Brahmagupta–Bhãskara Equation”
Author_Institution :
Inst. for Inf. Syst. Eng., Concordia Univ., Montreal, Que.
fDate :
4/1/2007 12:00:00 AM
Abstract :
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
Keywords :
cryptography; Brahmagupta-Bhaskara equation; Galois fields; cryptographic applications; linear equations; plaintext-cipher text pairs; rational numbers; secret key; symmetric key encryption system; Circuits; Communication system security; Councils; Cryptography; Helium; Information systems; Nonlinear equations; Systems engineering and theory; Brahmagupta–Bhãskara (BB) equation; communication and network security; cryptography; digital encryption;
Journal_Title :
Circuits and Systems I: Regular Papers, IEEE Transactions on
DOI :
10.1109/TCSI.2007.893508
