Trance-0/NoteNextra-origin
1
0
Fork 0
Code Issues Pull Requests Actions 1 Packages Projects Releases Wiki Activity

Fix typo

Browse Source 
Fix typos introduces more
This commit is contained in:
Zheyuan Wu
2024-12-03 11:20:59 -06:00
parent cbed1333ed
commit 9283c6b427
21 changed files with 213 additions and 44 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
pages/CSE442T/CSE442T_L12.md
View File

@@ -82,7 +82,7 @@ The NBT(Next bit test) is complete.
If $\{X_n\}$ on $\{0,1\}^{l(n)}$ passes NBT, then it's pseudorandom.
Idea of proof: full proof is on the text.
Ideas of proof: full proof is on the text.
Our idea is that we want to create $H^{l(n)}_n=\{X_n\}$ and $H^0_n=\{U_{l(n)}\}$
@@ -137,7 +137,7 @@ The other part of proof will be your homework, damn.
If one-way function exists, then Pseudorandom Generator exists.
Idea of proof:
Ideas of proof:
Let $f:\{0,1\}^n\to \{0,1\}^n$ be a strong one-way permutation (bijection).