90 search results - page 2 / 18 » Pairings for cryptographers |
CHES
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. Pairings on elliptic curves are fast coming of age as cryptographic primitives for deployment in new security applications, particularly in the context of implementations...
IJNSEC
2008
13 years 6 months ago
2008
Identity-based cryptography uses pairing functions,which are sophisticated bilinear maps defined on elliptic curves.Computing pairings efficiently in software is presently a relev...
PAIRING
2007
Springer
14 years 11 days ago
2007
Springer
In this paper we describe an efficient implementation of the Tate and Ate pairings using Barreto-Naehrig pairing-friendly curves, on both a standard 32-bit PC and on a 32-bit smart...
CANS
2009
Springer
14 years 26 days ago
2009
Springer
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 Tat...
LATINCRYPT
2010
13 years 4 months ago
2010
A common scenario in many pairing-based cryptographic protocols is that one argument in the pairing is fixed as a long term secret key or a constant parameter in the system. In th...