Paper Title:
On Public-Key Encryption Scheme Based on Chebyshev Maps
  Abstract

Due to the exceptionally desirable properties, Chebyshev polynomials have been recently proposed for designing public key cryptosystems. However, some proposed schemes were pointed out to be insecure and unpractical. In this paper, we analyze their defects, discretize the Chebyshev maps, generalize properties of Chebyshev polynomials and design an improved scheme. Theoretical analysis shows that it possesses higher security than RSA and experimental results shows it can be implemented easily.

  Info
Periodical
Advanced Materials Research (Volumes 268-270)
Edited by
Feng Xiong
Pages
1110-1114
DOI
10.4028/www.scientific.net/AMR.268-270.1110
Citation
L. H. Zhang, X. L. Mao, W. Y. Duan, "On Public-Key Encryption Scheme Based on Chebyshev Maps", Advanced Materials Research, Vols. 268-270, pp. 1110-1114, 2011
Online since
July 2011
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Zhong Ping Zhang, Yong Xin Liang
Abstract:This paper proposes a new data stream outlier detection algorithm SODRNN based on reverse nearest neighbors. We deal with the sliding window...
1032
Authors: Hai Feng Li, Ning Zhang
Chapter 1: Transportation & Service Science
Abstract:Maximal frequent itemsets are one of several condensed representations of frequent itemsets, which store most of the information contained in...
21
Authors: Jia Liu, Yu Li Shen
Chapter 6: Communication and Network
Abstract:In this paper, a wireless local area network (WLAN) authentication scheme is proposed to both enhance the security and the working efficiency...
1113
Authors: Anna Ponomareva, Yuriy Shalaev
Chapter 7: Information Technology, Data and Signal Processing
Abstract:This article is devoted to the usage of the method of representing vectors. The paper contains the basic principles of the method. The...
967