On Diffie-Hellman Problems in 3rd Order Shift Register(<Special Section>Discrete Mathematics and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, we examine the computational Diffie-Hellman problem and decisional Diffie-Hellman problem in 3-rd order linear feedback shift register and show that the shift register based Diffie-Hellman problems are equivalent to the Diffie-Hellman problems over prime subgroup of GF(p^<3e>) respectively. This result will be useful in constructing new cryptographic primitives based on the hardness of the shift register based Diffie-Hellman problems.

• 社団法人電子情報通信学会の論文
• 2004-05-01

著者

• Yi X

  School Of Computer Sci. And Mathematics Victoria Aus

• Yi Xun

  School Of Computing National University Of Singapore

• Yi Xun

  School Of Computer Science And Mathematics

• Siew Chee-kheong

  School Of Electrical & Electronic Engineering Nanyang Technological University

• TAN Chik-How

  School of Electrical & Electronic Engineering, Nanyang Technological University

• Tan C‐h

  Nanyang Technological Univ. Singapore

関連論文

• On Diffie-Hellman Problems in 3rd Order Shift Register(Discrete Mathematics and Its Applications)
• A New Provably Secure Signature Scheme(Information Security)(Information Theory and Its Applications)
• On the n-th Order Shift Register Based Discrete Logarithm
• New Signature Schemes Based on 3rd Order Shift Registers(Special Section on Cryptography and Information Security)
• Secure Agent-Mediated Mobile Payment
• Security of Kuwakado-Tanaka Transitive Signature Scheme for Directed Trees(Information Security)
• Key Substitution Attacks on Some Provably Secure Signature Schemes (Cryptography and Information Security)

スポンサーリンク