A note on the multiple-recursive matrix method for generating pseudorandom vectors

DOI10.1016/j.dam.2017.01.033zbMath1432.11102arXiv1604.06753OpenAlexW2580764755MaRDI QIDQ1786872

Susil Kumar Bishoi, Himanshu Kumar Haran, Sartaj Ul Hasan

Publication date: 25 September 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

linear complexitylinear feedback shift registermultiple-recursive matrix methodLangford arrangement

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (8)

Nonlinear vectorial primitive recursive sequences ⋮ Скрученные $\sigma$-разделимые линейные рекуррентные последовательности максимального периода ⋮ Shrinking generators based on \(\sigma \)-LFSRs ⋮ Representations of skew linear recurrent sequences of maximal period over finite field;Представления скрученных линейных рекуррентных последовательностей максимального периода над конечным полем ⋮ Investigating results and performance of search and construction algorithms for word-based LFSRs, \(\sigma\)-LFSRs ⋮ Методы построения скрученных линейных рекуррентных последовательностей максимального периода, базирующиеся на факторизации многочленов Галуа в кольце матричных многочленов ⋮ Новые представления знаков скрученных ЛРП при помощи функции след, базирующиеся на некоммутативной теореме Гамильтона - Кэли ⋮ When lagged Fibonacci generators jump

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An asymptotic formula for the number of irreducible transformation shift registers
• Primitive polynomials, Singer cycles and word-oriented linear feedback shift registers
• Block companion singer cycles, primitive recursive vector sequences, and coprime polynomial pairs over finite fields
• On fast multiplication of polynomials over arbitrary algebras
• Fast multiplication of polynomials over fields of characteristic 2
• Factorization of polynomials and some linear-algebra problems over finite fields
• The multiple-recursive matrix method for pseudorandom number generation
• Improved bounds in the multiple-recursive matrix method for pseudorandom number and vector generation
• Algorithms for exponentiation in finite fields
• Efficient linear feedback shift registers with maximal period
• Enumeration of linear transformation shift registers
• The splitting subspace conjecture
• Fast multiplication of large numbers
• Euler’s constant: Euler’s work and modern developments
• Word-Oriented Transformation Shift Registers and Their Linear Complexity
• The great trinomial hunt
• Ten new primitive binary trinomials
• A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space
• Fast algorithm for finding primitive polynomials over GF(q)
• Pseudorandom Vector Generation by the Multiple-Recursive Matrix Method
• Скошенные ЛРП максимального периода над кольцами Галуа
• Enumeration of Splitting Subspaces over Finite Fields

This page was built for publication: A note on the multiple-recursive matrix method for generating pseudorandom vectors