On Diffie-Hellman Problems in 3rd Order Shift Register
Summary :
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(p3e) respectively. This result will be useful in constructing new cryptographic primitives based on the hardness of the shift register based Diffie-Hellman problems.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.5 pp.1206-1208
- Publication Date
- 2004/05/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Chik-How TAN, Xun YI, Chee-Kheong SIEW, "On Diffie-Hellman Problems in 3rd Order Shift Register" in IEICE TRANSACTIONS on Fundamentals,
vol. E87-A, no. 5, pp. 1206-1208, May 2004, doi: .
Abstract: 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(p3e) respectively. This result will be useful in constructing new cryptographic primitives based on the hardness of the shift register based Diffie-Hellman problems.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e87-a_5_1206/_p
Copy
@ARTICLE{e87-a_5_1206,
author={Chik-How TAN, Xun YI, Chee-Kheong SIEW, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On Diffie-Hellman Problems in 3rd Order Shift Register},
year={2004},
volume={E87-A},
number={5},
pages={1206-1208},
abstract={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(p3e) respectively. This result will be useful in constructing new cryptographic primitives based on the hardness of the shift register based Diffie-Hellman problems.},
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - On Diffie-Hellman Problems in 3rd Order Shift Register
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1206
EP - 1208
AU - Chik-How TAN
AU - Xun YI
AU - Chee-Kheong SIEW
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2004
AB - 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(p3e) respectively. This result will be useful in constructing new cryptographic primitives based on the hardness of the shift register based Diffie-Hellman problems.
ER -
English
