461 search results - page 26 / 93 » Higher Kurtz randomness |
77
Voted
ASIACRYPT
2003
Springer
15 years 2 months ago
2003
Springer
This paper investigates some modular powering functions suitable for cryptography. It is well known that the Rabin encryption function is a 4-to-1 mapping and breaking its one-wayn...
APPROX
2007
Springer
15 years 3 months ago
2007
Springer
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
FSE
2008
Springer
14 years 11 months ago
2008
Springer
The aim of this paper is to advocate a new software-oriented hash function family based on the HAIFA framework of Biham and Dunkelman, inheriting built-in randomized hashing and hi...
MKTSCI
2010
14 years 8 months ago
2010
A common theme in the marketing literature is the acquisition and retention of customers as they trade-up from inexpensive, introductory offerings to those of higher quality. We e...
ICIP
2009
IEEE
14 years 7 months ago
2009
IEEE
Leading compressed sensing (CS) methods require m = O (k log(n)) compressive samples to perfectly reconstruct a k-sparse signal x of size n using random projection matrices (e.g., ...