From: guyeux Date: Fri, 15 Jun 2012 07:44:52 +0000 (+0200) Subject: dfjlskdjfl X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/prng_gpu.git/commitdiff_plain/8f1af7e18d4d59611a7b16178ac5f32cfe541056?ds=inline dfjlskdjfl --- diff --git a/prng_gpu.tex b/prng_gpu.tex index 966dbaa..c5fbd5d 100644 --- a/prng_gpu.tex +++ b/prng_gpu.tex @@ -13,6 +13,9 @@ \usepackage[standard]{ntheorem} \usepackage{algorithmic} \usepackage{slashbox} +\usepackage{ctable} +\usepackage{tabularx} +\usepackage{multirow} % Pour mathds : les ensembles IR, IN, etc. \usepackage{dsfont} @@ -1007,6 +1010,53 @@ a^1 & \text{if}~ z^{n-1} = 0 .\end{array} \right. \end{array}\end{equation} +\begin{table} +\renewcommand{\arraystretch}{1.3} +\caption{TestU01 Statistical Test} +\label{TestU011} +\centering + \begin{tabular}{lccccc} + \toprule +Test name &Tests& Logistic & XORshift & ISAAC\\ +Rabbit & 38 &21 &14 &0 \\ +Alphabit & 17 &16 &9 &0 \\ +Pseudo DieHARD &126 &0 &2 &0 \\ +FIPS\_140\_2 &16 &0 &0 &0 \\ +SmallCrush &15 &4 &5 &0 \\ +Crush &144 &95 &57 &0 \\ +Big Crush &160 &125 &55 &0 \\ \hline +Failures & &261 &146 &0 \\ +\bottomrule + \end{tabular} +\end{table} + + + +\begin{table} +\renewcommand{\arraystretch}{1.3} +\caption{TestU01 Statistical Test for Old CI algorithms ($\mathsf{N}=4$)} +\label{TestU01 for Old CI} +\centering + \begin{tabular}{lcccc} + \toprule +\multirow{3}*{Test name} & \multicolumn{4}{c}{Old CI}\\ +&Logistic& XORshift& ISAAC&ISAAC \\ +&+& +& + & + \\ +&Logistic& XORshift& XORshift&ISAAC \\ \cmidrule(r){2-5} +Rabbit &7 &2 &0 &0 \\ +Alphabit & 3 &0 &0 &0 \\ +DieHARD &0 &0 &0 &0 \\ +FIPS\_140\_2 &0 &0 &0 &0 \\ +SmallCrush &2 &0 &0 &0 \\ +Crush &47 &4 &0 &0 \\ +Big Crush &79 &3 &0 &0 \\ \hline +Failures &138 &9 &0 &0 \\ +\bottomrule + \end{tabular} +\end{table} + + + \subsection{Statistical tests} @@ -1106,6 +1156,13 @@ Threshold value $m$& 19 & 7 & 2& 1 & 11& 9& 3& 4\\ \hline\hline \end{tabular} \end{table*} +Finally, the TestU01 battery as been launched on three well-known generators +(a logistic map, a simple XORshift, and the cryptographically secure ISAAC, +see Table~\ref{TestU011}). These results can be compared with +Table~\ref{TestU01 for Old CI}, which gives the scores obtained by the +Old CI PRNG that has received these generators. + + Next subsection gives a concrete implementation of this Xor CI PRNG, which will new be simply called CIPRNG, or ``the proposed PRNG'', if this statement does not raise ambiguity.