nadim/appliedcryptography
SHA256
1
Fork 0
Code Wiki Activity

Website: greatly improved materials viewing experience

Browse source
This commit is contained in:
Nadim Kobeissi 2025-06-26 13:13:47 +02:00
parent 4b6498ede3
commit d5a06032b0
Signed by: nadim
SSH key fingerprint: SHA256:o0JJHYcP8LVBoARMU+JjVbzJxL3HxW2F+C0yu/5zPgc
406 changed files with 159269 additions and 184 deletions
Download patch file Download diff file Expand all files Collapse all files

6
slides/1-6.tex
View file

@ -541,7 +541,7 @@
\begin{columns}[c]
\begin{column}{1\textwidth}
\begin{itemize}[<+->]
\item In 2017, Google and CWI Amsterdam researchers demonstrated the first practical collision for SHA-1.\footnote{\url{https://appliedcryptography.page/papers/shattered-sha1.pdf}}
\item In 2017, Google and CWI Amsterdam researchers demonstrated the first practical collision for SHA-1.\footnote{\url{https://appliedcryptography.page/papers/\#shattered-sha1}}
\item Created two different PDF files with identical SHA-1 hashes.
\item Required about 6,500 CPU years and 110 GPU years of computation.
\item Cost estimate: approximately \$110,000 using cloud computing.
@ -907,7 +907,7 @@
\item Using less memory makes computation exponentially slower.
\end{itemize}
\item Even with custom hardware, attackers face similar costs to defenders.
\item Proven to be maximally memory-hard!\footnote{\url{https://appliedcryptography.page/papers/scrypt-memory.pdf}}
\item Proven to be maximally memory-hard!\footnote{\url{https://appliedcryptography.page/papers/\#scrypt-memory}}
\end{itemize}
\end{column}
\end{columns}
@ -1045,7 +1045,7 @@
\begin{itemize}
\item Researchers have constructed schemes that are:
\item Provably secure in the RO model, but,
\item Provably insecure with any real hash function.\footnote{\url{https://appliedcryptography.page/papers/rom-methodology.pdf}}
\item Provably insecure with any real hash function.\footnote{\url{https://appliedcryptography.page/papers/\#rom-methodology}}
\end{itemize}
\end{itemize}
\end{column}