Internet Archive Scholar

An Efficient Elliptic Curve Cryptography Arithmetic Using Nikhilam Multiplication [dataset]

The Ijes The Ijes, 1, Prokash Barman, 2, Banani Saha
2015 Figshare  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (250.9 kB)
https://web.archive.org/web/20170813054134/https://s3-eu-west-1.amazonaws.com/pfigshare-u-files/2071869/I0441045050.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

Multiplication is one of the most important operation in Elliptic Curve Cryptography (ECC) arithmetic. For point addition and point doubling in ECC scalar (integer) multiplication is required. In higher order classical (standard) multiplication many intermediate operations are required. Reduced operation in multiplication will increase the functional speed of ECC arithmetic. These goals can be achieved using ancient multiplication algorithm namely Nikhilam Sutra. Nikhilam Sutra is one of the
more » ... ra (algorithm) within 16 Vedic mathematics Sutras (algorithms). Nikhilam Sutra is efficient for multiplying two large decimal numbers. The Sutra reduces multiplication of two large numbers into two smaller numbers multiplication. The functional speed of Elliptic Curve Cryptography can be increased using Nikhilam method for scalar multiplication.
doi:10.6084/m9.figshare.1418198.v1 fatcat:xuokbf2frjamtdyh7d5am27yzu
Open Access
Citation

The Ijes The Ijes, 1, Prokash Barman, 2, Banani Saha. "An Efficient Elliptic Curve Cryptography Arithmetic Using Nikhilam Multiplication." Figshare (2015)