Journal
APPLIED MATHEMATICS & INFORMATION SCIENCES
Volume 7, Issue 6, Pages 2175-2188Publisher
NATURAL SCIENCES PUBLISHING CORP-NSP
DOI: 10.12785/amis/070607
Keywords
Information security; Pseudorandom number generator; Discrete chaotic iteration; Cryptographical security; FPGA
Categories
Ask authors/readers for more resources
Lots of researches indicate that the inefficient generation of random numbers is a significant bottleneck for information communication applications. Therefore, Field Programmable Gate Array (FPGA) is developed to process a scalable fixed-point method for random streams generation. In our previous researches, we have proposed a technique by applying some well-defined discrete chaotic iterations that satisfy the reputed Devaney's definition of chaos, namely chaotic iterations (CI). We have formerly proven that the generator with CI can provide qualified chaotic random numbers. In this paper, this generator based on chaotic iterations is optimally redesigned for FPGA device. By doing so, the generation rate can be largely improved. Analyses show that these hardware generators can also provide good statistical chaotic random bits and can be cryptographically secure too. An application in the information hiding security field is finally given as an illustrative example.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available