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

Kiyoshiro Okada, Paul E. Brumby, Kenji Yasuoka

研究成果: Article査読

抄録

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.

本文言語English
論文番号e0250593
ジャーナルPloS one
16
4 April 2021
DOI
出版ステータスPublished - 2021 4

ASJC Scopus subject areas

  • 一般

フィンガープリント

「The influence of random number generation in dissipative particle dynamics simulations using a cryptographic hash function」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル