Security of Biased Sources for Cryptographic Keys (2001)

Cached

Download Links

by Preda Mihailescu

Active Bibliography

On the Reduction Theory for Average Case Complexity – Andreas Blass, Yuri Gurevich - 1991
20 Matrix Transformation is Complete for the Average Case – Andreas Blass, Yuri Gurevich, Andyuri Gurevich - 1995
Probability and Computation – Ludek Kucera - 2001
2 Average-Case Complexity Theory and Polynomial-Time Reductions – A. Pavan - 2001
4 All Natural NPC Problems Have Average-Case Complete Versions – Noam Livne - 2006
4 Efficient Average-Case Algorithms for the Modular Group – Jin-yi Cai, Wolfgang H. Fuchs, Dexter Kozen, Zicheng Liu - 1994
18 Notes on Levin's Theory of Average-Case Complexity – Oded Goldreich - 1997
1 LR(k) Testing is Average-Case Complete – Christoph Karg, Abteilung Theoretische Informatik
AN OBSERVATION ABOUT VARIATIONS OF THE DIFFIE-HELLMAN ASSUMPTION – Raghav Bhaskar, Karthekeyan Ch, Satyanaryana V. Lokam, Peter L. Montgomery, Ramarathnam Venkatesan, Yacov Yacobi
8 Sets Computable in Polynomial Time on Average – Rainer Schuler, Tomoyuki Yamakami - 1995
6 Polynomial Time Samplable Distributions – Tomoyuki Yamakami - 1995
31 Average-case computational complexity theory – Jie Wang - 1997
1 On pseudorandomization of information-theoretically secure schemes without hardness assumptions – Koji Nuida - 2012
Close to Uniform Prime Number Generation With Fewer Random Bits – Pierre-alain Fouque, Mehdi Tibouchi
3 Fast Generation of Prime Numbers of Portable Devices: An Update – Marc Joye, Pascal Paillier - 2006
8 Constructing nonresidues in finite fields and the extended Riemann hypothesis – Johannes Buchmann, Victor Shoup - 1991
5 A Secure Public-Key Signature System With Extremely Fast Verification – Daniel J. Bernstein - 2000
23 Simple Strategies for Large Zero-Sum Games with Applications to Complexity Theory – Richard J. Lipton, Neal E. Young - 1994
1 Efficient Algorithms for Computing the Jacobi Symbol (Extended Abstract) – Shawna M. Meyer, Jonathan P. Sorenson - 1998