## About

17

Publications

1,616

Reads

**How we measure 'reads'**

A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more

531

Citations

Citations since 2017

Introduction

**Skills and Expertise**

## Publications

Publications (17)

The pseudorandom number generating system repeatedly performs simple transformation of a non-secure pseudorandom number sequence that may be generated quickly, and thus may quickly generate a highly secure pseudorandom number sequence having a long period. Furthermore, the encryption system and the decryption system do not generate a large encrypti...

Let $\mathcal{P} \subset [0,1)^S$ be a finite point set of cardinality $N$ in
an $S$-dimensional cube, and let $f:[0,1)^S \to \mathbb{R}$ be an integrable
function. A QMC integration of $f$ by $\mathcal{P}$ is the average of values of
$f$ at each point in $\mathcal{P}$, which approximates the integration of $f$
over the cube. Assume that $\mathcal{...

Sequences generated by an F₂-linear recursion have wide applications, in particular, pseudorandom number generation. The dimension of equidistribution with f-bit accuracy is a most important criterion for the uniformity of the generated sequence. The fastest known method for computing these dimensions is proposed by Couture and L'Ecuyer, based on L...

The author proposes pseudorandom number generators suitable to execute on a graphic processor. They generate pseudorandom numbers in device memory on graphic processors. Each generator uses shared memory on graphic processors as its internal state space, and uses constant memory as a look-up table for a linear transformation. Output formats of the...

This paper proposes a type of pseudorandom number generator, Mersenne Twister
for Graphic Processor (MTGP), for efficient generation on graphic processessing
units (GPUs). MTGP supports large state sizes such as 11213 bits, and uses the
high parallelism of GPUs in computing many steps of the recursion in parallel.
The second proposal is a parameter...

We propose a pseudorandom number generator specialized to generate double precision floating point numbers. It generates 52-bit
pseudorandom patterns supplemented by a constant most significant 12 bits (sign and exponent), so that the concatenated 64
bits represents a floating point number obeying the IEEE 754 format. To keep the constant part, we...

CryptMT version 3 (CryptMT3) is a stream cipher obtained by combining a large LFSR and a nonlinear filter with memory using
integer multiplication. Its period is proved to be no less than 219937− 1, and the 8-bit output sequence is at least 1241-dimensionally equidistributed. It is one of the fastest stream ciphers
on a CPU with SIMD operations, su...

Mersenne Twister (MT) is a widely-used fast pseudorandom number generator (PRNG) with a long period of 219937 - 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., 128-bit operations) and multi-stage pipelines....

Recent personal computers have high-spec CPUs and plenty of memory. The motivation of this study is to take these advantages in designing a tough and fast key-stream generator. Natural controversies on using a large state space for a generator are (1) effectiveness is unclear, (2) slower generation speed, (3) expensive initialization, and (4) costs...

Pseudorandom number generators are widely used in the area of simula- tion. Defective generators are still widely used in standard library programs, although better pseudorandom number generators such as the Mersenne Twister are freely avail- able. This manuscript gives a brief explanation on pseudorandom number generators for Monte Carlo simulatio...

CryptMT (Cryptographic Mersenne Twister) is an 8-bit pseudo- random integer generator for a stream cipher. It combines an F2-linear gen- erator of period 219937 ¡ 1 and a multiplicative filter with 32-bit memory. We analyze its security against some standard cryptanalytic attacks for filter generators. It is proved that CryptMT has strong resistanc...

We propose two stream ciphers based on a non-secure pseudoran- dom number generator (called the mother generator). The mother generator is here chosen to be the Mersenne Twister (MT), a widely used 32-bit integer generator having 19937 bits of internal state and period 219937 � 1. One proposal is CryptMT, which computes the accumulative product of...

In the previous manuscripts, we proposed CryptMT pseudoran- dom number generator (PRNG) for a stream cipher, which is a combination of (1) an F2-linear generator of a wordsize-integer sequence with a huge state space, and (2) a filter with one wordsize memory, based on the accumula- tive integer multiplication and extracting some most significant b...

CryptMT Version 3 (CryptMT3) is a stream cipher obtained by combining a large LFSR and a nonlinear filter with memory using in-teger multiplication. Its period is proved to be no less than 2 19937 −1, and the 8-bit output sequence is at least 1241-dimensionally equidistributed. It is one of the fastest stream ciphers on a CPU with SIMD operations,...

As a pseudorandom number generator (PRNG) for a stream ci- pher, we propose a combination of (1) an F2-linear generator of a wordsize- integer sequence with huge state space, and (2) a filter with one wordsize memory, based on the accumulative integer multiplication and extracting some most significant bits from the memory. We proposed CryptMT as a...