Frontiers of Electrical and Electronic Engineering >

2006 , Vol. 1 >Issue 3: 287 - 290

DOI: https://doi.org/10.1007/s11460-006-0039-7

Further research on public-key cryptosystems based on third-order recurrence sequence

Expand
  • 1.National Key laboratory of Integrated service Networks, Xidian University, Xi′an 710071, China; Present address: School of Computer Science, Beihang University, Beijing 100083, China; 2.National Key Laboratory of Integrated Service Networks, Xidian University, Xi′an 710071, China; 3.Vocational College of Qingdao University, Qingdao 266101, China

Published date: 05 Sep 2006

Fold

Abstract

Properties of third-order recurrence sequences were investigated and a new variant of the GH public-key cryptosystem, which was further improved to be a probabilistic public-key cryptosystem, was proposed. Then security analysis of the proposed scheme was provided and it was proved that the one-wayness of the proposed scheme is equivalent to partial discrete logarithm and its semantic security is equivalent to decisional Diffie-Hellman problem in ring extension. Finally, efficiency analysis of the proposed scheme was provided, and that these two encryption schemes need to transfer 2log N and 4log N bits data respectively.

Cite this article

JIANG Zheng-tao, SUN Xi, WANG Yu-min, TIAN Lei . Further research on public-key cryptosystems based on third-order recurrence sequence[J]. Frontiers of Electrical and Electronic Engineering, 2006 , 1(3) : 287 -290 . DOI: 10.1007/s11460-006-0039-7

Options
Outlines

/

〈 〉