Pseudorandomness of binary sequences derived from linear recursions

DOI10.1007/S10998-015-0085-0zbMATH Open1363.11076OpenAlexW2183750860MaRDI QIDQ313462FDOQ313462

László Mérai

Publication date: 9 September 2016

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10998-015-0085-0

zbMATH Keywords

pseudorandomnesslinear recursionpseudorandom measures

Mathematics Subject Classification ID

Pseudo-random numbers; Monte Carlo methods (11K45)

Cites Work

• On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
• Measures of pseudorandomness for finite sequences: typical values
• Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
• Construction of pseudorandom binary sequences using additive characters
• On linear recursion and pseudorandomness
• Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II
• Construction of pseudorandom binary lattices based on multiplicative characters

Cited In (4)

• On Binary Sequences from Recursions “modulo 2e” Made Non-Linear by the Bit-By-Bit “XOR” Function
• Title not available (Why is that?)
• On a pseudorandom property of binary sequences
• Title not available (Why is that?)

This page was built for publication: Pseudorandomness of binary sequences derived from linear recursions

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