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