scholarly journals Area Efficient Implementation of Elliptic Curve Point Multiplication Algorithm

2015 ◽  
Vol 6 (4) ◽  
Author(s):  
Sunil Devidas ◽  
Dr.Vijay R.
Keyword(s):  
Elliptic Curve ◽  
Efficient Implementation ◽  
Point Multiplication ◽  
Multiplication Algorithm ◽  
Area Efficient

Fast Elliptic Curve Point Multiplication Algorithm Optimization

2013 ◽  
Vol 441 ◽  
pp. 1044-1048
Author(s):  
Hai Bin Zhang ◽  
Xiao Ping Ji ◽  
Bo Ying Wu ◽  
Guang Yu Li
Keyword(s):  
Positive Integer ◽  
Elliptic Curve ◽  
Hot Spot ◽  
Algorithm Optimization ◽  
Point Multiplication ◽  
Multiplication Algorithm ◽  
Multiplication Operation ◽  
Ternary Form ◽  
Main Ideas ◽  
Operation Cost

Scalar point multiplication operation on elliptic curve is the most expensive part of the elliptic curve cryptosystem, also has always been the hot spot of the research. Recoding the positive integer and reducing the amount of inversion in the operation are the two main ideas. In this article, we use the balanced ternary form to recode the positive integer, at the same time, improve the part of calculation way of, reducing the amount of inversion, decreasing operation cost, and improving operation efficiency

scholarly journals FPGA Implementation of High-Speed Area-Efficient Processor for Elliptic Curve Point Multiplication Over Prime Field

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 178811-178826 ◽  
Author(s):  
Md. Mainul Islam ◽  
Md. Selim Hossain ◽  
Moh. Khalid Hasan ◽  
Md. Shahjalal ◽  
Yeong Min Jang
Keyword(s):  
Elliptic Curve ◽  
High Speed ◽  
Fpga Implementation ◽  
Prime Field ◽  
Point Multiplication ◽  
Area Efficient

An Area-Efficient Composite Field Inverter for Elliptic Curve Cryptosystems

2014 ◽  
pp. 218-237
Author(s):  
M. M. Wong ◽  
M. L. D. Wong
Keyword(s):  
Elliptic Curve ◽  
Complexity Analysis ◽  
Extension Field ◽  
Arithmetic Operations ◽  
Hardware Cost ◽  
Elliptic Curve Cryptosystems ◽  
Look Up Table ◽  
Composite Field ◽  
Optimal Saving ◽  
Area Efficient

This chapter presents a new area-efficient composite field inverter of the form GF(q1) with q=2n.m suitable for the hardware realization of an elliptic curve (EC) cryptosystem. Considering both the security aspect and the hardware cost required, the authors propose the utilization of the composite field GF(((22)2)41) for EC cryptosystem. For efficient implementation, they have derived a compact inversion circuit over GF(2164)=GF(((22)2)41) to achieve an optimal saving in the hardware cost required. Furthermore, the authors have also developed a composite field digit serial Sunar-Koc multiplier for the multiplication in the extension field. All of the arithmetic operations in the subfield GF(24) are performed in its isomorphic composite field, GF((22)2), leading to a full combinatorial implementation without resorting to the conventional look-up table approach. To summarize the work, the final hardware implementation and the complexity analysis of the inversion is reported towards the end of this chapter.

Profiled Attacks Against the Elliptic Curve Scalar Point Multiplication Using Neural Networks

2021 ◽  
pp. 238-257
Author(s):  
Alessandro Barenghi ◽  
Diego Carrera ◽  
Silvia Mella ◽  
Andrea Pace ◽  
Gerardo Pelosi ◽  
...  
Keyword(s):  
Neural Networks ◽  
Elliptic Curve ◽  
Point Multiplication ◽  
Scalar Point Multiplication
Sign in / Sign up

Export Citation Format

Share Document