193 search results - page 5 / 39 » Short Bases of Lattices over Number Fields |
ANTS
1998
Springer
13 years 11 months ago
1998
Springer
We prove that to find a nontrivial integer linear relation between vectors of a lattice L IRn , whose euclidean length is at most M, one needs O n5+ (ln Mn/)1+ binary operations f...
AAECC
2005
Springer
13 years 7 months ago
2005
Springer
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
ICRA
2010
IEEE
13 years 5 months ago
2010
IEEE
— Pretouch sensing is longer range than contact, but shorter range than vision. The hypothesis motivating this work is that closed loop feedback based on short range but nonconta...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
This paper considers the problem of selecting either routes that consist of long hops or routes that consist of short hops in a network of multiple-antenna nodes, where each trans...
ASIACRYPT
2010
Springer
13 years 5 months ago
2010
Springer
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...