[taler-anastasis] branch master updated: related work - PRF and PRG one section

[gnunet]

This is an automated email from the git hooks/post-receive script.

dennis-neufeld pushed a commit to branch master
in repository anastasis.

The following commit(s) were added to refs/heads/master by this push:
     new e7a99c0  related work - PRF and PRG one section
e7a99c0 is described below

commit e7a99c00d4ce32b3b36c2a76b2f45aa8bdbd9fea
Author: Dennis Neufeld <dennis.neufeld@students.bfh.ch>
AuthorDate: Sat Jun 6 09:59:56 2020 +0000

    related work - PRF and PRG one section
---
 doc/thesis/related_work.tex | 10 ++++------
 1 file changed, 4 insertions(+), 6 deletions(-)

diff --git a/doc/thesis/related_work.tex b/doc/thesis/related_work.tex
index 5bde002..f6b74b6 100644
--- a/doc/thesis/related_work.tex
+++ b/doc/thesis/related_work.tex
@@ -2,15 +2,13 @@
 \subsection{Prerequisites}
 This chapter explains some important cryptographic functions and why they are 
useful for Anastasis.
 
-\subsubsection{Pseudo random generator (PRG)}
-A pseudo random generator is an algorithm producing a sequence of bits for 
which there is no efficient algorithm to distinguish it from a truly random 
sequence \cite{vadhan2012}. The algorithm "takes as input a short, perfectly 
random seed" \cite{vadhan2012} which determines the output value.
+\subsubsection{PRG and PRF)}
+A pseudo random generator (PRG) is an algorithm producing an infinite sequence 
of bits for which there is no efficient algorithm to distinguish it from a 
truly random sequence~\cite{vadhan2012}. The algorithm "takes as input a short, 
perfectly random seed"~\cite{vadhan2012} which determines the output value.\\
 
-\subsubsection{Pseudo random function (PRF)}
-A pseudo random function PRF(k, m) takes two arguments, a secret key k and 
some data m, and returns an output that is unpredictable as long the secret key 
k is unknown to an attacker and is a random value \cite{nielsen2002}.\\
-PRFs can be constructed using PRGs.~\cite{GGM1986}
+A pseudo random function (PRF) is a deterministic function which output is 
finite and indistinguishable from a true random function.~\cite{nielsen2002} 
PRFs can be constructed using PRGs.~\cite{GGM1986}
 
 \subsubsection{Hash function}
-Hash functions "compress a string of arbitrary length to a string of fixed 
length [...]" \cite{Preneel1999}. The output of a hash function often is called 
a "hash".  Hash functions in general should be very fast to compute. 
Cryptographic hash functions need to fulfil additional security requirements 
which are called:
+Hash functions "compress a string of arbitrary length to a string of fixed 
length [...]"~\cite{Preneel1999}. The output of a hash function often is called 
a "hash".  Hash functions in general should be very fast to compute. 
Cryptographic hash functions need to fulfil additional security requirements 
which are called:
 \begin{itemize}
        \item pre-image resistance
        \item second pre-image resistance

-- 
To stop receiving notification emails like this one, please contact
gnunet@gnunet.org.