From: Pierre-Cyrille Heam Date: Thu, 6 Sep 2012 08:54:55 +0000 (+0200) Subject: pch ajout contrib dans intro X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/prng_gpu.git/commitdiff_plain/a12a11a39f112c043de69e8694f29b32b8c7dbc5?ds=inline pch ajout contrib dans intro --- diff --git a/prng_gpu.tex b/prng_gpu.tex index ce0bcc5..a32d94a 100644 --- a/prng_gpu.tex +++ b/prng_gpu.tex @@ -169,6 +169,25 @@ property. Last, but not least, we propose a rewriting of the Blum-Goldwasser asymmetric 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 +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 +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 +as we know, it is the first cryptographically secured PRNG proposed on GPU. +Note too that an original qualitative comparison between topological chaotic +properties and statistical test is also proposed. +} + + + The remainder of this paper is organized as follows. In Section~\ref{section:related works} we review some GPU implementations of PRNGs. Section~\ref{section:BASIC RECALLS} gives some basic recalls on the well-known Devaney's formulation of chaos,