2967 search results - page 178 / 594 » Cryptology |
154
click to vote
IMA
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. The key agreement protocol are either based on some computational infeasability, such as the calculus of the discrete logarithm in [1], or on theoretical impossibility un...
148
click to vote
IMA
2001
Springer
15 years 11 months ago
2001
Springer
This paper investigates interoperability problems arising from the use of dissimilar key recovery mechanisms in encrypted communications. The components that can cause interoperabi...
174
click to vote
INDOCRYPT
2001
Springer
15 years 11 months ago
2001
Springer
We present an algorithm for generating elliptic curves of prime order over Optimal Extension Fields suitable for use in cryptography. The algorithm is based on the theory of Comple...
184
click to vote
PKC
2001
Springer
15 years 11 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...
202
click to vote
PKC
2001
Springer
15 years 11 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...