## Arithmetic Operators for Pairing-Based Cryptography

### Cached

### Download Links

- [www.cipher.risk.tsukuba.ac.jp]
- [www.cipher.risk.tsukuba.ac.jp]
- [eprint.iacr.org]
- [www.ens-lyon.fr]
- DBLP

### Other Repositories/Bibliography

Citations: | 6 - 3 self |

### BibTeX

@MISC{Beuchat_arithmeticoperators,

author = {Jean-luc Beuchat and Nicolas Brisebarre and Jérémie Detrey and Eiji Okamoto},

title = {Arithmetic Operators for Pairing-Based Cryptography},

year = {}

}

### OpenURL

### Abstract

Abstract. 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 + x 12 + 2). Our architecture is based on a unified arithmetic operator which performs addition, multiplication, and cubing over F 3 97. This design methodology allows us to design a compact coprocessor (1888 slices on a Virtex-II Pro 4 FPGA) which compares favorably with other solutions described in the open literature. We then describe ways to extend our approach to any characteristic and any extension field.