397 search results - page 22 / 80 » Pseudorandom Functions and Lattices |
107
click to vote
CRYPTO
1998
Springer
15 years 5 months ago
1998
Springer
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
131
click to vote
EUROCRYPT
2006
Springer
15 years 5 months ago
2006
Springer
To prove that a secure key-agreement protocol exists one must at least show P = NP. Moreover any proof that the sequential composition of two non-adaptively secure pseudorandom fun...
120
click to vote
TIP
2008
15 years 22 days ago
2008
Images are conventionally sampled on a rectangular lattice, and they are also commonly stored as such a lattice. Thus, traditional image processing is carried out on the rectangula...
104
click to vote
ARITH
2007
IEEE
15 years 5 months ago
2007
IEEE
We address the problem of computing a good floating-point-coefficient polynomial approximation to a function, with respect to the supremum norm. This is a key step in most process...
COMBINATORICS
2007
15 years 1 months ago
2007
We show that the generating function (in n) for the number of walks on the square lattice with steps (1, 1), (1, −1), (2, 2) and (2, −2) from (0, 0) to (2n, 0) in the region 0...