mirror of https://github.com/zcash/zips.git
Correct a reference.
Signed-off-by: Daira Hopwood <daira@jacaranda.org>
This commit is contained in:
parent
11163742b7
commit
4035e4c5e0
|
@ -5438,7 +5438,7 @@ $\PedersenHash$ is an algebraic \hashFunction with \collisionResistance
|
|||
Discrete Logarithm Problem on the \jubjubCurve.
|
||||
It is based on the work of David Chaum, Ivan Damgård, Jeroen van de Graaf,
|
||||
Jurjen Bos, George Purdy, Eugène van Heijst and Birgit Pfitzmann in
|
||||
\cite{CDG1987}, \cite{BCP1988} and \cite{CvHP1991},
|
||||
\cite{CDvdG1987}, \cite{BCP1988} and \cite{CvHP1991},
|
||||
and of Mihir Bellare, Oded Goldreich, and Shafi Goldwasser in \cite{BGG1995},
|
||||
with optimizations for efficient instantiation in \zkSNARKCircuits
|
||||
by Sean Bowe and Daira Hopwood.
|
||||
|
@ -5588,7 +5588,7 @@ A mixing \xPedersenHash is used to compute $\NoteAddressRand$ from
|
|||
$\cm$ and $\NotePosition$ in \crossref{commitmentsandnullifiers}. It takes as
|
||||
input a \xPedersenCommitment $P$, and hashes it with another input $x$.
|
||||
|
||||
Let $\NotePositionBase = \FindGroupJHashOf{\ascii{Zcash\_J\_}, \ascii{}}$.
|
||||
Define $\NotePositionBase := \FindGroupJHashOf{\ascii{Zcash\_J\_}, \ascii{}}$.
|
||||
|
||||
We define $\MixingPedersenHash \typecolon \GroupJ \times \range{0}{\ParamJ{r}-1}
|
||||
\rightarrow \GroupJ$ by:
|
||||
|
|
Loading…
Reference in New Issue