Sciweavers

76 search results - page 10 / 16
» Pipelining GF(P) Elliptic Curve Cryptography Computation
Sort
View
CHES
2005
Springer
111views Cryptology» more  CHES 2005»
15 years 3 months ago
Hardware Acceleration of the Tate Pairing in Characteristic Three
Although identity based cryptography offers many functional advantages over conventional public key alternatives, the computational costs are significantly greater. The core comp...
Philipp Grabher, Dan Page
115
Voted
COMCOM
2011
14 years 5 months 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...
CHES
2009
Springer
230views Cryptology» more  CHES 2009»
15 years 10 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...
AINA
2007
IEEE
15 years 4 months ago
An Efficient Scheme for User Authentication in Wireless Sensor Networks
This paper presents a distributed user authentication scheme in wireless sensor networks. Our scheme is based on the self-certified keys cryptosystem (SCK), and we have modified i...
Canming Jiang, Bao Li, Haixia Xu
ICPADS
2005
IEEE
15 years 3 months ago
Key Agreement for Heterogeneous Mobile Ad-Hoc Groups
In this paper we propose an efficient key agreement protocol suite for heterogeneous mobile ad-hoc groups, whose members use mobile devices with different performance limitations...
Mark Manulis