Sciweavers

CHES
2001
Springer
193views Cryptology» more  CHES 2001»
13 years 9 months ago
Preventing SPA/DPA in ECC Systems Using the Jacobi Form
Abstract. In this paper we show how using a representation of an elliptic curve as the intersection of two quadrics in P3 can provide a defence against Simple and Differental Powe...
Pierre-Yvan Liardet, Nigel P. Smart
CHES
2001
Springer
191views Cryptology» more  CHES 2001»
13 years 9 months ago
A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware
Abstract. This work proposes a new elliptic curve processor architecture for the computation of point multiplication for curves defined over fields GF(p). This is a scalable arch...
Gerardo Orlando, Christof Paar
CHES
2001
Springer
130views Cryptology» more  CHES 2001»
13 years 9 months ago
Generating Elliptic Curves of Prime Order
A variation of the Complex Multiplication (CM) method for generating elliptic curves of known order over finite fields is proposed. We give heuristics and timing statistics in th...
Erkay Savas, Thomas A. Schmidt, Çetin Kaya ...
CHES
2001
Springer
124views Cryptology» more  CHES 2001»
13 years 9 months ago
High-Radix Design of a Scalable Modular Multiplier
This paper describes an algorithm and architecture based on an extension of a scalable radix-2 architecture proposed in a previous work. The algorithm is proven to be correct and t...
Alexandre F. Tenca, Georgi Todorov, Çetin K...
CHES
2001
Springer
110views Cryptology» more  CHES 2001»
13 years 9 months ago
Fast Primitives for Internal Data Scrambling in Tamper Resistant Hardware
Eric Brier, Helena Handschuh, Christophe Tymen
Cryptology
Top of PageReset Settings