International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR Local Search

Possible queries include homomorphic author:david.
Found 30000 results
Algorithms and Arithmetic Operators for Computing the $\eta_T$ Pairing in Characteristic Three
Eprint
https://eprint.iacr.org/2007/417
Jean-Luc Beuchat Nicolas Brisebarre J\'er\'emie Detrey Eiji Okamoto Masaaki Shirase Tsuyoshi Takagi
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...
last revised 9 Sep 2008
A Coprocessor for the Final Exponentiation of the $\eta_T$ Pairing in Characteristic Three
Eprint
https://eprint.iacr.org/2007/045
Jean-Luc Beuchat Nicolas Brisebarre Masaaki Shirase Tsuyoshi Takagi Eiji Okamoto
Since the introduction of pairings over (hyper)elliptic curves in constructive cryptographic applications, an ever increasing number of protocols based on pairings have appeared in the literature. Software implementations...
received 13 Feb 2007
FPGA and ASIC Implementations of the $\eta_T$ Pairing in Characteristic Three
Eprint
https://eprint.iacr.org/2008/280
Jean-Luc Beuchat Hiroshi Doi Kaoru Fujita Atsuo Inomata Piseth Ith Akira Kanaoka Masayoshi Katouno Masahiro Mambo Eiji Okamoto Takeshi Okamoto Takaaki Shiga Masaaki Shirase Ryuji Soga Tsuyoshi Takagi Ananda Vithanage Hiroyasu Yamamoto
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 algorithms and...
last revised 17 Jun 2009
Arithmetic Operators for Pairing-Based Cryptography
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=856
Jean-Luc Beuchat Nicolas Brisebarre Jérémie Detrey Eiji Okamoto
Ches 2007
An Algorithm for the $\eta_T$ Pairing Calculation in Characteristic Three and its Hardware Implementation
Eprint
https://eprint.iacr.org/2006/327
Jean-Luc Beuchat Masaaki Shirase Tsuyoshi Takagi Eiji Okamoto
In this paper, we propose a modified $\eta_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...
last revised 22 Mar 2007
A Refined Algorithm for the $\eta_T$ Pairing Calculation in Characteristic Three
Eprint
https://eprint.iacr.org/2007/311
Jean-Luc Beuchat Masaaki Shirase Tsuyoshi Takagi Eiji Okamoto
We describe further improvements of the $\eta_T$ pairing algorithm in characteristic three. Our approach combines the loop unrolling technique introduced by Granger {\em et. al} for the Duursma-Lee algorithm, and a novel...
last revised 21 Aug 2007
Arithmetic Operators for Pairing-Based Cryptography
Eprint
https://eprint.iacr.org/2007/091
Jean-Luc Beuchat Nicolas Brisebarre J\'er\'emie Detrey Eiji Okamoto
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...
last revised 2 Jun 2007
Fast Architectures for the $\eta_T$ Pairing over Small-Characteristic Supersingular Elliptic Curves
Eprint
https://eprint.iacr.org/2009/398
Jean-Luc Beuchat Jérémie Detrey Nicolas Estibals Eiji Okamoto Francisco Rodríguez-Henríquez
This paper is devoted to the design of fast parallel accelerators for the cryptographic $\eta_T$ pairing on supersingular elliptic curves over finite fields of characteristics two and three. We propose here a novel hardware...
last revised 18 Aug 2009
A Comparison Between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
Eprint
https://eprint.iacr.org/2008/115
Jean-Luc Beuchat Nicolas Brisebarre Jérémie Detrey Eiji Okamoto Francisco Rodríguez-Henríquez
In this article we propose a study of the modified Tate pairing in characteristics two and three. Starting from the $\eta_T$ pairing introduced by Barreto {\em et al.} (Des Codes Crypt, 2007), we detail various algorithmic...
last revised 17 Mar 2008
Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=18579
Jean-Luc Beuchat Jérémie Detrey Nicolas Estibals Eiji Okamoto Francisco Rodríguez-Henríquez
Ches 2009
Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers
Eprint
https://eprint.iacr.org/2009/122
Jean-Luc Beuchat Jérémie Detrey Nicolas Estibals Eiji Okamoto Francisco Rodríguez-Henríquez
This paper is devoted to the design of fast parallel accelerators for the cryptographic Tate pairing in characteristic three over supersingular elliptic curves. We propose here a novel hardware implementation of Miller's loop...
last revised 4 Aug 2009
Some Efficient Algorithms for the Final Exponentiation of $\eta_T$ Pairing
Eprint
https://eprint.iacr.org/2006/431
Masaaki Shirase Tsuyoshi Takagi Eiji Okamoto
Recently Tate pairing and its variations are attracted in cryptography. Their operations consist of a main iteration loop and a final exponentiation. The final exponentiation is necessary for generating a unique value of the...
received 20 Nov 2006
CHES 2007
https://iacr.org/archive/ches2007/ches2007.html
Much of the information on this web page was provided courtesy of Michael Ley and the DBLP Project CHES 2007: Pascal Paillier and Ingrid Verbauwhede (Eds.): Cryptographic Hardware and Embedded Systems - CHES 2007, 9th...
Preface, CHES 2007
https://iacr.org/archive/ches2007/preface.html
Preface, CHES 2007 CHES 2007, the ninth workshop on Cryptographic Hardware and Embedded Systems, was sponsored by the International Association for Cryptologic Research (IACR) and held in Vienna, Austria on September 10-13,...
IACR CHES 2009
https://iacr.org/archive/ches2009/ches2009.html
CHES 2009: Kris Gaj and Christophe Clavier (Eds.): Cryptographic Hardware and Embedded Systems - CHES 2009, 11th International Workshop, Lausanne, Switzerland, September 6-9, 2009, Proceedings Proceedings. CHES 2009 Lausanne,...
Workshop on Cryptographic Hardware and Embedded Systems (CHES 2007)
https://iacr.org/workshops/ches/ches2007/program2007.html
CHES 2010 CALL FOR PAPERS CHES STATISTICS FORMER CHES STEERING COMMITTEE SC RULES CHES '99 CHES 2000 CHES 2001 CHES 2002 CHES 2003 CHES 2004 CHES 2005 CHES 2006 CHES 2007 CHES 2008 CHES 2009 Workshop on Cryptographic Hardware...
Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
Eprint
https://eprint.iacr.org/2010/559
Diego F. Aranha Jean-Luc Beuchat J\'er\'emie Detrey Nicolas Estibals
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 $2^{3m}$-th power...
last revised 23 Nov 2011
Workshop on Cryptographic Hardware and Embedded Systems 2009 (CHES 2009)
https://iacr.org/workshops/ches/ches2009/program2009.html
CHES Home CHES 2009 PROGRAM ACCEPTED PAPERS PAPER SUBMISSION SYSTEM RUMP SESSION POSTERS CALL FOR PAPERS HOT TOPIC SUBMISSION HOT TOPIC SESSION CFP CALL FOR SPONSORS GUIDE BOOK REGISTRATION ACCOMMODATION VENUE VISA AUTHOR...
Workshop on Cryptographic Hardware and Embedded Systems 2009 (CHES 2009)
https://iacr.org/workshops/ches/ches2009/accepted.html
CHES Home CHES 2009 PROGRAM ACCEPTED PAPERS PAPER SUBMISSION SYSTEM RUMP SESSION POSTERS CALL FOR PAPERS HOT TOPIC SUBMISSION HOT TOPIC SESSION CFP CALL FOR SPONSORS GUIDE BOOK REGISTRATION ACCOMMODATION VENUE VISA AUTHOR...
Efficient Implementation of Tate Pairing on a Mobile Phone using Java
Eprint
https://eprint.iacr.org/2006/299
Yuto Kawahara Tsuyoshi Takagi Eiji Okamoto
Pairing-based cryptosystems (PBC) have been attracted by researchers in cryptography. Some implementations show that PBC are relatively slower than the standard public key cryptosystems. We present an efficient implementation...
received 31 Aug 2006
Next ►