By Topic

A Chaos Public-Key Cryptosystem Based on Semi-Group Features

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bi Dayuan ; Dept. of Aeronaut. & Electron. Eng., First Insititute of Air Force, Xinyang, China ; Wang Dahu

Recently, it is a research hot spot to apply some chaos map in cryptosystem. Several chaos public-key cryptosystems are proposed, but proven as insecure or inpractical. By analysising the characteristics of Chebyshev polynomials, a public-key cryptosystem has been proposed in the paper. Firstly, the feature of semi group of Chebyshev polynomials is given, modular computation is introduced and the definitive range of Chebyshev polynomials is extended from [-1,1] to real field. Secondly, a new one-way dropdoor function ,which is based on extended Chebyshev polynonials, is established. Then,we propose the correspondent public-key cryptosystem. In the end, it is proven that our algorithms are practical and feasible.

Published in:

Biomedical Engineering and Informatics, 2009. BMEI '09. 2nd International Conference on

Date of Conference:

17-19 Oct. 2009