Sciweavers

37 search results - page 5 / 8
» Fast algorithms for computing isogenies between elliptic cur...
Sort
View
CHES
2005
Springer
149views Cryptology» more  CHES 2005»
14 years 28 days ago
Resistance of Randomized Projective Coordinates Against Power Analysis
Embedded devices implementing cryptographic services are the result of a trade-off between cost, performance and security. Aside from flaws in the protocols and the algorithms us...
William Dupuy, Sébastien Kunz-Jacques
ACMSE
2006
ACM
13 years 11 months ago
Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
Selçuk Baktir, Berk Sunar
SMA
2008
ACM
182views Solid Modeling» more  SMA 2008»
13 years 7 months ago
Voronoi diagram computations for planar NURBS curves
We present robust and efficient algorithms for computing Voronoi diagrams of planar freeform curves. Boundaries of the Voronoi diagram consist of portions of the bisector curves b...
Joon-Kyung Seong, Elaine Cohen, Gershon Elber
CHES
2004
Springer
187views Cryptology» more  CHES 2004»
14 years 24 days 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
TIP
2008
168views more  TIP 2008»
13 years 7 months ago
A Real-Time Algorithm for the Approximation of Level-Set-Based Curve Evolution
Abstract--In this paper, we present a complete and practical algorithm for the approximation of level-set-based curve evolution suitable for real-time implementation. In particular...
Yonggang Shi, William Clement Karl