Sciweavers

1369 search results - page 15 / 274
» Lattice computations for random numbers
Sort
View
VOTEID
2007
Springer
14 years 2 months ago
Bingo Voting: Secure and Coercion-Free Voting Using a Trusted Random Number Generator
It is debatable if current direct-recording electronic voting machines can sufficiently be trusted for a use in elections. Reports about malfunctions and possible ways of manipulat...
Jens-Matthias Bohli, Jörn Müller-Quade, ...
SODA
2008
ACM
88views Algorithms» more  SODA 2008»
13 years 10 months ago
Sampling stable marriages: why spouse-swapping won't work
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...
Nayantara Bhatnagar, Sam Greenberg, Dana Randall
GLVLSI
2009
IEEE
170views VLSI» more  GLVLSI 2009»
14 years 19 days ago
Physical unclonable function and true random number generator: a compact and scalable implementation
Physical Unclonable Functions (PUF) and True Random Number Generators (TRNG) are two very useful components in secure system design. PUFs can be used to extract chip-unique signat...
Abhranil Maiti, Raghunandan Nagesh, Anand Reddy, P...
ISSAC
1992
Springer
114views Mathematics» more  ISSAC 1992»
14 years 25 days ago
Parallel Lattice Basis Reduction
Abstract. Lattice basis reduction is an important problem in geometry of numbers with applications in combinatorial optimization, computer algebra, and cryptography. The well-known...
Gilles Villard
VIS
2007
IEEE
183views Visualization» more  VIS 2007»
14 years 10 months ago
Lattice Based Volumetric Global Illumination
We describe a novel volumetric global illumination framework based on the Face-Centered Cubic (FCC) lattice. An FCC lattice has important advantages over a Cartesian lattice. It ha...
Feng Qiu, Fang Xu, Zhe Fan, Neophytos Neophytou...