Distribution of recursive matrix pseudorandom number generator modulo prime powers

From MaRDI portal
Publication:6203467

DOI10.1090/MCOM/3895arXiv2302.03964OpenAlexW4387937037MaRDI QIDQ6203467FDOQ6203467

Igor E. Shparlinski, László Mérai

Publication date: 28 February 2024

Published in: Mathematics of Computation (Search for Journal in Brave)

Abstract: Given a matrix AinmathrmGLd(mathbbZ). We study the pseudorandomness of vectors mathbfun 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 pt with a fixed prime p and sufficiently large integer tgeq1. 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. Ford (2002). This is combined with some ideas from the work of I. E. Shparlinski (1978) which allows to construct polynomial representations of the coordinates of mathbfun and control the p-adic orders of their coefficients in polynomial representation.


Full work available at URL: https://arxiv.org/abs/2302.03964







Cites Work






This page was built for publication: Distribution of recursive matrix pseudorandom number generator modulo prime powers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6203467)