Comment by ignoramous
1 day ago
Sounds like 3 more iterations on K3/Fable, and we'll able to ask it to break computational hardness assumptions like DLP?
1 day ago
Sounds like 3 more iterations on K3/Fable, and we'll able to ask it to break computational hardness assumptions like DLP?
Possibly, but coming up with algorithms is difficult!
And people have been searching for faster DLP algorithms for 50 years