Cart (Loading....) | Create Account
Close category search window

Analysis of Some Recently Proposed Chaos-based Public Key Encryption Algorithms

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

3 Author(s)
Geng Zhao ; Dept. of Comput. Sci. & Technol., Beijing Electr. Sci. & Technol. Inst. ; Jianxin Wang ; Fangfang Lu

In this paper, the three recent public key encryption algorithms based on chaos are analyzed. The analysis shows that one of these algorithms is unsafe in protocol. Another is actually reformulation of the standard RSA algorithm, but its encryption and decryption rates and capacity of memory are not comparable to those of RSA algorithm. The third one is vulnerable to exhaustive or digital analytic attacks

Published in:

Communications, Circuits and Systems Proceedings, 2006 International Conference on  (Volume:3 )

Date of Conference:

25-28 June 2006

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.