DocumentCode
3253125
Title
An efficient method of elliptic curve encryption using Ancient Indian Vedic Mathematics
Author
Thapliyal, Himanshu ; Srinivas, M.B.
Author_Institution
Centre for VLSI & Embedded Syst. Technol., Int. Inst. of Inf. Technol., Hyderabad
fYear
2005
fDate
7-10 Aug. 2005
Firstpage
826
Abstract
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
Keywords
arithmetic codes; digital arithmetic; elliptic equations; public key cryptography; Ancient Indian Vedic Mathematics; Duplex D property; ECC; binary numbers; efficient hardware circuitry; elliptic curve encryption; exponentiation operation; point addition; point doubling; square algorithm; Arithmetic; Circuits; Elliptic curve cryptography; Elliptic curves; Embedded system; Equations; Hardware; Information technology; Mathematics; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 2005. 48th Midwest Symposium on
Conference_Location
Covington, KY
Print_ISBN
0-7803-9197-7
Type
conf
DOI
10.1109/MWSCAS.2005.1594228
Filename
1594228
Link To Document