nadim/appliedcryptography
SHA256
1
Fork 0
Code Wiki Activity

Minor fixes

Browse source
This commit is contained in:
Nadim Kobeissi 2025-06-27 14:02:40 +02:00
parent 9fb0b4e7d3
commit 2559bf4bf7
Signed by: nadim
SSH key fingerprint: SHA256:Wq6s8he3sp5RAhp1LaLtp6R1p/43SZswtuK9csAuVcM
3 changed files with 5 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

6
slides/1-7.tex
View file

@ -559,7 +559,7 @@
\end{column}
\begin{column}{0.33\textwidth}
\textbf{Sudoku Puzzles}\\
\small Can you fill this 9×9 grid following the rules?
\small Can you fill this 9 \times 9 grid following the rules?
\end{column}
\end{columns}
\vspace{0.5cm}
@ -629,8 +629,8 @@
\begin{itemize}[<+->]
\item \textbf{Games proven NP-hard\footnote{\url{https://appliedcryptography.page/papers/\#nintendo-hard}}}:
\begin{itemize}
\item Super Mario Bros. 1–3, The Lost Levels, Super Mario World
\item Donkey Kong Country 1–3
\item Super Mario Bros. 1-3, The Lost Levels, Super Mario World
\item Donkey Kong Country 1-3
\item All classic Legend of Zelda games
\item All classic Metroid games
\item All classic Pokémon role-playing games

2
slides/2-2.tex
View file

@ -787,7 +787,7 @@
\draw[red, ultra thick] (2*1.2-0.1,1.9) rectangle (3*1.2+1.1,3.1);
\node[red, below] at (5,1.75) {Repeated ``ll'' pattern};
\draw[->, thick, blue] (2.5,1) -- (2.5,1.8);
\node[blue, below] at (2.5,1) {ABSAB: $(l,l,*,l,l)$ occurs 1024× more!};
\node[blue, below] at (2.5,1) {ABSAB: $(l,l,*,l,l)$ occurs 1024\times more!};
\end{tikzpicture}
\end{center}
\item \textbf{Step 3:} After $2^{26}$ samples, frequency analysis reveals:

2
website/index.html
View file

@ -380,7 +380,7 @@
<a href="slides/#1-6" class="topic-slides-btn"><i class="icon ph-duotone ph-projector-screen"></i>Slides</a>
<span class="topic-number">Topic 1.6</span>
<h4 class="topic-title"><i class="icon ph-duotone ph-chalkboard-teacher"></i>Collision-Resistant Hash Functions</h4>
<p class="topic-overview">This topic explores collision-resistant hash functions, cryptographic primitives that convert arbitrary-length inputs to fixed-length outputs while making it computationally infeasible to find colliding inputs. We'll examine three essential properties—collision resistance, preimage resistance, and second preimage resistance—while exploring practical applications in password storage, data integrity verification, and proof-of-work systems. The topic introduces the counterintuitive birthday paradox, demonstrating why collisions can be found after approximately square-root-many attempts rather than brute force. We'll survey hash function evolution from broken algorithms like MD5 and SHA-1 to modern standards like SHA-2, SHA-3, and BLAKE3, while analyzing vulnerabilities including precomputation attacks using rainbow tables and length extension weaknesses in Merkle–Damg&#xE5;rd constructions. The topic covers critical defensive techniques including properly salting hashes and implementing specialized password hashing algorithms like PBKDF2 and memory-hard functions such as Scrypt, which resist hardware acceleration attacks by requiring significant memory resources, providing comprehensive guidance for secure hash function implementation in real-world systems.</p>
<p class="topic-overview">This topic explores collision-resistant hash functions, cryptographic primitives that convert arbitrary-length inputs to fixed-length outputs while making it computationally infeasible to find colliding inputs. We'll examine three essential properties—collision resistance, preimage resistance, and second preimage resistance—while exploring practical applications in password storage, data integrity verification, and proof-of-work systems. The topic introduces the counterintuitive birthday paradox, demonstrating why collisions can be found after approximately square-root-many attempts rather than brute force. We'll survey hash function evolution from broken algorithms like MD5 and SHA-1 to modern standards like SHA-2, SHA-3, and BLAKE3, while analyzing vulnerabilities including precomputation attacks using rainbow tables and length extension weaknesses in Merkle-Damg&#xE5;rd constructions. The topic covers critical defensive techniques including properly salting hashes and implementing specialized password hashing algorithms like PBKDF2 and memory-hard functions such as Scrypt, which resist hardware acceleration attacks by requiring significant memory resources, providing comprehensive guidance for secure hash function implementation in real-world systems.</p>
<div class="topic-readings">
<h5><i class="icon ph-duotone ph-book-open-text"></i>Required Readings</h5>
<ul>