|Bill Allombert on Sun, 15 Sep 2013 21:36:53 +0200|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
|Coppersmith discrete log algorithm for p<=5|
Dear PARI developers, I have commited a patch that improves fflog: 1) It implements Coppersmith algorithm for p<=5 2) It fixes a lot of issue with the previous implementation with larger p. For example it did not work for GF(37^23). Cheers, Bill. PS: I remind you of testing http://pari.math.u-bordeaux.fr/pub/pari/snapshots/pari-2.5.5-pre1.tar.gz which is scheduled to be released on Friday. Thanks in advance!