1

The cubic sieve is an algorithm is for computing discrete logarithm mostly in prime fields. It’s performance is less than the numner field sieve but it’s faster than the linear sieve.

I do understand in part how to look for relations (not how many of them I should get for a given factor base). But once I have enough relations, how do I perform the linear algebra step that give me the answer about the targeted discrete logarithm ?

user2284570
  • 324
  • 4
  • 19

0 Answers0