Sciweavers

1369 search results - page 1 / 274
» Lattice computations for random numbers
Sort
View
MOC
2000
132views more  MOC 2000»
13 years 4 months ago
Lattice computations for random numbers
We improve on a lattice algorithm of Tezuka for the computation of the k-distribution of a class of random number generators based on finite fields. We show how this is applied to ...
Raymond Couture, Pierre L'Ecuyer
MOC
1998
102views more  MOC 1998»
13 years 4 months ago
Classification of integral lattices with large class number
A detailed exposition of Kneser’s neighbour method for quadratic lattices over totally real number fields, and of the sub-procedures needed for its implementation, is given. Usi...
Rudolf Scharlau, Boris Hemkemeier
CIE
2009
Springer
13 years 8 months ago
The First Order Theories of the Medvedev and Muchnik Lattices
We show that the first order theories of the Medevdev lattice and the Muchnik lattice are both computably isomorphic to the third order theory of the natural numbers.
Andrew Lewis, André Nies, Andrea Sorbi
FOCS
1998
IEEE
13 years 9 months ago
The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
Daniele Micciancio
STOC
2005
ACM
158views Algorithms» more  STOC 2005»
14 years 5 months ago
Polynomial time quantum algorithm for the computation of the unit group of a number field
We present a quantum algorithm for the computation of the irrational period lattice of a function on Zn which is periodic in a relaxed sense. This algorithm is applied to compute t...
Arthur Schmidt, Ulrich Vollmer