Add to ORKG(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 lanuage 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, AMDA thlon64 and PowerPC G4. It is shown to be about two times faster than MT implemented using SIMD.広島大学理学研究科 平成18年度 修士論
The groundbreaking idea of public key cryptography and the rapid expansion of the internetin the 80s...
In this article Re present background, rationale, and a description of the Scalable Parallel Random ...
Random number generators are essential in many computing applications, such as Artificial Intelligen...
(1)SIMD-oriented Mersenne Twister (SFMT)is a new pseudorandom number generator(PRNG) which uses 128-...
Summary. Mersenne Twister (MT) is a widely-used fast pseudorandom number generator (PRNG) with a lon...
This paper proposes a type of pseudorandom number generator,Mersenne Twister for Graphic Processor (...
This paper deals with the design of a network-on-chip reconfigurable pseudorandom number generation ...
To help promote more widespread adoption of hardware acceleration in parallel scientific computing, ...
Pseudorandom number generators are widely used in the area of simulation. Defective generators are s...
144 p.The security strength of Public Key Cryptosystems (PKCs) is attributed to the complex computat...
An algorithm and coding technique is presented for quick evaluation of the Lehmer pseudo-random numb...
Efficient generation of random and pseudorandom sequences is of great importance to a number of appl...
The Mathematica function SeedRandom comes with a variety of different methods: • "Sobol"—Sobol low-d...
This paper describes carry-less arithmetic operations modulo an integer $2^M - 1$ in the thousand-bi...
The performance of elliptic curve based public key cryptosystems is mainly appointed by the efficien...
The groundbreaking idea of public key cryptography and the rapid expansion of the internetin the 80s...
In this article Re present background, rationale, and a description of the Scalable Parallel Random ...
Random number generators are essential in many computing applications, such as Artificial Intelligen...
(1)SIMD-oriented Mersenne Twister (SFMT)is a new pseudorandom number generator(PRNG) which uses 128-...
Summary. Mersenne Twister (MT) is a widely-used fast pseudorandom number generator (PRNG) with a lon...
This paper proposes a type of pseudorandom number generator,Mersenne Twister for Graphic Processor (...
This paper deals with the design of a network-on-chip reconfigurable pseudorandom number generation ...
To help promote more widespread adoption of hardware acceleration in parallel scientific computing, ...
Pseudorandom number generators are widely used in the area of simulation. Defective generators are s...
144 p.The security strength of Public Key Cryptosystems (PKCs) is attributed to the complex computat...
An algorithm and coding technique is presented for quick evaluation of the Lehmer pseudo-random numb...
Efficient generation of random and pseudorandom sequences is of great importance to a number of appl...
The Mathematica function SeedRandom comes with a variety of different methods: • "Sobol"—Sobol low-d...
This paper describes carry-less arithmetic operations modulo an integer $2^M - 1$ in the thousand-bi...
The performance of elliptic curve based public key cryptosystems is mainly appointed by the efficien...
The groundbreaking idea of public key cryptography and the rapid expansion of the internetin the 80s...
In this article Re present background, rationale, and a description of the Scalable Parallel Random ...
Random number generators are essential in many computing applications, such as Artificial Intelligen...