Sciweavers

209 search results - page 17 / 42
» Supersingular Curves in Cryptography
Sort
View
PERCOM
2005
ACM
14 years 7 months ago
Energy Analysis of Public-Key Cryptography for Wireless Sensor Networks
In this paper, we quantify the energy cost of authentication and key exchange based on public-key cryptography on an 8-bit microcontroller platform. We present a comparison of two...
Arvinderpal Wander, Nils Gura, Hans Eberle, Vipul ...
PAIRING
2007
Springer
140views Cryptology» more  PAIRING 2007»
14 years 2 months ago
The Tate Pairing Via Elliptic Nets
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. The algorithm uses a generalisation of elliptic divisibility sequences known as...
Katherine E. Stange
FPL
2008
Springer
131views Hardware» more  FPL 2008»
13 years 9 months ago
Enhancing COPACOBANA for advanced applications in cryptography and cryptanalysis
Cryptanalysis of symmetric and asymmetric ciphers is a challenging task due to the enormous amount of involved computations. To tackle this computational complexity, usually the e...
Tim Güneysu, Christof Paar, Gerd Pfeiffer, Ma...
WIMOB
2008
IEEE
14 years 2 months ago
On the Energy Cost of Communication and Cryptography in Wireless Sensor Networks
Energy is a central concern in the deployment of wireless sensor networks. In this paper, we investigate the energy cost of cryptographic protocols, both from a communication and ...
Giacomo de Meulenaer, François Gosset, Fran...
PKC
2010
Springer
234views Cryptology» more  PKC 2010»
13 years 9 months ago
Solving a 676-Bit Discrete Logarithm Problem in GF(36n)
Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...
Takuya Hayashi, Naoyuki Shinohara, Lihua Wang, Shi...