Quantifying Studies of (Pseudo) Random Number Generation for Cryptography. (Quantifications de la génération de nombres pseudo-aléatoires en cryptographie)
نویسنده
چکیده
Acknowledgement It would not have been possible to finish this PhD thesis without the help of many people. First, I would like to thank Prof. Peter Hellekalek for introducing me to the very rich topic of cryptography. Next, I express my gratitude towards Nicolas Sendrier for being my supervisor during my PhD at Inria Paris-Rocquencourt. He gave me an interesting topic to start, encouraged me to extend my research to the subject of stream ciphers and supported me in all my decisions. A special thanks also to Cédric Lauradoux who pushed me when it was necessary. I'm very grateful to Anne Canteaut, which had always an open ear for my questions about stream ciphers or any other topic. The valuable discussions with Philippe Flajolet about the analysis of random functions are greatly appreciated. Especially, I want to express my gratitude towards my two reviewers, Thierry Berger and Andrew Klapper, which gave me precious comments and remarks. I'm grateful to Kaisa Nyberg for joining my jury and for receiving me next year in Helsinki. I'm thankful to Philippe Jacquet for assisting in my jury. Especially, I own a lot to my parents Heinz and Elisabeth Röck and my sister Susanne Röck. They always supported me in my studies, my goings abroad, and any of my decisions. Without them, I would not be here. Also, I do not know what I would have done without the support of Yann. Every time when I was frustrated, desperate or just tired, he cheered me up and encouraged me to go on. I spend four great years at the project SECRET (formerly known as project CODES). A special thanks to all the people with which I could share the " buró uno " , the best office of the world, just beside the coffee table: Cédric, Maria, Mathieu (which we adopt), Matthieu and Yann. I must not forget to mention Christelle. She is the soul of the project, the best secretary, and a very good friend of mine. Thank you. There are many people which passed at Inria and which contribute to the good atmosphere and the discussion at the coffee table. I will mention them in alphabetic order and I hope that I do not forget anyone. I'm grateful to all of them. Once again I want to thank all the people that helped and supported me during my i PhD. It is due …
منابع مشابه
Analyse des suites aléatoires engendrées par des automates cellulaires et applications à la cryptographie
On s'intéresse aux interactions entre la cryptologie et les automates cellulaires. Il a ´ eté montré récemment qu'il n'existe pas de r` eglé elémentaire d'automate cellulaire non-linéaire robustè a la corrélation. Ce résultat limite fortement l'usage d'automates cellulaires pour la construction de suites pseudo-aléatoires servant de clés utilisables en cryptographiè a clé secrète. De plus, pour...
متن کاملDependence of two simulated numbers generated by congruences
When we consider a congruence T (x) ≡ ax modulo m as a pseudo random number generator, there are several means of ensuring the independence of two successive numbers. In this report, we show that this dependence depends on the continued fraction expansion of m/a. We deduce that the congruences such that m and a are two successive elements of Fibonacci sequences are those having the weakest depe...
متن کاملA new generation tree for permutations, preserving the number of fixed points
We describe a new uniform generation tree for permutations with the specific property that, for most permutations, all of their descendants in the generation tree have the same number of fixed points. Our tree is optimal for the number of permutations having this property. We then use this tree to describe a new random generation algorithm for derangements, using an expected n+O(1) calls to a r...
متن کاملSublinear Communication for the Random Generation of Integer Permutations
In [Gustedt (2007)] we have shown that random shuffling of data can be realised with linear resource usage, CPU time as well as communication, and this for a large variaty of paradigms, in particular distributed and out-of-core computation. In this paper we restrict to the case of permutations of the integers [M ] = {1, . . . ,M} and show first show how the communication for a p processor setti...
متن کاملDeterministically broken Periodicity of Linear Congruential Generators using Quasi-Crystals
We describe the design of a family of aperiodic pseudorandom number generator (APRNG). These deterministic generators are based on linear congruential generators (LCGs) and, unlike any other deterministic PRNG, lead to nonperiodic pseudorandom sequences. An APRNG consists of several LCGs whose combination, controlled by a quasicrystal, forms an infinite aperiodic sequence of pseudorandom number...
متن کامل