arXiv 0902.38842009-02math.NTmath.DS

On the Degree Growth in Some Polynomial Dynamical Systems and Nonlinear Pseudorandom Number Generators

Alina Ostafe, Igor Shparlinski

备注：: Mathematics of Computation (to appear)
DOI：: 10.1090/S0025-5718-09-02271-6

英文摘要：

In this paper we study a class of dynamical systems generated by iterations of multivariate polynomials and estimate the degreegrowth of these iterations. We use these estimates to bound exponential sums along the orbits of these dynamical systems and show that they admit much stronger estimates than in the general case and thus can be of use for pseudorandom number generation.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Multivariate Permutation Polynomial Systems and Nonlinear Pseudorandom Number Generators

In this paper we study a class of dynamical systems generated by iterations of multivariate permutation polynomial systems which lead to polynomial growth of the degrees of these iterations. Using these estimates and the same techniques studied previously for inversive generators, we bound exponential sums along the orbits of these dynamical systems and show that they admit much stronger estimates on average over all initial values than in the general case and thus can be of use for pseudorandom number generation.

2010-01-10math.DSmath.NT

Periodic Structure of the Exponential Pseudorandom Number Generator

We investigate the periodic structure of the exponential pseudorandom number generator obtained from the map $x\mapsto g^x\pmod p$ that acts on the set $\{1, \ldots, p-1\}$.

2013-12-04cs.CRmath.NT

The vortex filament equation as a pseudorandom generator

In this paper, we consider the evolution of the so-called vortex filament equation (VFE), \begin{equation*} \mathbf X_t = \mathbf X_s\wedge\mathbf X_{ss}, \end{equation*} taking a planar regular polygon of $M$ sides as initial datum. We study VFE from a completely novel point of view: that of an evolution equation which yields a very good generator of pseudorandom numbers in a completely natural way. This essential randomness of VFE is in agreement with the randomness of the physical phenomena upon which it is based.

2015-01-13math.NT

Pseudorandom number generator based on the Bernoulli map on cubic algebraic integers

We develop a method for generating pseudorandom binary sequences using the Bernoulli map on cubic algebraic integers. The distinguishing characteristic of our generator is that it generates chaotic true orbits of the Bernoulli map by exact computation. In particular, we clarify a way to properly prepare a set of initial points (i.e., seeds), which is needed when generating multiple pseudorandom sequences. With this seed selection method, we can distribute the initial points almost uniformly in the unit interval and can also guarantee that the orbits starting from them do not merge. We also rep…

2017-06-20cs.CRcs.ITmath.IT

Distribution of recursive matrix pseudorandom number generator modulo prime powers

Given a matrix $A\in \mathrm{GL}_d(\mathbb{Z})$. We study the pseudorandomness of vectors $\mathbf{u}_n$ generated by a linear recurrent relation of the form $$ \mathbf{u}_{n+1} \equiv A \mathbf{u}_n \pmod {p^t}, \qquad n = 0, 1, \ldots, $$ modulo $p^t$ with a fixed prime $p$ and sufficiently large integer $t \geq 1$. We study such sequences over very short segments of length which is not accessible via previously used methods. Our technique is based on the method of N. M. Korobov (1972) of estimating double Weyl sums and a fully explicit form of the Vinogradov mean value theorem due to K. For…

2023-02-08math.NT

On the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves

Given a prime $p$, an elliptic curve $\E/\F_p$ over the finite field $\F_p$ of $p$ elements and a binary \lrs\ $$u(n)$_{n =1}^\infty$ of order~$r$, we study the distribution of the sequence of points $$ \sum_{j=0}^{r-1} u(n+j)P_j, \qquad n =1,..., N, $$ on average over all possible choices of $\F_p$-rational points $P_1,..., P_r$ on~$\E$. For a sufficiently large $N$ we improve and generalise a previous result in this direction due to E.~El~Mahassni.

2011-02-05cs.CRmath.NT

更多相关论文收起更多论文

Secure pseudorandom bit generators and point sets with low star-discrepancy

The star-discrepancy is a quantitative measure for the irregularity of distribution of a point set in the unit cube that is intimately linked to the integration error of quasi-Monte Carlo algorithms. These popular integration rules are nowadays also applied to very high-dimensional integration problems. Hence multi-dimensional point sets of reasonable size with low discrepancy are badly needed. A seminal result from Heinrich, Novak, Wasilkowski and Woźniakowski shows the existence of a positive number $C$ such that for every dimension $d$ there exists an $N$-element point set in $[0,1)^d$ with…

2021-04-07math.NT

关于由椭圆曲线同余生成器构造的伪随机向量的偏差估计

On discrepancy estimates for pseudorandom vectors constructed by the elliptic curve congruential generator

Shanghai Institute for Mathematics and Interdisciplinary Sciences (SIMIS)（上海数学与交叉学科研究院）；Research Institute of Intelligent Complex Systems, Fudan University（复旦大学智能复杂系统研究院）

本文研究了由椭圆曲线同余生成器构造的伪随机向量的偏差估计问题，特别是在非平移情况下。研究得出了两个结果家族：首先，在由诱导一维线性同余生成器的相对最大周期条件（RMPC）特征的全余集 regime 中，证明了偏差 D、序列偏差 D_s 及在相应导出 RMPC 下的非重叠偏差 $\widetilde D_s$ 的上界为 $q^{1/2}/t$。其次，在一般子周期 regime 中，将 D、D_s 和 $\widetilde D_s$ 的上界减少到估计附着于一维线性同余生成器的可接受索引集的傅里叶 $\ell^1$ 质量，这隔离了进一步改进的算术瓶颈。

2026-05-20math.NT

一种新型密码学安全伪随机数生成器的设计与实现

Design and implementation of a novel cryptographically secure pseudorandom number generator

本研究设计了一种兼具密码学安全性、易实现、可移植的新型伪随机数生成器，通过模幂运算与类Feistel盒混合比特实现，经大量统计检验验证可生成高质量随机序列。

2025-03-22cs.CRcs.NAmath.NA

Pseudorandom Numbers and Hash Functions from Iterations of Multivariate Polynomials

Dynamical systems generated by iterations of multivariate polynomials with slow degree growth have proved to admit good estimates of exponential sums along their orbits which in turn lead to rather stronger bounds on the discrepancy for pseudorandom vectors generated by these iterations. Here we add new arguments to our original approach and also extend some of our recent constructions and results to more general orbits of polynomial iterations which may involve distinct polynomials as well. Using this construction we design a new class of hash functions from iterations of polynomials and use …

2010-01-10math.DSmath.NT

伪随机二进制序列：质量度量与数论构造

Pseudorandom binary sequences: quality measures and number-theoretic constructions

本综述总结了一些数论序列的伪随机性，分析了Legendre序列、双素数生成器、Thue-Morse序列等在平衡性、线性复杂度、$k$阶相关测度等度量下的行为结果。

2023-05-19math.NT

Full Orbit Sequences in Affine Spaces via Fractional Jumps and Pseudorandom Number Generation

Let $n$ be a positive integer. In this paper we provide a general theory to produce full orbit sequences in the affine $n$-dimensional space over a finite field. For $n=1$ our construction covers the case of the Inversive Congruential Generators (ICG). In addition, for $n>1$ we show that the sequences produced using our construction are easier to compute than ICG sequences. Furthermore, we prove that they have the same discrepancy bounds as the ones constructed using the ICG.

2018-09-10math.NT

Dichotomic random number generators

We introduce several classes of pseudorandom sequences which represent a natural extension of classical methods in random number generation. The sequences are obtained from constructions on labeled binary trees, generalizing the well-known Stern-Brocot tree.

2016-03-04math.COmath.NT

利用牛顿法加速真轨道伪随机数生成

Accelerating true orbit pseudorandom number generation using Newton's method

本研究针对无理代数数二进制展开的伪随机序列生成问题，提出基于牛顿法的高效计算方法，证明其时间复杂度与N位整数乘法相当，加速了真轨道伪随机数生成且序列通过TestU01的RabbitFile全部统计测试。

2025-02-22math.NTstat.CO

The iterated Carmichael λ-function and the number of cycles of the power generator

Iteration of the modular l-th power function f(x) = x^l (mod n) provides a common pseudorandom number generator (known as the Blum-Blum-Shub generator when l=2). The period of this pseudorandom number generator is closely related to λ(λ(n)), where λ(n) denotes Carmichael's function, namely the maximal multiplicative order of any integer modulo n. In this paper, we show that for almost all n, the size of λ(λ(n)) is n/exp((1+o(1))(log log n)^2 log log log n). We conjecture an analogous formula for the k-th iterate of λ. We deduce that for almost all n, the psuedorandom number generator described…

2004-06-16math.NT

稀疏多项式的指数和与幂生成器的分布

Exponential Sums with Sparse Polynomials and Distribution of the Power Generator

本文在温和次数条件下给出模素数稀疏多项式完全有理指数和的新界，并由此得到 Bourgain 关于模合数结果的显式版本，进而首次研究了经典幂生成器的多维分布。

2024-12-28math.NT