Sciweavers

190 search results - page 24 / 38
» Supersingular Elliptic Curves in Cryptography
Sort
View
ITCC
2005
IEEE
15 years 5 months ago
A Scalable and High Performance Elliptic Curve Processor with Resistance to Timing Attacks
This paper presents a high performance and scalable elliptic curve processor which is designed to be resistant against timing attacks. The point multiplication algorithm (double-a...
Alireza Hodjat, David Hwang, Ingrid Verbauwhede
MASCOTS
2001
15 years 1 months ago
Performance of Finite Field Arithmetic in an Elliptic Curve Cryptosystem
As the Internet commerce becomes a more important part of the economy, network security is receiving more emphasis. Time spent in data encryption can be a significant performance ...
Zhi Li, John Higgins, Mark J. Clement
CORR
2010
Springer
192views Education» more  CORR 2010»
14 years 9 months ago
Constructing elliptic curve isogenies in quantum subexponential time
Given two elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit an isogeny between them, but finding such an isog...
Andrew M. Childs, David Jao, Vladimir Soukharev
111
Voted
ICC
2007
IEEE
269views Communications» more  ICC 2007»
15 years 6 months ago
A Routing-Driven Key Management Scheme for Heterogeneous Sensor Networks
–The many-to-one traffic pattern dominates in sensor networks, where a large number of sensor nodes send data to one sink. A sensor node may only communicate with a small portion...
Xiaojiang Du, Yang Xiao, Song Ci, Mohsen Guizani, ...
PAIRING
2007
Springer
108views Cryptology» more  PAIRING 2007»
15 years 5 months ago
Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians
We provide the first explicit construction of genus 2 curves over finite fields whose Jacobians are ordinary, have large prime-order subgroups, and have small embedding degree. ...
David Freeman