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 Sutra (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.

翻译：乘法是椭圆曲线密码学（ECC）算术中最重要的运算之一。在ECC标量（整数）乘法中，需要执行点的加法和点的倍乘运算。在较高阶的经典（标准）乘法中，涉及许多中间操作。减少乘法运算中的操作次数将提高ECC算术的功能速度。这些目标可通过古代乘法算法——即Nikhilam Sutra（尼基拉姆法则）实现。Nikhilam Sutra是16部吠陀数学法则（算法）之一，适用于高效计算两个大十进制数的乘法。该法则将两个大数的乘法简化为两个较小数的乘法。采用Nikhilam方法进行标量乘法可提高椭圆曲线密码学的功能速度。