A w-NNAF method for the efficient computation of scalar multiplication in elliptic curve cryptography

2005 ◽  
Vol 167 (1) ◽  
pp. 81-93
Author(s):  
Yong Ding ◽  
Kwok-wo Wong ◽  
Yu-min Wang
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Scalar Multiplication ◽  
Efficient Computation

Secure and Robust Telemedicine using ECC on Radix-8 with Formal Verification

2021 ◽  
pp. 573-590
Author(s):  
Gautam Kumar ◽  
Hemraj Saini
Keyword(s):  
Computational Complexity ◽  
Elliptic Curve ◽  
Formal Verification ◽  
Elliptic Curve Cryptography ◽  
Clock Cycle ◽  
Scalar Multiplication ◽  
Efficient Technique ◽  
Computation Efficiency ◽  
Research Gap ◽  
Hardware Performance

The scalar multiplication techniques used in Elliptic curve cryptography (ECC) are having the scope for gaining the computation efficiency. This is possible through the reduction of precomputed operations. Finding the more efficient technique compares to the most recent or efficient one is a research gap for all schemes. The manuscript presents an application oriented work for Telemedicine using ECC. It is based on robust application on reduced computational complexity. The methodology we apply for the same is Scalar Multiplication without precomputation on Radix-8. Introduced software and the hardware performance are reporting a big advantage over all the related proposed techniques. The reason to cover this problem is to provide a path on a fascinating area of ECC on a smaller key size be applicable for all applications on a same level of security strengths. The smaller length key gives the higher speed and shorter clock cycle to initiate the operation.

scholarly journals Efficient scalar multiplication of ECC using SMBR and fast septuple formula for IoT

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Chong Guo ◽  
Bei Gong
Keyword(s):  
Internet Of Things ◽  
Elliptic Curve ◽  
Elliptic Curves ◽  
Elliptic Curve Cryptography ◽  
Computational Cost ◽  
Scalar Multiplication ◽  
Lightweight Cryptography ◽  
Multiplication Algorithm ◽  
Binary Fields ◽  
Division Polynomial

AbstractIn order to solve the problem between low power of Internet of Things devices and the high cost of cryptography, lightweight cryptography is required. The improvement of the scalar multiplication can effectively reduce the complexity of elliptic curve cryptography (ECC). In this paper, we propose a fast formula for point septupling on elliptic curves over binary fields using division polynomial and multiplexing of intermediate values to accelerate the computation by more than 14%. We also propose a scalar multiplication algorithm based on the step multi-base representation using point halving and the septuple formula we proposed, which significantly reduces the computational cost. The experimental results show that our method is more efficient over binary fields and contributes to reducing the complexity of ECC.

Sign in / Sign up

Export Citation Format

Share Document