An adaptation of the Number Field Sieve (NFS) algorithm to solvea discrete logarithm problem in degree 6 finite fields (DLP6) requiresa modified sieving procedure to find smooth elements of the threedimensional sieve space. In our successful solution [12] we have useda modified line sieving to process a box-shaped region using a largefactor base. In this contribution, we compare the results with analternative approach based on lattice sieving, which was used in mostof the classical factorization and DL record solutions. Results indicatethat this approach does not work well in the 3D-case, making DLP6more difficult in practice than a comparable classical DLP cases.
@article{59, title = {On the use of the lattice sieve in the 3D NFS}, journal = {Tatra Mountains Mathematical Publications}, volume = {45}, year = {2010}, doi = {10.2478/tatra.v45i0.59}, language = {EN}, url = {http://dml.mathdoc.fr/item/59} }
Zajac, Pavol. On the use of the lattice sieve in the 3D NFS. Tatra Mountains Mathematical Publications, Tome 45 (2010) . doi : 10.2478/tatra.v45i0.59. http://gdmltest.u-ga.fr/item/59/