23 search results - page 2 / 5 » On the Provable Security of an Efficient RSA-Based Pseudoran... |
NAA
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. Monte Carlo (MC) methods have proved to be flexible, robust and very useful techniques in computational finance. Several studies have investigated ways to achieve greater...
SIGMOD
2006
ACM
14 years 5 months ago
2006
ACM
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
CRYPTO
1998
Springer
13 years 9 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 ...
DAGSTUHL
2007
13 years 6 months ago
2007
We give an outline of the specification and provable security features of the QUAD stream cipher proposed at Eurocrypt 2006 [6]. The cipher relies on the iteration of a multivaria...
IH
2004
Springer
13 years 10 months ago
2004
Springer
Recently, there are active discussions on the possibility of non-invertible watermarking scheme. A non-invertible scheme prevents an attacker from deriving a valid watermark from a...