GMP used during 3 and a half years to solve MIT's LCS35

Torbjörn Granlund tg at
Wed May 1 07:35:16 UTC 2019

Niall Emmart <nemmart at> writes:

  Maybe the fastest approach would be to use the low level routines to
  do repeated squaring in Montgomery space.

That would speed things up a lot iff the comutations are performed in an
invariant ring (or rings).

Please encrypt, key id 0xC8601622

More information about the gmp-discuss mailing list