Sciweavers

32 search results - page 1 / 7
» Software implementation of Tate pairing over GF(2m)
Sort
View
DATE
2006
IEEE
127views Hardware» more  DATE 2006»
13 years 11 months ago
Software implementation of Tate pairing over GF(2m)
Recently, the interest about the Tate pairing over binary fields has decreased due to the existence of efficient attacks to the discrete logarithm problem in the subgroups of su...
Guido Bertoni, Luca Breveglieri, Pasqualina Fragne...
CODES
2003
IEEE
13 years 10 months ago
Design space exploration of a hardware-software co-designed GF(2m) galois field processor for forward error correction and crypt
This paper describes a hardware-software co-design approach for flexible programmable Galois Field Processing for applications which require operations over GF(2m ), such as RS an...
Wei Ming Lim, Mohammed Benaissa
CHES
2000
Springer
167views Cryptology» more  CHES 2000»
13 years 9 months ago
A High Performance Reconfigurable Elliptic Curve Processor for GF(2m)
This work proposes a processor architecture for elliptic curves cryptosystems over fields GF(2m ). This is a scalable architecture in terms of area and speed that exploits the abil...
Gerardo Orlando, Christof Paar
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...
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