Abstract. Eta pairing on a supersingular elliptic curve over the binary field F21223 used to offer 128-bit security, and has been studied extensively for efficient implementations. In this paper, we report our GPU-based implementations of this algorithm on an NVIDIA Tesla C2050 platform. We propose efficient parallel implementation strategies for multiplication, square, square root and inverse in the underlying field. Our implementations achieve the best performance when López-Dahab multiplication with four-bit precomputations is used in conjunction with one-level Karatsuba multiplication. We have been able to compute up to 566 eta pairings per second. To the best of our knowledge, ours is the fastest GPU-based implementation of eta pairin...
In this paper we present a scalar multiplication hardware architecture that computes a constant-time...
This paper presents a low-latency algorithm designed for parallel computer architectures to compute ...
[Updated version of paper at Indocrypt 2010] A major cryptanalytic computation is currently underway...
Pairings on hyperelliptic curves have been applied to many cryptographic schemes, and it is importan...
Abstract This paper presents new software speed records for the computation of cryptographic pairing...
Elliptic curve cryptography (ECC) and Tate pairing are two new types of public-key cryptographic sch...
Tate pairing is a bilinear map used in identity based cryptography schemes. In this paper, we propos...
In this paper we present two classes of scalar multiplication hardware architectures that compute a ...
Elliptic curve cryptography (ECC) and Tate pairing are two new types of public-key cryptographic sch...
International audienceThis paper is devoted to the design of fast parallel accelerators for the cryp...
International audience—Acceleration of cryptographic applications on Graphical Processing Units (GPU...
Since their introduction in constructive cryptographic applications, pairings over (hyper)elliptic c...
Abstract. This paper presents a fast implementation to compute the scalar multiplication of elliptic...
In this paper we present a scalar multiplication hardware architecture that computes a constant-time...
This paper presents a low-latency algorithm designed for parallel computer architectures to compute ...
[Updated version of paper at Indocrypt 2010] A major cryptanalytic computation is currently underway...
Pairings on hyperelliptic curves have been applied to many cryptographic schemes, and it is importan...
Abstract This paper presents new software speed records for the computation of cryptographic pairing...
Elliptic curve cryptography (ECC) and Tate pairing are two new types of public-key cryptographic sch...
Tate pairing is a bilinear map used in identity based cryptography schemes. In this paper, we propos...
In this paper we present two classes of scalar multiplication hardware architectures that compute a ...
Elliptic curve cryptography (ECC) and Tate pairing are two new types of public-key cryptographic sch...
International audienceThis paper is devoted to the design of fast parallel accelerators for the cryp...
International audience—Acceleration of cryptographic applications on Graphical Processing Units (GPU...
Since their introduction in constructive cryptographic applications, pairings over (hyper)elliptic c...
Abstract. This paper presents a fast implementation to compute the scalar multiplication of elliptic...
In this paper we present a scalar multiplication hardware architecture that computes a constant-time...
This paper presents a low-latency algorithm designed for parallel computer architectures to compute ...
[Updated version of paper at Indocrypt 2010] A major cryptanalytic computation is currently underway...