Abstract

The encryption scheme proposed by Tawalbeh et al. [1] is based on elliptic curve cryptography (ECC). ECC depends on the difficulty to solve the elliptic curve discrete logarithmic problem. However we found that the order of Tawalbeh et al. elliptic curve is not large enough to protect from attacks like Baby Step, Giant Step attack or Pollard's Rho attack. Simulation of the encryption scheme using the elliptic curve parameters proposed by Tawalbeh et al. is carried out. Cryptanalysis has been successfully carried out to extract the private key from the public key and the encrypted image is deciphered revealing the plain image.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call