andr3/ComputerSecurity
Archived
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases 2 Wiki Activity

fix spelling
All checks were successful
continuous-integration/drone/push Build is passing
Details

Browse Source
This commit is contained in:
Andre Henriques 2023-11-07 21:48:43 +00:00
parent 816eab7635
commit 846f869ef1
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
cw/cw.tex
View File

@ -240,7 +240,7 @@
If the discrite logarithm problem is easy to solve then Elgamal is also easy to solve. While for this case the being able to solve the discrite logarithm problem does not help an attacker with breaking the algorithm because the attacker only knows the result of the exponenciation and does not know the value of the base which is publicly known with Elgamal. If the discrite logarithm problem is easy to solve then Elgamal is also easy to solve. While for this case the being able to solve the discrite logarithm problem does not help an attacker with breaking the algorithm because the attacker only knows the result of the exponenciation and does not know the value of the base which is publicly known with Elgamal.
The Diffle-Hellman problem also does not apply since that problem rellies on. if we know $g^x$ and $g^y$ being able to figure out $g^{xy}$ but on this case the problem is slightly different. Is being able to figure out $(g^x)^y$. The Diffle-Hellman problem also does not apply since that problem rellies on. if we know $g^x$ and $g^y$ being able to figure out $g^{xy}$ but on this case the problem is slightly different. Is being able to figure out $(g^x)^y$.
Therefore this problem does not depend on the discrite logarithm problem Therefore this crypto system can no be broken by being able to break the discrete logarithm problem
\section*{7} \section*{7}
\subsection*{7.1} \subsection*{7.1}