Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
| Autor: | Diego F. Aranha, Jérémie Detrey, Jean-Luc Beuchat, Nicolas Estibals |
|---|---|
| Přispěvatelé: | Institute of Computing [Campinas] (UNICAMP), Universidade Estadual de Campinas (UNICAMP), Laboratory of Cryptography and Information Security (LCIS), Université de Tsukuba = University of Tsukuba, Cryptology, Arithmetic: Hardware and Software (CARAMEL), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Algorithms, Computation, Image and Geometry (LORIA - ALGO), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), Orr Dunkelman, Institute of Computing [Campinas] (IC), Universidade Estadual de Campinas = University of Campinas (UNICAMP), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS) |
| Rok vydání: | 2012 |
| Předmět: |
Discrete mathematics
Order (ring theory) Binary number 0102 computer and information sciences 02 engineering and technology 01 natural sciences Action (physics) 020202 computer hardware & architecture Power (physics) [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR] Optimal Eta pairing FPGA implementation 010201 computation theory & mathematics Proof of concept Pairing Genus (mathematics) ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION 0202 electrical engineering electronic engineering information engineering software implementation supersingular genus-2 curve Hyperelliptic curve Mathematics |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783642279539 CT-RSA Cryptographer's Track at the RSA Conference 2012 (CT-RSA 2012) Cryptographer's Track at the RSA Conference 2012 (CT-RSA 2012), Feb 2012, San Francisco, United States. pp.19 |
| DOI: | 10.1007/978-3-642-27954-6_7 |
| Popis: | This article presents a novel pairing algorithm over supersingular genus-2 binary hyperelliptic curves. Starting from Vercauteren's work on optimal pairings, we describe how to exploit the action of the 23m-th power Verschiebung in order to reduce the loop length of Miller's algorithm even further than the genus-2 ηT approach. As a proof of concept, we detail an optimized software implementation and an FPGA accelerator for computing the proposed optimal Eta pairing on a genus-2 hyperelliptic curve over $\mathbb{F}_{2^{367}}$ , which satisfies the recommended security level of 128 bits. These designs achieve favourable performance in comparison with the best known implementations of 128-bit-security Type-1 pairings from the literature. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|