Sciweavers

45 search results - page 3 / 9
» Implementing Cryptographic Pairings on Smartcards
Sort
View
PAIRING
2009
Springer
111views Cryptology» more  PAIRING 2009»
14 years 8 days ago
Faster Pairings on Special Weierstrass Curves
This paper presents efficient formulas for computing cryptographic pairings on the curve y2 = cx3 + 1 over fields of large characteristic. We provide examples of pairing-friendly...
Craig Costello, Hüseyin Hisil, Colin Boyd, Ju...
LATINCRYPT
2010
13 years 4 months ago
New Software Speed Records for Cryptographic Pairings
Abstract. This paper presents new software speed records for the computation of cryptographic pairings. More specifically, we present details of an implementation which computes t...
Michael Naehrig, Ruben Niederhagen, Peter Schwabe
CHES
2009
Springer
230views Cryptology» more  CHES 2009»
14 years 6 months ago
Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves
Abstract. This paper presents a design-space exploration of an applicationspecific instruction-set processor (ASIP) for the computation of various cryptographic pairings over Barre...
David Kammler, Diandian Zhang, Dominik Auras, Gerd...
IJNSEC
2008
106views more  IJNSEC 2008»
13 years 5 months ago
Parallel Hardware Architectures for the Cryptographic Tate Pairing
Identity-based cryptography uses pairing functions,which are sophisticated bilinear maps defined on elliptic curves.Computing pairings efficiently in software is presently a relev...
Guido Marco Bertoni, Luca Breveglieri, Pasqualina ...
CHES
2007
Springer
105views Cryptology» more  CHES 2007»
13 years 12 months ago
On the Implementation of a Fast Prime Generation Algorithm
Abstract. A side-channel analysis of a cryptographic algorithm generally concentrates on the encryption or decryption phases, rarely on the key generation phase. In this paper, we ...
Christophe Clavier, Jean-Sébastien Coron