64 search results - page 8 / 13 » Integer Quadratic Quasi-polyhedra |
ICCCN
2007
IEEE
15 years 4 months ago
2007
IEEE
—In this paper, we show that minimizing the product of path lengths results in minimizing the probability of connection failure between a source and destination given two links h...
106
click to vote
EUROCRYPT
2005
Springer
15 years 3 months ago
2005
Springer
We prove, under the strong RSA assumption, that the group of invertible integers modulo the product of two safe primes is pseudo-free. More specifically, no polynomial time algor...
ANTS
2004
Springer
15 years 3 months ago
2004
Springer
We study the problem of computing the k-th term of the Farey sequence of order n, for given n and k. Several methods for generating the entire Farey sequence are known. However, th...
ISSAC
1989
Springer
15 years 1 months ago
1989
Springer
: We present a modification of the Goldwasser-Kilian-Atkin primality test, which, when given an input n, outputs either prime or composite, along with a certificate of correctnes...
IEICET
2008
14 years 10 months ago
2008
The hyperelliptic curve cryptosystems take most of the time for computing a scalar multiplication kD of an element D in the Jacobian JC of a hyperelliptic curve C for an integer k....