68 search results - page 10 / 14 » On the Security of Oscillator-Based Random Number Generators |
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
USS
2008
13 years 11 months ago
2008
Generation of random numbers is a critical component of existing post-election auditing techniques. Recent work has largely discouraged the use of all pseudorandom number generato...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
Secure wireless communications is a challenging problem due to the shared nature of the wireless medium. Most existing security protocols apply cryptographic techniques for bit sc...
ISCAS
2003
IEEE
14 years 1 months ago
2003
IEEE
Couple to the communications wired and unwired networks growth, is the increasing demand for strong secure data transmission. New cryptographic standards are developed, and new en...
TIT
2008
13 years 8 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...