SACRYPT
2001
Springer
14 years 1 months ago
2001
Springer
This paper compares different approaches for computing power products 1≤i≤k gei i in finite groups. We look at the conventional simultaneous exponentiation approach and prese...
PKC
2001
Springer
14 years 1 months ago
2001
Springer
At ISW’99, Nishioka, Hanaoka and Imai proposed a digital signature scheme on ID-based key-sharing infrastructures. That signature scheme is claimed to be secure if the discrete l...
PKC
2001
Springer
14 years 1 months ago
2001
Springer
This paper introduces a novel class of computational problems, the gap problems, which can be considered as a dual to the class of the decision problems. We show the relationship a...
PKC
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. We describe a new general method to perform part of the setup stage of the XTR system introduced at Crypto 2000, namely finding the trace of a generator of the XTR group...
PKC
2001
Springer
14 years 1 months ago
2001
Springer
PKC
2001
Springer
14 years 1 months ago
2001
Springer
Quite recently, in [4], a new time-memory tradeoff algorithm was presented. The original goal of this algorithm was to count the number of points on an elliptic curve, however, th...
PKC
2001
Springer
14 years 1 months ago
2001
Springer
PKC
2001
Springer
14 years 1 months ago
2001
Springer
Pedersen designed the first scheme for generating Discrete-Log keys without
INDOCRYPT
2001
Springer
14 years 1 months ago
2001
Springer
In this paper, the authors analyze the Gaudry–Hess–Smart (GHS) Weil descent attack on the elliptic curve discrete logarithm problem (ECDLP) for elliptic curves defined over c...
INDOCRYPT
2001
Springer
14 years 1 months ago
2001
Springer
Most last-round attacks on iterated block ciphers provide some design criteria for the round function. Here, we focus on the links between the underlying properties. Most notably, ...