The influence of random number generation in dissipative particle dynamics simulations using a cryptographic hash function

Kiyoshiro Okada, Paul E. Brumby, Kenji Yasuoka

Research output: Contribution to journalArticlepeer-review

Abstract

The tiny encryption algorithm (TEA) is widely used when performing dissipative particle dynamics (DPD) calculations in parallel, usually on distributed memory systems. In this research, we reduced the computational cost of the TEA hash function and investigated the influence of the quality of the random numbers generated on the results of DPD calculations. It has already been established that the randomness, or quality, of the random numbers depend on the number of processes from internal functions such as SHIFT, XOR and ADD, which are commonly referred to as “rounds”. Surprisingly, if we choose seed numbers from high entropy sources, with a minimum number of rounds, the quality of the random numbers generated is sufficient to successfully perform accurate DPD simulations. Although it is well known that using a minimal number of rounds is insufficient for generating high-quality random numbers, the combination of selecting good seed numbers and the robustness of DPD simulations means that we can reduce the random number generation cost without reducing the accuracy of the simulation results.

Original languageEnglish
Article numbere0250593
JournalPloS one
Volume16
Issue number4 April 2021
DOIs
Publication statusPublished - 2021 Apr

ASJC Scopus subject areas

  • General

Fingerprint Dive into the research topics of 'The influence of random number generation in dissipative particle dynamics simulations using a cryptographic hash function'. Together they form a unique fingerprint.

Cite this