927 search results - page 4 / 186 » A comparison of two approaches to pseudorandomness |
105
click to vote
DMIN
2006
14 years 10 months ago
2006
Medical data is often presented as free text in the form of medical reports. Such documents contain important information about patients, disease progression and management, but ar...
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...
TIT
2010
14 years 4 months ago
2010
This paper considers the construction and analysis of pseudo-random functions (PRFs) with specific reference to modes of operations of a block cipher. In the context of message aut...
ECCC
1998
14 years 9 months ago
1998
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
IJNSEC
2010
14 years 4 months ago
2010
Digital Signature Algorithm (DSA) is an underlying algorithm to form a signature in the Digital Signature Standard (DSS). DSA uses a new random number (or nonce) each time a signa...