X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/prng_gpu.git/blobdiff_plain/5ccd7174adc0881aa861c67d36462da62a3cb158..0be2ff183726ec026c763c2d0f9b4d3a326360fd:/prng_gpu.tex?ds=sidebyside

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