An efficient method of elliptic curve encryption using Ancient Indian Vedic Mathematics

The major time consuming arithmetic operations in ECC are point additions and doubling. Exponentiation operations like square and cube are the major bottlenecks in the efficiency of point additions and doubling. This paper presents efficient hardware circuitry for point doubling using square algorithms of Ancient Indian Vedic Mathematics. In order to calculate the square of a number, "Duplex" D property of binary numbers is proposed.