- مبلغ: ۸۶,۰۰۰ تومان
- مبلغ: ۹۱,۰۰۰ تومان
a b s t r a c t
The encryption scheme proposed by Tawalbeh et al.  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 protectfrom attacks like Baby Step, Giant Step attack or Pollard’s Rho attack. Simulation ofthe 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.
The encryption scheme presented by Tawalbeh et al. depends on ECDLP but the parameters chosen for performing the encryption operation has got a small order size , not large enough to provide efficient security. The BSGS approach took around 13 s and Pollard’s Rho attack around 1 s to solve the private key from a given public key. Simulation results of the cryptanalysis of Tawalbeh et al. encryption scheme is presented in this paper. If recommended elliptic curve parameter supplied by organizations like NIST or Brainpool are used then the attack using naive approach, BSGS or Pollard’s Rho would be practically infeasible.