X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/canny.git/blobdiff_plain/f30c909e10a0d758bd045352bc1163b1e4efed16..165a29713fcc3fb0e7bdbf25129fc1e33d14667c:/ourapproach.tex

diff --git a/ourapproach.tex b/ourapproach.tex
index 0bfe489..25defad 100644
--- a/ourapproach.tex
+++ b/ourapproach.tex
@@ -118,12 +118,14 @@ that is based on the Blum Blum Shub~\cite{DBLP:conf/crypto/ShubBB82} pseudorando
 for security reasons.
 It has been indeed proven~\cite{DBLP:conf/crypto/ShubBB82} that this PRNG 
 has the cryptographically security property, \textit{i.e.}, 
-for any sequence $L$ of output bits $x_i$, $x_{i+1}$, \ldots, $x_{i+L-1}$,
+for any sequence of $L$ output bits $x_i$, $x_{i+1}$, \ldots, $x_{i+L-1}$,
 there is no algorithm, whose time complexity is polynomial  in $L$, and 
 which allows to find $x_{i-1}$ and $x_{i+L}$ with a probability greater
 than $1/2$.
-Thus, even if the encrypted message would be extracted, 
-it would thus be not possible to retrieve the original one in a 
+Equivalent formulations of such a property can
+be found. They all lead to the fact that,
+even if the encrypted message is extracted, 
+it is impossible to retrieve the original one in 
 polynomial time.