Sciweavers

190 search results - page 36 / 38
» Supersingular Elliptic Curves in Cryptography
Sort
View
101
Voted
CHES
2003
Springer
104views Cryptology» more  CHES 2003»
15 years 4 months ago
Power-Analysis Attacks on an FPGA - First Experimental Results
Field Programmable Gate Arrays (FPGAs) are becoming increasingly popular, especially for rapid prototyping. For implementations of cryptographic algorithms, not only the speed and ...
Siddika Berna Örs, Elisabeth Oswald, Bart Pre...
151
Voted
CIS
2006
Springer
15 years 3 months ago
Efficient Implementation of Tate Pairing on a Mobile Phone Using Java
Pairing-based cryptosystems (PBC) have been attracted by researchers in cryptography. Some implementations show that PBC are relatively slower than the standard public key cryptosy...
Yuto Kawahara, Tsuyoshi Takagi, Eiji Okamoto
106
Voted
IJSN
2006
140views more  IJSN 2006»
14 years 11 months ago
Load-balanced key establishment methodologies in wireless sensor networks
: Wireless Sensor Networks (WSN) pose a need for dynamically establishing a secret key joint to a group of nodes. Elliptic Curve Cryptography (ECC) has emerged as a suitable public...
Ortal Arazi, Hairong Qi
98
Voted
CHES
2004
Springer
187views Cryptology» more  CHES 2004»
15 years 5 months ago
A New Attack with Side Channel Leakage During Exponent Recoding Computations
In this paper we propose a new side channel attack, where exponent recodings for public key cryptosystems such as RSA and ECDSA are considered. The known side channel attacks and c...
Yasuyuki Sakai, Kouichi Sakurai
87
Voted
ANTS
2006
Springer
78views Algorithms» more  ANTS 2006»
15 years 3 months ago
Hidden Pairings and Trapdoor DDH Groups
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
Alexander W. Dent, Steven D. Galbraith