E. Estimator and .. , 120 11 LINUX Mixing function, p.126

M. Abdalla, S. Belaïd, and P. Fouque, Leakage-Resilient Symmetric Encryption via Re-keying, Cryptographic Hardware and Embedded Systems ? CHES 2013, pp.471-488, 2013.
DOI : 10.1007/978-3-642-40349-1_27
URL : https://hal.archives-ouvertes.fr/hal-01094306

M. Abdalla, S. Belaïd, D. Pointcheval, S. Ruhault, and D. Vergnaud, Robust Pseudo-Random Number Generators with Input Secure Against Side-Channel Attacks -Extended Version, Cryptology ePrint Archive, vol.6, p.91, 2015.

[. F. Aranha and C. P. Gouvêa, RELIC is an Efficient LIbrary for Cryptography, p.135

A. Akavia, S. Goldwasser, and V. Vaikuntanathan, Simultaneous Hardcore Bits and Cryptography against Memory Attacks, TCC 2009: 6th Theory of Cryptography Conference, pp.474-495, 2009.
DOI : 10.1007/978-3-642-00457-5_28

G. Argyros and A. Kiayias, I forgot your password: randomness attacks against php applications, Proceedings of the 21st USENIX conference on Security symposium, pp.6-6

D. Boneh, R. A. Demillo, and R. J. Lipton, On the Importance of Eliminating Errors in Cryptographic Computations, Journal of Cryptology, vol.14, issue.2, pp.101-119, 2001.
DOI : 10.1007/s001450010016

S. Belaïd, V. Grosso, and F. Standaert, Masking and leakage-resilient primitives: One, the other(s) or both? Cryptography and Communications, pp.163-184, 2015.

B. Barak, S. Burton, and K. , Ieee p1363: A standard for rsa, diffie-hellman, and elliptic-curve cryptography (abstract), ACM CCS 05: 12th Conference on Computer and Communications Security, pp.203-212, 1996.

E. Barker and J. Kelsey, Recommendation for random number generation using deterministic random bit generators. NIST Special Publication 800-90A, p.69, 2012.

M. Bellare, J. Kilian, and P. Rogaway, The Security of Cipher Block Chaining, Lecture Notes in Computer Science, vol.839, pp.341-358, 1994.
DOI : 10.1007/3-540-48658-5_32

A. Bogdanov, D. Khovratovich, and C. Rechberger, Biclique Cryptanalysis of the Full AES, Advances in Cryptology ? ASI- ACRYPT 2011, pp.344-371, 2011.
DOI : 10.1007/978-3-642-25385-0_19

M. Bellare and P. Rogaway, The Security of Triple Encryption and a Framework??for??Code-Based??Game-Playing??Proofs, Lecture Notes in Computer Science, vol.4004, issue.9, pp.409-426, 2006.
DOI : 10.1007/11761679_25

E. Biham and A. Shamir, Differential fault analysis of secret key cryptosystems
DOI : 10.1007/BFb0052259

K. Jr and . Editor, Advances in Cryptology ? CRYPTO'97, volume 1294 of Lecture Notes in Computer Science, pp.513-525, 1997.

[. Barak, R. Shaltiel, and E. Tromer, True Random Number Generators Secure in a Changing Environment, Cryptographic Hardware and Embedded Systems ? CHES 2003, pp.166-180, 2003.
DOI : 10.1007/978-3-540-45238-6_14

M. Bellare and B. S. Yee, Forward-Security in Private-Key Cryptography, Topics in Cryptology ? CT-RSA 2003, pp.1-18, 2003.
DOI : 10.1007/3-540-36563-X_1

B. Chor and O. Goldreich, Unbiased bits from sources of weak randomness and probabilistic communication complexity (extended abstract), 26th Annual Symposium on Foundations of Computer Science, pp.429-442, 1985.

M. Cornejo and S. Ruhault, Characterization of Real-Life PRNGs under Partial State Corruption, Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, CCS '14, pp.1004-1015, 2014.
DOI : 10.1145/2660267.2660377
URL : https://hal.archives-ouvertes.fr/hal-01084490

[. Dorrendorf, Z. Gutterman, and B. Pinkas, Cryptanalysis of the windows random number generator, Proceedings of the 14th ACM conference on Computer and communications security , CCS '07, pp.476-485, 2007.
DOI : 10.1145/1315245.1315304

A. Desai, A. Hevia, and Y. Lisa-yin, A Practice-Oriented Treatment of Pseudorandom Number Generators, Advances in Cryptology ? EUROCRYPT 2002 41st Annual ACM Symposium on Theory of Computing, pp.368-383, 2002.
DOI : 10.1007/3-540-46035-7_24

G. Di-crescenzo, R. J. Lipton, and S. Walfish, Perfectly Secure Password Protocols in the Bounded Retrieval Model, TCC 2006: 3rd Theory of Cryptography Conference, pp.225-244, 2006.
DOI : 10.1007/11681878_12

S. Dziembowski and K. Pietrzak, Leakage-Resilient Cryptography, 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp.293-302, 2008.
DOI : 10.1109/FOCS.2008.56

Y. Dodis and K. Pietrzak, Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks, Lecture Notes in Computer Science, vol.6223, issue.4, pp.21-40, 2010.
DOI : 10.1007/978-3-642-14623-7_2

D. Dodis, S. Pointcheval, D. Ruhault, D. Vergnaud, and . Wichs, Security analysis of pseudo-random number generators with input, Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, CCS '13, pp.647-658, 2013.
DOI : 10.1145/2508859.2516653
URL : https://hal.archives-ouvertes.fr/hal-00864431

Y. Dodis, T. Ristenpart, and S. P. Vadhan, Randomness condensers for efficiently samplable, seed-dependent sources 18 [DSS00] Digital signature standard (dss), fips pub 186-2 with change notice How to eat your entropy and have it too -optimal recovery strategies for compromised RNGs, TCC 2012: 9th Theory of Cryptography Conference FIPS PUB 186-2, U.S. Department of Commerce Advances in Cryptology ? CRYPTO 2014, pp.618-635, 2000.

S. Dziembowski, Intrusion-Resilience Via the Bounded-Storage Model, TCC 2006: 3rd Theory of Cryptography Conference, pp.207-224, 2006.
DOI : 10.1007/11681878_11

D. Eastlake, J. Schiller, and S. Crocker, RFC 4086 -Randomness Requirements for Security, 2003.

Ú. Erlingsson, Y. Younan, and F. Piessens, Low-Level Software Security by Example, Handbook of Information and Communication Security, pp.633-658, 2010.
DOI : 10.1007/978-3-642-04117-4_30

S. Faust, K. Pietrzak, and J. Schipper, Practical Leakage-Resilient Symmetric Cryptography, Cryptographic Hardware and Embedded Systems ? CHES 2012, pp.213-232, 2012.
DOI : 10.1007/978-3-642-33027-8_13

D. Pierre-alain-fouque, S. Pointcheval, and . Zimmer, HMAC is a randomness extractor and applications to TLS, ASIACCS 08: 3rd Conference on Computer and Communications Security, pp.21-32, 2008.

[. Ferguson, B. Schneier, and T. Kohno, Cryptography Engineering: Design Principles and Practical Applications, p.135, 2010.
DOI : 10.1002/9781118722367

S. Goldwasser and M. Bellare, Lecture notes on cryptography, p.114, 2001.

O. Goldreich, S. Goldwasser, and S. Micali, How to construct random functions, Journal of the ACM, vol.33, issue.4, pp.792-807, 1986.
DOI : 10.1145/6490.6503

[. Goichon, C. Lauradoux, G. Salagnac, and T. Vuillemin, Entropy transfers in the Linux Random Number Generator, p.119, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00738638

Z. Gutterman, B. Pinkas, and T. Gutmann, Analysis of the linux random number generator Software generation of practically strong random numbers, IEEE Symposium on Security and Privacy Proceedings of the 7th USENIX Security Symposium Eric Wustrow, and J. Alex Halderman. Mining your Ps and Qs: Detection of widespread weak keys in network devices Proceedings of the 21st USENIX Security Symposium, pp.371-385, 2005.

J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby, A Pseudorandom Generator from any One-way Function, IBM14] Recent Fixes in IBM SecureRandom, pp.1364-1396, 1999.
DOI : 10.1137/S0097539793244708

R. Impagliazzo, A personal view of average-case complexity, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference, pp.134-147, 1995.
DOI : 10.1109/SCT.1995.514853

D. Soo-hyeon-kim, D. Han, and . Lee, Predictability of android OpenSSL's pseudo random number generator, ACM CCS 13: 20th Conference on Computer and Communications Security, pp.659-668, 2013.

W. Killmann and W. Schindler, A proposal for: Functionality classes for random number generators, AIS, vol.20, issue.3, p.31, 2011.

P. Koopman, 32-bit cyclic redundancy codes for Internet applications, Proceedings International Conference on Dependable Systems and Networks, pp.459-472, 2002.
DOI : 10.1109/DSN.2002.1028931

J. Kelsey, B. Schneier, D. Wagner, and C. Hall, Cryptanalytic Attacks on Pseudorandom Number Generators, Fast Software Encryption ? FSE'98, pp.168-188, 1998.
DOI : 10.1007/3-540-69710-1_12

K. Arjen, J. P. Lenstra, M. Hughes, J. W. Augier, T. Bos et al., Public keys, Advances in Cryptology ? CRYPTO 2012, pp.626-642, 2012.

[. Lacharme, A. Rock, V. Strubel, and M. Videau, The linux pseudorandom number generator revisited, Cryptology ePrint Archive, vol.251, issue.119, p.124, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01005441

S. Lucks, The Sum of PRPs Is a Secure PRF, Lecture Notes in Computer Science, vol.1807, pp.470-484, 2000.
DOI : 10.1007/3-540-45539-6_34

K. Michaelis, C. Meyer, and J. Schwenk, Randomly Failed! The State of Randomness in Current Java Implementations, Topics in Cryptology ? CT-RSA 2013, pp.129-144, 2007.
DOI : 10.1007/978-3-642-36095-4_9

S. Micali and L. Reyzin, Physically Observable Cryptography, TCC 2004: 1st Theory of Cryptography Conference, pp.278-296, 2004.
DOI : 10.1007/978-3-540-24638-1_16

Q. Phong, I. Nguyen, and . Shparlinski, The insecurity of the digital signature algorithm with partially known nonces, Journal of Cryptology, vol.15, issue.3 5, pp.151-176, 2002.

N. Nisan and D. Zuckerman, More deterministic simulation in logspace, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.235-244, 1993.
DOI : 10.1145/167088.167162

E. Prouff and M. Rivain, Masking against Side-Channel Attacks: A Formal Security Proof, Advances in Cryptology ? EURO- CRYPT 2013, pp.142-159, 2013.
DOI : 10.1007/978-3-642-38348-9_9

R. Shaltiel, RECENT DEVELOPMENTS IN EXPLICIT CONSTRUCTIONS OF EXTRACTORS, Bulletin of the EATCS, vol.77, pp.67-95, 2002.
DOI : 10.1142/9789812562494_0013

V. Shoup, A computational introduction to number theory and algebra, p.16, 2006.

[. Standaert, O. Pereira, and Y. Yu, Leakage-Resilient Symmetric Cryptography under Empirically Verifiable Assumptions, Advances in Cryptology ? CRYPTO 2013, Part I, pp.335-352, 2013.
DOI : 10.1007/978-3-642-40041-4_19

[. Santha and U. V. Vazirani, Generating quasi-random sequences from slightly-random sources (extended abstract), 25th Annual Symposium on Foundations of Computer Science, pp.434-440, 1984.

A. Sahai and S. P. Vadhan, A complete problem for statistical zero knowledge, Journal of the ACM, vol.50, issue.2, pp.196-249, 2003.
DOI : 10.1145/636865.636868

L. Trevisan and S. P. Vadhan, Extracting randomness from samplable distributions, Proceedings 41st Annual Symposium on Foundations of Computer Science, pp.32-42, 2000.
DOI : 10.1109/SFCS.2000.892063

S. Vadhan, Pseudorandomness, draft survey monograph, p.20, 2012.

N. Veen, L. Dutt-sharma, H. Cavallaro, and . Bos, Memory errors: The past, the present, and the future, Proceedings of the 15th International Conference on Research in Attacks, Intrusions, and Defenses, pp.86-106, 2012.

N. Veyrat-charvillon, B. Gérard, F. Standaert, and R. O. , Soft Analytical Side-Channel Attacks, Palash Sarkar and Tetsu Iwata, pp.282-296, 2014.
DOI : 10.1007/978-3-662-45611-8_15
URL : https://hal.archives-ouvertes.fr/hal-01096218

J. Von-neumann, 13. various techniques used in connection with random digits, p.13, 1951.

Y. Yu and F. Standaert, Practical Leakage-Resilient Pseudorandom Objects with Minimum Public Randomness, Topics in Cryptology ? CT-RSA 2013, pp.223-238, 2013.
DOI : 10.1007/978-3-642-36095-4_15

Y. Yu, F. Standaert, O. Pereira, and M. Yung, Practical leakage-resilient pseudorandom generators, Proceedings of the 17th ACM conference on Computer and communications security, CCS '10, pp.141-151, 2010.
DOI : 10.1145/1866307.1866324