147 search results - page 6 / 30 » Logarithmic keying |
72
Voted
ICDE
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper we show that the topologies of most logarithmic-style P2P systems like Pastry, Tapestry or P-Grid resemble small-world graphs. Inspired by Kleinberg’s small-world ...
IMA
2001
Springer
15 years 2 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...
ICANN
2005
Springer
15 years 3 months ago
2005
Springer
- In this paper, we show how a topographic mapping can be created from a product of experts. We learn the parameters of the mapping using gradient descent on the negative logarithm...
75
Voted
CHES
2005
Springer
15 years 3 months ago
2005
Springer
We describe a new variant of the well known Baby-Step Giant-Step algorithm in the case of some discrete logarithms with a special structure. More precisely, we focus on discrete lo...
86
Voted
AINA
2004
IEEE
15 years 1 months ago
2004
IEEE
A key agreement protocol is utilized in a network system such that two users are able to establish a commonly shared secret key. Entities within the same security level can commun...