Relecture de l'intro, toujours, encore, ya que ça de vrai !!!

[canny.git] / ourapproach.tex

diff --git a/ourapproach.tex b/ourapproach.tex
index 0bfe48993d9d192c6c7e8ad6a9a19d07f67e6352..25defad4262510b00d4bd96417172e37e9dcb3ec 100644 (file)
--- 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 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$.
 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.   
 
 
 polynomial time.