Sciweavers

5 search results - page 1 / 1
» Compact Hardware for Computing the Tate Pairing over 128-Bit...
Sort
View
PAIRING
2010
Springer
153views Cryptology» more  PAIRING 2010»
13 years 2 months ago
Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves
This paper presents a novel method for designing compact yet efficient hardware implementations of the Tate pairing over supersingular curves in small characteristic. Since such cu...
Nicolas Estibals
CANS
2009
Springer
109views Cryptology» more  CANS 2009»
13 years 11 months ago
Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves
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...
Jean-Luc Beuchat, Emmanuel López-Trejo, Lui...
CHES
2009
Springer
162views Cryptology» more  CHES 2009»
14 years 5 months ago
Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers
Abstract. This paper is devoted to the design of fast parallel accelerators for the cryptographic Tate pairing in characteristic three over supersingular elliptic curves. We propos...
Jean-Luc Beuchat, Jérémie Detrey, Ni...
CHES
2005
Springer
111views Cryptology» more  CHES 2005»
13 years 10 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
ICONS
2008
IEEE
13 years 11 months ago
An Efficient Hardware Implementation of the Tate Pairing in Characteristic Three
DL systems with bilinear structure recently became an important base for cryptographic protocols such as identity-based encryption (IBE). Since the main computational task is the ...
Giray Kömürcü, Erkay Savas