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

update notations and fix typos

Browse Source
This commit is contained in:
Zheyuan Wu
2025-02-25 20:41:35 -06:00
parent 419ea07352
commit 27bff83685
71 changed files with 920 additions and 430 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
pages/CSE442T/CSE442T_L4.md
View File

@@ -98,7 +98,7 @@ Proof:
Then $P[a$ inverting $g]\sim P[a$ inverts $f$ all $q(n)]$ times. $<(1-\frac{1}{p(n)})^{q(n)}=(1-\frac{1}{p(n)})^{np(n)}<(e^{-\frac{1}{p(n)}})^{np(n)}=e^{-n}$ which is negligible function.
EOP
QED
_we can always force the adversary to invert the weak one-way function for polynomial time to reach the property of strong one-way function_