4.2 Article

A pseudorandom bit generator based on new multi-delayed Chebyshev map

Journal

INFORMATION PROCESSING LETTERS
Volume 116, Issue 11, Pages 674-681

Publisher

ELSEVIER
DOI: 10.1016/j.ipl.2016.06.011

Keywords

Cryptography; Safety/security in digital systems; Algorithm

Funding

  1. National Natural Science Foundation of China (NSFC) [61505061]

Ask authors/readers for more resources

Chaotic map is regarded as an important pseudorandom source in the design of pseudorandom bit generators due to its excellent properties, such as unpredictability, randomness, aperiodicity, sensitive dependence on initial conditions and parameters. One-dimensional Chebyshev map is one of the most popular maps in designing pseudorandom bit generator. In order to improve its security, in this paper, we will first construct a new multi-delayed Chebyshev map. The dynamics analysis shows that this new map is more complex than the original Chebyshev map. Furthermore, we propose a new pseudorandom bit generator based on this multi-delayed Chebyshev map; the statistics and security analysis show that our pseudorandom bit generator has good pseudorandom characteristics and is highly capable to withstand attacks. (C) 2016 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.2
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available