Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Remarks on the NFS complexity

In: Tatra Mountains Mathematical Publications, vol. 41, no. 3
Pavol Zajac
Detaily:
Rok, strany: 2008, 76 - 91
O článku:
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}p6$, where $p$ is a medium sized prime. \par Unfortunately, for practical ranges of $p$, the optimal degree of an 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.
Ako citovať:
ISO 690:
Zajac, P. 2008. Remarks on the NFS complexity. In Tatra Mountains Mathematical Publications, vol. 41, no.3, pp. 76-91. 1210-3195.

APA:
Zajac, P. (2008). Remarks on the NFS complexity. Tatra Mountains Mathematical Publications, 41(3), 76-91. 1210-3195.