#### Filter Results:

- Full text PDF available (46)

#### Publication Year

1998

2016

- This year (0)
- Last 5 years (6)
- Last 10 years (31)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

This paper describes the design of a fast multi-core library for the cryptographic Tate pairing over supersingular elliptic curves. For the computation of the reduced modified Tate pairing over F 3 509 , we report calculation times of just 2.94 ms and 1.87 ms on the Intel Core2 and Intel Core i7 architectures, respectively. We also try to answer one… (More)

—Since their introduction in constructive cryptographic applications, pairings over (hyper)elliptic curves are at the heart of an ever increasing number of protocols. With software implementations being rather slow, the study of hardware architectures became an active research area. In this paper, we discuss several algorithms to compute the T pairing in… (More)

This paper describes the design of a fast software library for the computation of the optimal ate pairing on a Barreto–Naehrig elliptic curve. Our library is able to compute the optimal ate pairing over a 254-bit prime field Fp, in just 2.33 million of clock cycles on a single core of an Intel Core i7 2.8GHz processor, which implies that the pairing… (More)

— In this paper, we propose a modified ηT pairing algorithm in characteristic three which does not need any cube root extraction. We also discuss its implementation on a low cost platform which hosts an Altera Cyclone II FPGA device. Our pairing accelerator is ten times faster than previous known FPGA implementations in characteristic three.

Since their introduction in constructive cryptographic applications , pairings over (hyper)elliptic curves are at the heart of an ever increasing number of protocols. Software implementations being rather slow, the study of hardware architectures became an active research area. In this paper, we first study an accelerator for the ηT pairing over F3[x]/(x 97… (More)

- Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto, Francisco Rodríguez-Henríquez
- IACR Cryptology ePrint Archive
- 2008

In this article we propose a study of the modified Tate pairing in characteristics two and three. Starting from the ηT pairing introduced by Barreto et al. [1], we detail various algorithmic improvements in the case of characteristic two. As far as characteristic three is concerned, we refer to the survey by Beuchat et al. [4]. We then show how to get back… (More)

- Jean-Luc Beuchat, Eiji Okamoto, Teppei Yamazaki
- IACR Cryptology ePrint Archive
- 2010

—We propose compact architectures of the SHA-3 candidates BLAKE-32 and BLAKE-64 for several FPGA families. We harness the intrinsic parallelism of the algorithm to interleave the computation of four instances of the Gi function. This approach allows us to design an Arithmetic and Logic Unit with four pipeline stages, and to achieve high clock frequencies.… (More)

- Jean-Luc Beuchat
- IPDPS
- 2003

This paper is devoted to the study of number representations and algorithms leading to efficient implementations of modular adders and multipliers on recent Field Pro-grammable Arrays. Our hardware operators take advantage of the building blocks available in such devices: carry-propagate adders, memory blocks, and sometimes embedded multipliers. The first… (More)

- Jean-Luc Beuchat, Hiroshi Doi, +13 authors Hiroyasu Yamamoto
- Computers & Electrical Engineering
- 2008

—Since their introduction in constructive cryptographic applications, pairings over (hyper)elliptic curves are at the heart of an ever increasing number of protocols. As they rely critically on efficient implementations of pairing primitives, the study of hardware accelerators has become an active research area. In this paper, we propose two coprocessors… (More)

- Jean-Luc Beuchat, Masaaki Shirase, Tsuyoshi Takagi, Eiji Okamoto
- IACR Cryptology ePrint Archive
- 2007

We describe further improvements of the ηT pairing algorithm in characteristic three. Our approach combines the loop unrolling technique introduced by Granger et. al for the Duursma-Lee algorithm, and a novel algorithm for multiplication over F 3 6m proposed by Gorla et al. at SAC 2007. For m = 97, the refined algorithm reduces the number of multiplications… (More)