An efficient method of elliptic curve encryption using ancient Indian vedic mathematics

Himanshu Thapliyal; M. B. Srinivas

doi:10.1109/MWSCAS.2005.1594228

An efficient method of elliptic curve encryption using ancient Indian vedic mathematics

Himanshu Thapliyal, M. B. Srinivas

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

18 Scopus citations

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.

Original language	English
Title of host publication	2005 IEEE International 48th Midwest Symposium on Circuits and Systems, MWSCAS 2005
Pages	826-828
Number of pages	3
DOIs	https://doi.org/10.1109/MWSCAS.2005.1594228
State	Published - 2005
Event	2005 IEEE International 48th Midwest Symposium on Circuits and Systems, MWSCAS 2005 - Cincinnati, OH, United States Duration: Aug 7 2005 → Aug 10 2005

Publication series

Name	Midwest Symposium on Circuits and Systems
Volume	2005
ISSN (Print)	1548-3746

Conference

Conference	2005 IEEE International 48th Midwest Symposium on Circuits and Systems, MWSCAS 2005
Country/Territory	United States
City	Cincinnati, OH
Period	8/7/05 → 8/10/05

ASJC Scopus subject areas

Electronic, Optical and Magnetic Materials
Electrical and Electronic Engineering

Access to Document

10.1109/MWSCAS.2005.1594228

Cite this

@inproceedings{f312562b9c5d44358a6ccf1b4887263c,

title = "An efficient method of elliptic curve encryption using ancient Indian vedic mathematics",

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.",

author = "Himanshu Thapliyal and Srinivas, {M. B.}",

year = "2005",

doi = "10.1109/MWSCAS.2005.1594228",

language = "English",

isbn = "0780391977",

series = "Midwest Symposium on Circuits and Systems",

pages = "826--828",

booktitle = "2005 IEEE International 48th Midwest Symposium on Circuits and Systems, MWSCAS 2005",

note = "null ; Conference date: 07-08-2005 Through 10-08-2005",

}

Thapliyal, H & Srinivas, MB 2005, An efficient method of elliptic curve encryption using ancient Indian vedic mathematics. in 2005 IEEE International 48th Midwest Symposium on Circuits and Systems, MWSCAS 2005., 1594228, Midwest Symposium on Circuits and Systems, vol. 2005, pp. 826-828, 2005 IEEE International 48th Midwest Symposium on Circuits and Systems, MWSCAS 2005, Cincinnati, OH, United States, 8/7/05. https://doi.org/10.1109/MWSCAS.2005.1594228

An efficient method of elliptic curve encryption using ancient Indian vedic mathematics. / Thapliyal, Himanshu; Srinivas, M. B.

2005 IEEE International 48th Midwest Symposium on Circuits and Systems, MWSCAS 2005. 2005. p. 826-828 1594228 (Midwest Symposium on Circuits and Systems; Vol. 2005).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 - http://www.scopus.com/inward/record.url?scp=33847113323&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33847113323&partnerID=8YFLogxK

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

Y2 - 7 August 2005 through 10 August 2005

ER -

An efficient method of elliptic curve encryption using ancient Indian vedic mathematics

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this