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 kno...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on circuits and systems. 1, Fundamental theory and applications Fundamental theory and applications, 2007-04, Vol.54 (4), p.927-928
Main Author: Youssef, A.M.
Format: Article
Language:English
Subjects:
Brahmagupta-Bhãskara (BB) equation
Circuits
communication and network security
Communication system security
Councils
Cryptography
digital encryption
Information systems
Nonlinear equations
Systems engineering and theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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
ISSN:1549-8328
1057-7122
1558-0806
DOI:10.1109/TCSI.2007.893508