A Note on the Relationships among Certified Discrete Log Cryptosystems

Eikoh Chida, Toshiya Itoh, Hiroki Shizuya

    研究成果: Article査読

    1 被引用数 (Scopus)

    抄録

    The certified discrete logarithm problem modulo p prime is a discrete logarithm problem under the conditions that the complete factorization of p-1 is given and by which the base g is certified to be a primitive root mod p. For the cryptosystems based on the intractability of certified discrete logarithm problem, Sakurai-Shizuya showed that breaking the Diffie-Hellman key exchange scheme reduces to breaking the Shamir 3-pass key transmission scheme with respect to the expected polynomial-time Turing reducibility. In this paper, we show that we can remove randomness from the reduction above, and replace the reducibility with the polynomial-time many-one. Since the converse reduction is known to hold with respect to the polynomial-time many-one reducibility, our result gives a stronger evidence for that the two schemes are completely equivalent as certified discrete log cryptosystems.

    本文言語English
    ページ(範囲)1198-1202
    ページ数5
    ジャーナルIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    E86-A
    5
    出版ステータスPublished - 2003 5

    ASJC Scopus subject areas

    • 信号処理
    • コンピュータ グラフィックスおよびコンピュータ支援設計
    • 電子工学および電気工学
    • 応用数学

    フィンガープリント

    「A Note on the Relationships among Certified Discrete Log Cryptosystems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル