Sciweavers

79 search results - page 2 / 16
» Cryptosystems Based on Elliptic Curve Pairing
Sort
View
CANS
2006
Springer
129views Cryptology» more  CANS 2006»
13 years 9 months ago
Side Channel Attacks and Countermeasures on Pairing Based Cryptosystems over Binary Fields
Pairings on elliptic curves have been used as cryptographic primitives for the development of new applications such as identity based schemes. For the practical applications, it is...
Tae-Hyun Kim, Tsuyoshi Takagi, Dong-Guk Han, Ho Wo...
FDTC
2008
Springer
160views Cryptology» more  FDTC 2008»
13 years 7 months ago
Error Detection for Borrow-Save Adders Dedicated to ECC Unit
Differential Fault Analysis (DFA) is a real threat for elliptic curve cryptosystems. This paper describes an elliptic curve cryptoprocessor unit resistant against fault injection....
Julien Francq, Jean-Baptiste Rigaud, Pascal Manet,...
COMCOM
2011
13 years 12 days ago
TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks
Key distribution in Wireless Sensor Networks (WSNs) is challenging. Symmetric cryptosystems can perform it efficiently, but they often do not provide a perfect trade-off between ...
Leonardo B. Oliveira, Diego F. Aranha, Conrado Por...
EUROCRYPT
2010
Springer
13 years 10 months ago
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
David Mandell Freeman
JOC
2010
106views more  JOC 2010»
13 years 3 months ago
A Taxonomy of Pairing-Friendly Elliptic Curves
Elliptic curves with small embedding degree and large prime-order subgroup are key ingredients for implementing pairingbased cryptographic systems. Such “pairing-friendly” curv...
David Freeman, Michael Scott, Edlyn Teske