Towards true random number generation in mobile environments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5838 LNCS, Issue , 2009, Pages 179-189

  Bouda, Jan ^a   Krhovjak, Jan ^a   Matyas, Vashek ^a   Svenda, Petr ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

Min entropy; Random number generator; Randomness extractor

Indexed keywords

BIT RATES; HASHING FUNCTIONS; LOW BIT RATE; MIN-ENTROPY; MOBILE ENVIRONMENTS; POCKET COMPUTERS; POST PROCESS; RANDOM DATA; RANDOM NUMBER GENERATORS; RANDOMNESS EXTRACTORS; STATISTICAL TESTING; TRACE DISTANCES; UNIFORM DISTRIBUTION;

ENTROPY; INTERNET; MOBILE DEVICES; NUMBER THEORY; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

RANDOM NUMBER GENERATION;

EID: 78650734264     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04766-4_13     Document Type: Conference Paper

References (13)

1. Barak, B., Shaltiel, R., Tromer, E.: True random number generators secure in a changing environment. In: Walter, C.D., Koç, Ç.K., Paar, C. (eds.) CHES 2003. LNCS, vol. 2779, pp. 166-180. Springer, Heidelberg (2003)
2. Carter, J.L., Wegman, M.N.: Universal hash functions. Journal of Computer and System Sciences 18, 143-144 (1979)
3. Goldberg, I., Wagner, D.: Randomness and the Netscape Browser. Dr. Dobb's Journal, Special issue on Encoding: Encryption, Compression, and Error Correction (1996)
4. Impagliazzo, R., Levin, L.A., Luby, M.: Pseudorandom generation from oneway functions. In: Proceeding of the 21st ACM Symposium on Theory of Computing (1989)
5. Impagliazzo, R., Zuckerman, D.: How to recycle random bits. In: Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, pp. 248-253 (1989)
6. Klingsheim, A.N., Moen, V., Hole, K.J.: Challenges in Securing Networked J2ME Applications. Computer 40, 24-30 (2007)
7. Krhovjak, J., Svenda, P., Matyas, V.: The Sources of Randomness in Mobile Devices. In: Proceeding of the 12th Nordic Workshop on Secure IT Systems, Reykjavik University, pp. 73-84 (2007)
8. Lowe, G.: OpenSSL Security Advisory - OpenSSL FIPS Object Module Vulnerabilities (2007), http://www.openssl.org/news/secadv-20071129.txt
9. Bello, L.: Debian Security Advisory - OpenSSL predictable random number generator (2008), http://www.debian.org/security/2008/dsa-1571
10. Shaltiel, R.: Recent Developments in Explicit Constructions of Extractors. Bulletin of the EATCS 77, 67-95 (2002)
11. Shoup, V.: On fast and provably secure message authentication based on universal hashing. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 313-328. Springer, Heidelberg (1996), http://www.shoup.net/papers/macs.pdf
12. Simonsen, K.I.F., Moen, V., Hole, K.J.: Attack on Sun's MIDP Reference Implementation of SSL. In: Proceeding 10th Nordic Workshop on Secure IT Systems, Tartu University, pp. 96-103 (2005)
13. Srinivasan, A., Zuckerman, D.: Computing with very weak random sources. SIAM Journal on Computing 28(4), 1433-1459 (1999)