TY - GEN
T1 - An efficient method of elliptic curve encryption using ancient Indian vedic mathematics
AU - Thapliyal, Himanshu
AU - Srinivas, M. B.
PY - 2005
Y1 - 2005
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/33847113323
UR - https://www.scopus.com/pages/publications/33847113323#tab=citedBy
U2 - 10.1109/MWSCAS.2005.1594228
DO - 10.1109/MWSCAS.2005.1594228
M3 - Conference contribution
AN - SCOPUS:33847113323
SN - 0780391977
SN - 9780780391970
T3 - Midwest Symposium on Circuits and Systems
SP - 826
EP - 828
BT - 2005 IEEE International 48th Midwest Symposium on Circuits and Systems, MWSCAS 2005
T2 - 2005 IEEE International 48th Midwest Symposium on Circuits and Systems, MWSCAS 2005
Y2 - 7 August 2005 through 10 August 2005
ER -