From 4bd9fddadb1701bacb7a635589d6ab2590557b4d Mon Sep 17 00:00:00 2001 From: Fabrice Mouhartem Date: Thu, 8 Feb 2018 19:12:15 +0100 Subject: [PATCH] Minor changes --- sec-pairings.tex | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/sec-pairings.tex b/sec-pairings.tex index 8704722..2f00c6e 100644 --- a/sec-pairings.tex +++ b/sec-pairings.tex @@ -22,8 +22,8 @@ In the following, we rely on the black-box definition of cryptographic pairings For cryptographic purpose, pairings are usually defined over elliptic curves, hence $\GT$ is a multiplicative subgroup of the multiplicative group of a finite field. -Most standard assumptions over pairings are derived from the equivalent of the Diffie-Hellman assumptions from cyclic groups, -defined in Definition~\ref{de:DDH} and recalled here. +The most standard assumptions over pairings are derived from the equivalent of the Diffie-Hellman assumptions from cyclic groups, +described in Definition~\ref{de:DDH} and recalled here. \begin{definition}[$\DDH$ (recall)] \index{Discrete Logarithm!Decisional Diffie-Hellman} Let $\GG$ be a cyclic group of order $p$. The \emph{decisional Diffie-Hellman} ($\DDH$) problem is the following.