Repouetpouet de l'intro

diff --git a/intro.tex b/intro.tex
index 17a618a7a892c86087e3cbea62bb410f09d02a02..7fef20194f148f9eb7f1a96dfe19ab93a84d39f5 100644 (file)
--- a/intro.tex
+++ b/intro.tex
@@ -100,13 +100,15 @@ This is why we add to our scheme a reasonable
 message encryption stage, to be certain that,
 even in the worst case scenario, the attacker
 will not be able to obtain the message content.
 message encryption stage, to be certain that,
 even in the worst case scenario, the attacker
 will not be able to obtain the message content.

-
-
-In this research work, we thus propose to combine tried and 
-tested techniques of signal theory (the adaptive edge detection), coding (the binary embedding), and cryptography 
-(encryption of the hidden message) to compute an efficient steganographic
-scheme, which takes into consideration the cover image 
-and that can be executed on small devices.  
+Doing so makes our steganographic protocol an asymetric one.
+
+To sum up, in this research work, well studied and experimented
+techniques of signal treatment (adaptive edge detection), 
+coding theory (binary embedding), and cryptography 
+(Blum-Goldwasser encryption protocol) are combined 
+to compute an efficient steganographic
+scheme, whose principal characteristics is to take into 
+consideration the cover image and to be compatible with small computation resources.  

 
 The remainder of this document is organized as follows. 
 Section~\ref{sec:ourapproach} presents the details of our steganographic scheme.
 
 The remainder of this document is organized as follows. 
 Section~\ref{sec:ourapproach} presents the details of our steganographic scheme.