JOURNAL ARTICLE

Fully Asynchronous Cellular Automata as a 'good' Randomness Enhancer.

  • Published In: Journal of Cellular Automata, 2023, v. 17, n. 1/2. P. 79 1 of 3

  • Database: Academic Search Ultimate 2 of 3

  • Authored By: ROY, SOUVIK 3 of 3

Abstract

This work explores randomness enhancing capability of asynchronous cellular automata. This paper first reports theoretical results to identify elementary cellular automata under fully asynchronous updating scheme with large cycle of length 2n or 2n - 1. To predict the randomness enhancing capability, we classify these large cycle asynchronous cellular automata into fully and partially exposed systems following both the experimental and theoretical approach. Finally, it is observed that fully exposed asynchronous cellular automata are able to improve randomness quality of a 'poor' random number generator. [ABSTRACT FROM AUTHOR]

Additional Information

  • Source:Journal of Cellular Automata. 2023/01, Vol. 17, Issue 1/2, p79
  • Document Type:Article
  • Subject Area:Mathematics
  • Publication Date:2023
  • ISSN:1557-5969
  • Accession Number:164741408
  • Copyright Statement:Copyright of Journal of Cellular Automata is the property of Old City Publishing, Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Looking to go deeper into this topic? Look for more articles on EBSCOhost.