An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic

Kenichiro Hayasaka,Tsuyoshi Takagi

doi:10.1007/978-3-642-20901-7_11

Kenichiro Hayasaka, Tsuyoshi Takagi

https://doi.org/10.1007/978-3-642-20901-7_11

Copy DOI

Export

Save

Cite

Publication Date: Jan 1, 2011

Citations: 3

Affiliation: Kyushu University

Abstract
Full-Text
Similar Papers

Abstract

Listen

AbstractThe security of the digital signature algorithm (DSA) and Diffie-Hellman key exchange is based on the difficulty of the discrete logarithm problems (DLP) over prime field GF(p), and thus it is important to evaluate the difficulty of the DLP over GF(p) for discussing the security of these protocols. The number field sieve (NFS) is asymptotically the fastest algorithm to solve the DLP over GF(p). NFS was first proposed by Gordon and then it was improved by Schirokauer and Joux-Lercier. On the other hand, Schirokauer presented a new variant of NFS, which is particularly efficient for the characteristic p with low weight (p has a signed binary representation of low Hamming weight). In this paper, we implement the NFS proposed by Joux-Lercier and Schirokauer, and then we compare the running time of the NFS using the polynomials by Joux-Lercier and Schirokauer with respect to low weight primes of 100 bits or 110 bits.Keywordsdiscrete logarithmnumber field sievelow Hamming weight

Full Text