ON THE PERIOD LENGTH OF CONGRUENTIAL PSEUDORANDOM NUMBER SEQUENCES GENERATED BY INVERSIONS

Date

1990-07-24

Author

EICHENAUERHERRMANN, J
TOPUZOGLU, A

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

114
views

0
downloads

Congruential pseudorandom number sequences generated by inversions have been studied recently. These sequences do not show the undesirable lattice structure of the linear congruential method. The necessary and sufficient condition for the generated sequence to have the maximal period length was given by Eichenauer (1988) for the case of 2e modulus. Generalization of this result to the case of an arbitrary prime power modulus is obtained.

Subject Keywords

Pseudorandom Number Sequences , Inversive Congruential Generators , Period Length

URI

https://hdl.handle.net/11511/65477

Journal

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS

DOI

https://doi.org/10.1016/0377-0427(90)90339-2

Collections

Department of Mathematics, Article

Suggestions

OpenMETU
Core

ON THE LATTICE STRUCTURE OF A NONLINEAR GENERATOR WITH MODULUS 2-ALPHA EICHENAUERHERRMANN, J; GROTHE, H; NIEDERREITER, H; TOPUZOGLU, A (1990-07-24) Nonlinear congruential pseudorandom number generators based on inversions have been introduced and analysed recently. These generators do not show the simple lattice structure of the widely used linear congruential generators which are too regular for certain simulation purposes. In the present paper a nonlinear congruential generator based on inversions with respect to a power of two modulus is considered. It is shown that the set of points formed by consecutive pseudorandom numbers has a more complicated ...
A NONLINEAR CONGRUENTIAL PSEUDORANDOM NUMBER GENERATOR WITH POWER OF 2 MODULUS EICHENAUER, J; LEHN, J; TOPUZOGLU, A (1988-10-01) A nonlinear congruential pseudorandom number generator is studied where the modulus is a power of two. Investigation of this generator was suggested by Knuth [7]. A simple necessary and sufficient condition is given for this generator to have the maximal period length.
On the expected value of the linear complexity of periodic sequences Özakın, Çiğdem; Özbudak, Ferruh; Department of Cryptography (2004) In cryptography, periodic sequences with terms in F2 are used almost everywhere. These sequences should have large linear complexity to be cryptographically strong. In fact, the linear complexity of a sequence should be close to its period. In this thesis, we study the expected value for N-periodic sequences with terms in the finite field Fq. This study is entirely devoted to W. Meidl and Harald Niederreiter̕s paper which is أOn the Expected Value of the Linear Complexity and the k-Error Linear Complexity o...
On the deformation chirality of real cubic fourfolds Finashin, Sergey (Wiley, 2009-09-01) According to our previous results, the conjugacy class of the involution induced by the complex conjugation in the homology of a real non-singular cubic fourfold determines the fourfold tip to projective equivalence and deformation. Here, we show how to eliminate the projective equivalence and obtain a pure deformation classification, that is, how to respond to the chirality problem: which cubics are not deformation equivalent to their image under a mirror reflection. We provide an arithmetical criterion of...
On the units generated by Weierstrass forms Küçüksakallı, Ömer (2014-01-01) There is an algorithm of Schoof for finding divisors of class numbers of real cyclotomic fields of prime conductor. In this paper we introduce an improvement of the elliptic analogue of this algorithm by using a subgroup of elliptic units given by Weierstrass forms. These elliptic units which can be expressed in terms of x-coordinates of points on elliptic curves enable us to use the fast arithmetic of elliptic curves over finite fields.

Citation Formats

J. EICHENAUERHERRMANN and A. TOPUZOGLU, “ON THE PERIOD LENGTH OF CONGRUENTIAL PSEUDORANDOM NUMBER SEQUENCES GENERATED BY INVERSIONS,” JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, pp. 87–96, 1990, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/65477.