Commit c783a010 authored by Giovanni's avatar Giovanni 🖥

de1 2020 ecdh writeup fix grammar

parent 923832bf
Pipeline #142335788 passed with stages
in 31 seconds
......@@ -287,7 +287,8 @@ discrete logarithm problem and is very hard to compute in polynomial time.
I found [this paper](https://wstein.org/edu/2010/414/projects/novotney.pdf)
which describe various attacks on ECC, the one I was interested
in is the Smart's attack which is possible when \\(\#E(F_q) = q\\).
in is the Smart's attack which is possible when the order of the curve is equal
to \\(q\\).
We can test this in sage:
......@@ -379,7 +380,7 @@ cases (7).
If we now submit this point in the `Exchange` to the server and then we retrieve
the key it's trivial to find the secret?
Well no. What we will found is not the secret because the secret is between \\(\{0, q\}\\)
Well no. What we will found is not the secret because the secret is between \\((0, q)\\)
and is presumably around 250/255 bits long and not between 0 and 7.
What we can do is to try retrieving various pair `(dlog, prime)` and create a
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment