On the n-th Order Shift Register Based Discrete Logarithm
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we examine the basic properties of n-th order linear feedback shift registers and show that n-th order shift registers based discrete logarithm problem is equivalent to discrete logarithm problem. This shows that the algebraic structure of n-th order linear feedback shift registers is useful in constructing cryptographic primitives.
- 社団法人電子情報通信学会の論文
- 2003-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)