In this paper, we describe our parallel implementation of the optimal ate pairing over Barreto-Naehrig (BN) curves that is about 1.23 times faster using two ...
Nov 21, 2024 · Our experimental results suggest that the new Weil pairing is 1.25 times faster than the optimal ate pairing on 8-core extensions of the ...
We instantiate Hess's general Weil pairing construction and introduce a new optimal Weil pairing tailored for parallel execution. ... Parallelizing the Weil and ...
People also ask
What is Weil pairing and Tate pairing?
What is elliptic curve pairing?
This paper describes a parallel implementation of the optimal ate pairing over Barreto-Naehrig (BN) curves that is about 1.23 times faster using two cores ...
Parallelizing the Weil and Tate Pairings. https://doi.org/10.1007/978-3-642-25516-8_17 · Full text. Journal: Cryptography and Coding Lecture Notes in Computer ...
May 24, 2019 · Yes. In fact, you can write the Weil and Ate pairings in terms of the Tate pairing. Let E be a curve over Fp of embedding degree k and prime ...
Missing: Parallelizing | Show results with:Parallelizing
“Parallelizing the Weil and Tate pairings”, Cryptography and Coding, LNCS 7089 (2011), 275–. 295. 4. D. F. Aranha, J. López and D. Hankerson, “High-speed ...
The Tate pairing is faster than the Weil pairing, not only because it only requires one application of Miller's algorithm instead of two, but also because ...
Missing: Parallelizing | Show results with:Parallelizing
For the cryptographic usage of pairings, only a specific version of Miller's algorithm and the. Weil and Tate pairing need to be presented. This is the version ...
We show in this paper that one can efficiently parallelize the computation of both the Tate and the Ate pairings on this curve.