CHES
2001
Springer
14 years 1 months ago
2001
Springer
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...
CHES
2001
Springer
14 years 1 months ago
2001
Springer
This paper introduces a new block cipher, and discusses its security. Its design is optimized for high-bandwidth applications that do not have high requirements on key-schedule lat...
CHES
2001
Springer
14 years 1 months ago
2001
Springer
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...
CHES
2001
Springer
14 years 1 months ago
2001
Springer
CHES
2001
Springer
14 years 1 months ago
2001
Springer
CHES
2001
Springer
14 years 1 months ago
2001
Springer
CHES
2001
Springer
14 years 1 months ago
2001
Springer
Attacks are presented on the IBM 4758 CCA and the Visa Security Module. Two new attack principles are demonstrated. Related key attacks use known or chosen differences between two...
CHES
2001
Springer
14 years 1 months ago
2001
Springer
CHES
2001
Springer
14 years 1 months ago
2001
Springer
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...
CALC
2001
Springer
14 years 1 months ago
2001
Springer
In this paper we investigate how the complexity of the shortest vector problem in a lattice Λ depends on the cycle structure of the additive group Zn /Λ. We give a proof that the...