Search

Elliptic Curve Cryptography (ECC) is a public key cryptosystem with a security level determined by discrete logarithm problem called Elliptic Curve Discrete Logarithm Problem (ECDLP). John M. Pollard proposed an algorithm for discrete logarithm problem based on Monte Carlo method and known as Pollard Rho algorithm. The best current bruteforce attack for ECC is Pollard Rho algorithm. In this research we implement modified Pollard Rho algorithm on ECC over GF (241). As the result, the runtime of Pollard Rho algorithm increases exponentially with the increase of the ECC key length. This work also presents the estimated runtime of Pollard Rho attack on ECC over longer bits. [ABSTRACT FROM AUTHOR]

A novel method of inserting noise into stream of ciphered text is proposed. The goal of inserting noise is to increase the level of uncertainty, thus making it harder for an attacker to detect data and noise. This form of steganography is implemented using Elliptic Curve Cryptography (ECC). The process of embedding the noise to the message in the encryption process and removing the noise from the message in the decryption process is proposed in this work by modifying ElGamal to allow auto detection of data and noise. [ABSTRACT FROM AUTHOR]