Update

chap-structures.tex

@@ -14,7 +14,7 @@ An example is the multiplicative homomorphism of the ElGamal cryptosystem which
 %Then, the cyclic group structure of $\GG$ leads to the ability to compute a valid ciphertext for $M \cdot M'$ given ciphertexts $(c_1^{}, c_2^{})$ and $(c'_1, c'_2)$ of $M$ and $M'_{}$ respectively.
 %The resulting ciphertext is $(c_1^{} \cdot c'_1, c_2^{} \cdot c'_2) = (g^{r \cdot r'_{}}, M \cdot M' \cdot h^{r \cdot r'_{}})$
 
-In this chapter, we describe the different structures on which the cryptography primitives we design in this thesis are based on, namely bilinear groups and lattices.
+In this chapter, we describe the different structures on which the cryptography primitives we design in this thesis are based on, namely bilinear groups and lattices, as well as related hardness assumptions.
 
 \section{Pairing-Based Cryptography}
 \addcontentsline{tof}{section}{\protect\numberline{\thesection} Cryptographie à base de couplage}