Recent times have witnessed an increase in use of high-performance reconfigurable computing for accelerating large-scale simulations. A characteristic of such simulations, like infrared (IR) scene simulation, is the use of large quantities of uncorrelated random numbers. It is therefore of interest to have a fast uniform random number generator implemented in reconfigurable hardware. While ther...

A Stirling number of the second kind is a combinatorial function which yields interesting number theoretic properties with regard to primality. The Stirling number of the second kind, S(n; k) = 1 k! k P i=0 ( 1) k i (k i), counts the number of partitions of an n-element set into k non-empty subsets. A Stirling prime (of the second kind) is a prime p such that p = S(n; k) for some integers n and...

Linear recurring sequences with very large periods are widely used as the basic building block of pseudorandom number generators. In many simulation applications, multiple streams of random numbers are needed, and these multiple streams are normally provided by jumping ahead in the sequence to obtain starting points that are far apart. For maximal-period generators having a large state space, t...

We present a new algorithm for residue multiplication modulo the Mersenne prime 2 − 1 based on the Toeplitz matrix-vector product. For this modulo, our algorithm yields better result in terms of the total number of operations than the previously known best algorithm of R. Granger and M. Scott presented in Public Key Cryptography PKC 2015. Although our algorithm has nine more multiplications tha...

In this paper properties of number theoretic transforms are investigated and it is found that they can be used to compress the regular image effectively. NTT variants namely Fermat and Mersenne transforms are applied on test images of size 16x16 and the results are analyzed and a compression scheme is developed. The algorithm is implemented in MATLAB and results are analyzed and compared with D...