From 9bc351a3f4add087b29ed019fe4d1a0db25b0aa6 Mon Sep 17 00:00:00 2001 From: cguyeux Date: Wed, 12 Sep 2012 16:14:52 +0200 Subject: [PATCH] =?utf8?q?Derni=C3=A8re=20relecture?= MIME-Version: 1.0 Content-Type: text/plain; charset=utf8 Content-Transfer-Encoding: 8bit --- prng_gpu.tex | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/prng_gpu.tex b/prng_gpu.tex index 2156752..38431e5 100644 --- a/prng_gpu.tex +++ b/prng_gpu.tex @@ -172,12 +172,12 @@ key encryption protocol by using the proposed method. \PCH{ {\bf Main contributions.} In this paper a new PRNG using chaotic iteration -is defined. From a theoretical point of view, it is proved that it has fine +is defined. From a theoretical point of view, it is proven that it has fine topological chaotic properties and that it is cryptographically secured (when the based PRNG is also cryptographically secured). From a practical point of view, experiments point out a very good statistical behavior. Optimized original implementation of this PRNG are also proposed and experimented. -Pseudo-random numbers are generated at a rate of 20GSamples/s which is faster +Pseudorandom numbers are generated at a rate of 20GSamples/s, which is faster than in~\cite{conf/fpga/ThomasHL09,Marsaglia2003} (and with a better statistical behavior). Experiments are also provided using BBS as the based random generator. The generation speed is significantly weaker but, as far @@ -1698,7 +1698,7 @@ PRNG too. \end{proposition} \begin{proof} -The proposition is proved by contraposition. Assume that $X$ is not +The proposition is proven by contraposition. Assume that $X$ is not secure. By Definition, there exists a polynomial time probabilistic algorithm $D$, a positive polynomial $p$, such that for all $k_0$ there exists $N\geq \frac{k_0}{2}$ satisfying -- 2.39.5