Pavol Zajac

Discrete Logarithms and Degree Six Number Field Sieve

A practical approach

• Broschiertes Buch

Produktbeschreibung

The asymptotically fastest algorithm to solve the
Discrete Logarithm Problem in finite fields is the
Number Field Sieve (NFS). This work presents a
summary of the Number Field Sieve and its practical
experimental implementation to solve the discrete
logarithm problem in finite fields of degree six.
This particular problem arises e.g. when one tries to
solve DLP in XTR cryptosystem. As shown, the degree
six instance of the DLP is practically more difficult
to solve with NFS as a classical DLP.

Also contained in this book are some specific remarks
to the related topic of the polynomial selection for
the NFS. A three dimensional adaptation of the line
sieving algorithm is described as well as the
parametrization choices for the sieve region,
contribution of small primes and exclusion of higher
degree ideals.

Although the results of this work are related to the
specific instance of NFS, they can influence also the
mainstream NFS applications (the factoring of
integers or the classical DLP).

Produktdetails

• Verlag: VDM Verlag Dr. Müller
• Seitenzahl: 112
• Englisch
• Abmessung: 220mm x 150mm x 6mm
• Gewicht: 165g
• ISBN-13: 9783639123319
• ISBN-10: 363912331X
• Artikelnr.: 26010355

Autorenporträt

Author is currently a cryptology researcher at the Faculty of
Electrical Engineering and Information Technology, Slovak
University of Technology, Bratislava. His main research areas are
the discrete logarithm problem based cryptosystems, and the
design of ciphers (both modern and classical).