An Application of Finite Field: Design and Implementation of 128-bit Instruction-Based Fast Pseudorandom Number Generator
نویسندگان
چکیده
(1) SIMD-oriented Mersenne Twister (SFMT) is a new pseudorandom number generator (PRNG) which uses 128-bit Single Instruction Multiple Data (SIMD) operations. SFMT is designed and implemented on C language with SIMD extensions and also implemented on standard C without SIMD. (2) Properties of SFMT are studied by using finite field theories, and they are shown to be equal or better than Mersenne Twister (MT), which is a widely used PRNG. (3) Generation speed of SFMT is measured on Intel Pentium M, Pentium IV, AMD Athlon 64 and PowerPC G4. It is shown to be about two times faster than MT implemented using SIMD.
منابع مشابه
SIMD-oriented Fast Mersenne Twister: a 128-bit Pseudorandom Number Generator
Mersenne Twister (MT) is a widely-used fast pseudorandom number generator (PRNG) with a long period of 2 − 1, designed 10 years ago based on 32-bit operations. In this decade, CPUs for personal computers have acquired new features, such as Single Instruction Multiple Data (SIMD) operations (i.e., 128bit operations) and multi-stage pipelines. Here we propose a 128-bit based PRNG, named SIMD-orie...
متن کاملVortex: A New Family of One Way Hash Functions based on Rijndael Rounds and Carry-less Multiplication
of the Contribution We present Vortex a new family of one way hash functions that can produce message digests of 224, 256, 384 and 512 bits. The main idea behind the design of these hash functions is that we use well known algorithms that can support very fast diffusion in a small number of steps. We also balance the cryptographic strength that comes from iterating block cipher rounds with SBox...
متن کاملA new class of scalable parallel pseudorandom number generators based on Pohlig-Hellman exponentiation ciphers
We propose a new class of pseudorandom number generators based on Pohlig-Hellman exponentiation ciphers. The method generates uniform pseudorandom streams by encrypting simple sequences of short integer messages into ciphertexts by exponentiation modulo prime numbers. The advantages of the method are: the method is trivially parallelizable by parameterization with each pseudorandom number gener...
متن کاملTriviA: A Fast and Secure Authenticated Encryption Scheme
In this paper, we propose a new hardware friendly authenticated encryption (AE) scheme TriviA based on (i) a stream cipher for generating keys for the ciphertext and the tag, and (ii) a pairwise independent hash to compute the tag. We have adopted one of the ISOstandardized stream ciphers for lightweight cryptography, namely Trivium, to obtain our underlying stream cipher. This new stream ciphe...
متن کاملFast and Small Nonlinear Pseudorandom Number Generators for Computer Simulation
In this paper we present Tyche, a nonlinear pseudorandom number generator designed for computer simulation. Tyche has a small 128-bit state and an expected period length of 2. Unlike most nonlinear generators, Tyche is consistently fast across architectures, due to its very simple iteration function derived from ChaCha, one of today’s fastest stream ciphers. Tyche is especially amenable for the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007