2017
DOI: 10.1007/978-3-319-71667-1_10
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Optimal Ate Pairing at 128-Bit Security Level

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
2
2
2

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(1 citation statement)
references
References 27 publications
0
1
0
Order By: Relevance
“…On the computation time for deriving fresh verification key, signing, and verification, verification is the most expensive, since it needs one paring computation. According to the experimental results by Khandaker et al [44,Section 4], for the parameter suggested above, on a usual computation environment (Intel(R) Core(TM) i5-6500 CPU @ 3.20GHz, 4GB Memory), one pairing computation needs less than 8 ms.…”
Section: B Implementationmentioning
confidence: 99%
“…On the computation time for deriving fresh verification key, signing, and verification, verification is the most expensive, since it needs one paring computation. According to the experimental results by Khandaker et al [44,Section 4], for the parameter suggested above, on a usual computation environment (Intel(R) Core(TM) i5-6500 CPU @ 3.20GHz, 4GB Memory), one pairing computation needs less than 8 ms.…”
Section: B Implementationmentioning
confidence: 99%