2020
DOI: 10.31026/j.eng.2020.09.04
|View full text |Cite
|
Sign up to set email alerts
|

Performance Evaluation of Scalar Multiplication in Elliptic Curve Cryptography Implementation using Different Multipliers Over Binary Field GF (2233)

Abstract: This paper presents a point multiplication processor over the binary field GF (2233) with internal registers integrated within the point-addition architecture to enhance the Performance Index (PI) of scalar multiplication. The proposed design uses one of two types of finite field multipliers, either the Montgomery multiplier or the interleaved multiplier supported by the additional layer of internal registers. Lopez Dahab coordinates are used for the computation of point multiplication on Koblitz Curve (K-233b… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2021
2021
2025
2025

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 12 publications
0
4
0
Order By: Relevance
“…In this example, a line will be drawn between the point (P) and the point (Q), point(R) is the mirrored point on the x-axis of the point obtained by intersecting the line with an elliptic curve. Figure (2) depicts an elliptic curve with an addition point [2], [13].…”
Section: Point Addition P + Qmentioning
confidence: 99%
See 1 more Smart Citation
“…In this example, a line will be drawn between the point (P) and the point (Q), point(R) is the mirrored point on the x-axis of the point obtained by intersecting the line with an elliptic curve. Figure (2) depicts an elliptic curve with an addition point [2], [13].…”
Section: Point Addition P + Qmentioning
confidence: 99%
“…This point results from mirroring the point R which results from the doubling. Figure (3) explains point doubling on an elliptic curve [2], [13]. .…”
Section: Point Doubling P+pmentioning
confidence: 99%
“…Gate count and adder count are high when compare to other multiplier so it occupy more area in array multiplier. In Baugh Wooley multiplier the operation speed is very much high when compared to array multiplier but delay and power consumption are very less [17][18][19][20]. Whereas in Wallace multiplier speed is high and power consumption is high when compared to Baugh Wooley multiplier.…”
Section: Limitationmentioning
confidence: 99%
“…Decryption (D) is the inverse of encryption, where P is extracted from C using the decryption key (Kd). Below are some equations illustrating the mathematical model of the above processes [3]:…”
Section: Introductionmentioning
confidence: 99%