147 search results - page 11 / 30 » Logarithmic keying |
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
EUROPAR
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We introduce SONAR, a structured overlay to store and retrieve objects addressed by multi-dimensional names (keys). The overlay has the shape of a multi-dimensional torus...
WCC
2005
Springer
14 years 3 months ago
2005
Springer
The security of the RSA public key cryptosystem depends on the intractability of the integer factoring problem. This paper shall give some theoretical support to the assumption of ...
ACISP
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We describe implementations for solving the discrete logarithm problem in the class group of an imaginary quadratic field and in the infrastructure of a real quadratic fi...
IPL
2007
13 years 9 months ago
2007
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...