From: qianxue Date: Thu, 15 Sep 2011 14:00:46 +0000 (+0200) Subject: test X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/these_qian.git/commitdiff_plain/086bf4f002258b50d2e82bde94094200b55ba54c?hp=0d5c261823aa37c2c1b507c2e9ee747c686e0f72 test --- diff --git a/Introduction.tex b/Introduction.tex index ac7bfd8..cd2341c 100644 --- a/Introduction.tex +++ b/Introduction.tex @@ -80,7 +80,7 @@ in Chapter 5. The performance of these newly designed PRNG based on chaotic iter In Chapter 6, In prior literature, the iterate function is just the vectorial boolean negation. In this Chapter, we propose a method using Graph with strongly connected components as a selection criterion for chaotic iterate function. -In order to face the challenge of using the proposed chaotic iterate functions in PRNG, these PRNGs are subjected to the above statistical batteries of tests. +In order to face the challenge of using the proposed chaotic iterate functions in PRNG, these PRNGs are subjected to the NIST statistical batteries of tests. In Chapter 7, a potential use of above PRNGs in some Internet security field is presented, namely in information hiding. Such generators can strongly improve the confidence put in any information hiding scheme and in cryptography in general: due to their properties of unpredictability, the possibilities offered to an attacker to achieve his goal are drastically reduced in that context.