An experiment of number field sieve over GF(p) of low hamming weight characteristic

Kenichiro Hayasaka, Tsuyoshi Takagi

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

3 被引用数 (Scopus)

抄録

The 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.

本文言語英語
ホスト出版物のタイトルCoding and Cryptology - Third International Workshop, IWCC 2011, Proceedings
ページ191-200
ページ数10
DOI
出版ステータス出版済み - 2011
イベント3rd International Workshop on Coding and Cryptology, IWCC 2011 - Qingdao, 中国
継続期間: 5 30 20116 3 2011

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
6639 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他3rd International Workshop on Coding and Cryptology, IWCC 2011
国/地域中国
CityQingdao
Period5/30/116/3/11

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「An experiment of number field sieve over GF(p) of low hamming weight characteristic」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル