397 search results - page 13 / 80 » Pseudorandom Functions and Lattices |
MOC
2002
14 years 11 months ago
2002
This paper provides a novel approach to the construction of good lattice rules for the integration of Korobov classes of periodic functions over the unit s-dimensional cube. Theore...
118
click to vote
LICS
1997
IEEE
15 years 3 months ago
1997
IEEE
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...
116
click to vote
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
120
click to vote
CCS
2009
ACM
14 years 9 months ago
2009
ACM
Privacy of RFID systems is receiving increasing attention in the RFID community. Basically, there are two kinds of RFID privacy notions: one based on the indistinguishability of t...
109
click to vote
COMBINATORICS
2002
14 years 11 months ago
2002
The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parki...