2018 International Conference on Engineering and Emerging Technologies (ICEET) 2018
DOI: 10.1109/iceet1.2018.8338645
|View full text |Cite
|
Sign up to set email alerts
|

Lopez Dahab based elliptic crypto processor (ECP) over GF(2163) for low-area applications on FPGA

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
25
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 14 publications
(25 citation statements)
references
References 21 publications
0
25
0
Order By: Relevance
“…SPM requires an initial point P on the EC and an integer k whose size is equivalent to the size of the field under consideration [23]. The SPM is simply the addition of k copies of the point P , ( Q = kP = P + P + P...).…”
Section: Elliptic Curve Cryptography On Gf (2 M )mentioning
confidence: 99%
See 1 more Smart Citation
“…SPM requires an initial point P on the EC and an integer k whose size is equivalent to the size of the field under consideration [23]. The SPM is simply the addition of k copies of the point P , ( Q = kP = P + P + P...).…”
Section: Elliptic Curve Cryptography On Gf (2 M )mentioning
confidence: 99%
“…In SPM, inversion needs to be performed for each PA and PD operation, which creates a performance bottleneck [14]. To avoid this inversion cost, a conversion from affine (x,y) to projective coordinates (X : Y : Z) can be computed, and then SPM is performed [23]. Afterward, a projective to affine coordinates conversion is performed back again to get the EC points result.…”
Section: Elliptic Curve Cryptography On Gf (2 M )mentioning
confidence: 99%
“…Generally exponentiation is done by squarer circuits [3,4,6,7,12,18,20,28] , quad circuits [5,21,22] and octet circuits (field size GF (2 256 )) [18,28]. We propose a novel HITA using Hex circuits to compute exponentiation in-order to save the area with increased ATP.…”
Section: Proposed Designmentioning
confidence: 99%
“…Among different arithmetic operation, FF inversion is one of the most important and computationally complex operations. Several attempts have been made to fasten the inverse operation [3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22] using squarer and quad circuits on FPGA platforms. There are two useful approaches for finding an inversion over GF (2 m ) which includes Extended Euclidean Algorithm (EEA) [14,23] and Fermat's Little Theorem (FLT) [24].…”
Section: Introductionmentioning
confidence: 99%
“…These computations are important in constrained-source and large environments that require processing power, memory, or power consumption [20,33]. ECC provides encryption (Elliptic Curve Integrated Encryption Scheme(ECIES)), signature (Elliptic Curve Digital Signature Algorithm (ECDSA)), and exchange keys (Elliptic Cuvre Diffie-Hellman (ECDH)) approaches [31]. Many operations are performed in ECC algorithms (described in four layers) as shown in Figure 1 [34].…”
Section: Overview Of Techniquesmentioning
confidence: 99%