2020
DOI: 10.1007/978-981-15-3992-3_50
|View full text |Cite
|
Sign up to set email alerts
|

High-Speed Inversion Using $$x^{4^{n}}$$ Units

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…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%
See 1 more Smart Citation
“…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%