274 search results - page 38 / 55 » Counting lattice vectors |
CALC
2001
Springer
15 years 4 months ago
2001
Springer
We show that a positive definite integral ternary form can be reduced with O(M(s) log2 s) bit operations, where s is the binary encoding length of the form and M(s) is the bit-com...
91
Voted
COCOON
1999
Springer
15 years 4 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
ANTS
1994
Springer
15 years 3 months ago
1994
Springer
We propose a fast variant of the Gaussian algorithm for the reduction of two{ dimensional lattices for the l1; l2; and l1;norm. The algorithm runs in at most O(n M(B) logB) bit op...
SICHERHEIT
2008
15 years 1 months ago
2008
Abstract: The NTRU encryption scheme is an interesting alternative to well-established encryption schemes such as RSA, ElGamal, and ECIES. The security of NTRU relies on the hardne...
104
click to vote
ORL
2008
14 years 11 months ago
2008
A central result in the theory of integer optimization states that a system of linear diophantine equations Ax = b has no integral solution if and only if there exists a vector in...