André et al., 1990 - Google Patents

Figures of merit for digital multistep pseudorandom numbers

André et al., 1990

Document ID: 1783352819882412308
Author: André D; Mullen G; Niederreiter H
Publication year: 1990
Publication venue: mathematics of computation

External Links

Cited by

Snippet

The statistical independence properties of s successive digital multistep pseudorandom numbers are governed by the figure of merit ${\rho^{(s)}}(f) $ which depends on s and the characteristic polynomial f of the recursion used in the generation procedure. We extend …

Continue reading at scholar.archive.org (PDF) (other versions)

238000000034 method 0 abstract description 3

Classifications

- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
- G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
- G06F7/724—Finite field arithmetic
- G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
- G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
- G06F7/729—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic using representation by a residue number system
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
- G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
- G06F7/724—Finite field arithmetic
- G06F7/725—Finite field arithmetic over elliptic curves
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/58—Random or pseudo-random number generators
- G06F7/582—Pseudo-random number generators
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
- G06F7/68—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using pulse rate multipliers or dividers pulse rate multipliers or dividers per se
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/58—Random or pseudo-random number generators
- G06F7/588—Random number generators, i.e. based on natural stochastic processes
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F2207/72—Indexing scheme relating to groups G06F7/72 - G06F7/729
- G06F2207/7219—Countermeasures against side channel or fault attacks

Similar Documents

Publication	Publication Date	Title
Tao et al.	1998	Perturbance-based algorithm to expand cycle length of chaotic key stream
US5781458A (en)	1998-07-14	Method and apparatus for generating truly random numbers
POLLALRD	1975	A MONTE OARLO METHOD FOR FACTORIZATION
Cong et al.	1998	Chaotic frequency hopping sequences
Kak	1985	Encryption and error-correction coding using D sequences
Deng et al.	2000	Random number generation for the new century
EP1420542A1 (en)	2004-05-19	Method and apparatus of generating a chaos-based pseudo-random sequence
US6473448B1 (en)	2002-10-29	Spread spectrum signal generation method, spread spectrum signal generator, stream encryption method, and stream enciphered codes communication method
Montgomery et al.	1990	An FFT extension to the 𝑃-1 factoring algorithm
Dawson et al.	2000	The LILI-128 keystream generator
Marsaglia	2003	Random number generation
André et al.	1990	Figures of merit for digital multistep pseudorandom numbers
Kaltofen et al.	1981	A generalized class of polynomials that are hard to factor
Kotulski et al.	2000	On constructive approach to chaotic pseudorandom number generators
Griffin et al.	1999	On the distribution of nonlinear recursive congruential pseudorandom numbers of higher orders
Kokolakis et al.	1997	Comparison between cellular automata and linear feedback shift registers based pseudo-random number generators
Kochubei	1997	Stochastic integrals and stochastic differential equations over the field of p-adic numbers
Mullen et al.	1987	Optimal characteristic polynomials for digital multistep pseudorandom numbers
Llorente et al.	1988	On totally real cubic fields with discriminant 𝐷< 10⁷
Riera et al.	2021	A hybrid inversive congruential pseudorandom number generator with high period
Dams et al.	2019	WIDESEAS: A lattice-based PIR scheme implemented in EncryptedQuery
Mihaljević	1994	A correlation attack on the binary sequence generators with time-varying output function
Guimond et al.	2003	Statistical properties and implementation of aperiodic pseudorandom number generators
Antipov et al.	1996	On the improvement in random number generators by using a modulo 1 sum
Mogyoródi et al.	1984	Optimal multipliers for linear congruential pseudo-random numbers: The decimal case