Welcome to the resource topic for 2008/064
Title:
Remarks on the NFS complexity
Authors: Pavol Zajac
Abstract:In this contribution we investigate practical issues with implementing the NFS algorithm to solve the DLP arising in XTR-based cryptosystems. We can transform original XTR-DLP to a DLP instance in \mathbb{F}_{p^6}, where p is a medium sized prime. Unfortunately, for practical ranges of p, the optimal degree of NFS polynomial is less than the required degree 6. This leads to a problem to find enough smooth equations during the sieve stage of the NFS algorithm. We discuss several techniques that can increase the NFS output, i.e. the number of equations produced during the sieve, without increasing the smoothness bound.
ePrint: https://eprint.iacr.org/2008/064
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .