A random number generation method based on discrete time chaotic maps

Osman Boyaci, Ahmet Cuneyd Tantug

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

In this paper a random number generation method based on a piecewise linear one dimensional (PL1D) discrete time chaotic maps is proposed for applications in cryptography and steganography. Appropriate parameters are determined by examining the distribution of underlying chaotic signal and random number generator (RNG) is numerically verified by four fundamental statistical test of FIPS 140-2. Proposed design is practically realized on the field programmable analog and digital arrays (FPAA-FPGA). Finally it is experimentally verified that the presented RNG fulfills the NIST 800-22 randomness test without post processing.

Original languageEnglish
Title of host publication2017 IEEE 60th International Midwest Symposium on Circuits and Systems, MWSCAS 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1212-1215
Number of pages4
ISBN (Electronic)9781509063895
DOIs
Publication statusPublished - 27 Sept 2017
Event60th IEEE International Midwest Symposium on Circuits and Systems, MWSCAS 2017 - Boston, United States
Duration: 6 Aug 20179 Aug 2017

Publication series

NameMidwest Symposium on Circuits and Systems
Volume2017-August
ISSN (Print)1548-3746

Conference

Conference60th IEEE International Midwest Symposium on Circuits and Systems, MWSCAS 2017
Country/TerritoryUnited States
CityBoston
Period6/08/179/08/17

Bibliographical note

Publisher Copyright:
© 2017 IEEE.

Fingerprint

Dive into the research topics of 'A random number generation method based on discrete time chaotic maps'. Together they form a unique fingerprint.

Cite this