The general idea of computing discreet logs seems rather doable. Nothing too crazy at least in the work. The part that looked like it will take a little bit more practice is using the Pohlig-Hellman algorithm.
I am also not entirely sure what a precomputation is. I guess its just like extra computations that are done before, but wouldnt that just make it a computation....
And then just to check my understanding, we have the log 4 algorithm to fill in a gap in the pohlig algorithm is that correct?
No comments:
Post a Comment