Commit 174acf27 authored by Stephane Glondu's avatar Stephane Glondu Committed by Stéphane Glondu


parent 097424e7
......@@ -108,7 +108,7 @@ mix homomorphic and non homomorphic questions.
% and slightly less privacy
{\it Group parameters}
{\it Group parameters.}
The cryptography involved in Belenios needs a cyclic group $\G$ where
discrete logarithms are hard to compute. We will denote by $g$ a
generator and $q$ its order. We use a multiplicative notation for the
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment