A new class of pseudo-random sequences from Mersenne numbers

DOI10.1504/IJICOT.2009.024050MaRDI QIDQ622776zbMATH OpenOpenAlexFDO

Authors Abhijit Mitra

Publication date 4 February 2011

Published in International Journal of Information and Coding Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijicot.2009.024050

zbMATH Keywords

maximal length sequenceMersenne numbersmodulo-\(2\) operationshift equivalence

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4081466
• Design of long period pseudo-random sequences from the addition of \(m\)-sequences over \({\mathbb F}_p\)
• An algorithm for generating M-sequences using the amalgamation-circles method in F₂
• Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
• Increasing the rate of output of m-sequences

Cited in

(6)

• A novel method for generating pseudorandom integer strings and pseudorandom sequences
• A class of random number generators based on Weyl sequence
• Influence of Ohmic diffusion on the excitation and dynamics of MRI
• scientific article; zbMATH DE number 4137230 (Why is no real title available?)
• Mersenne twister
• On new identities for Mersenne numbers

This page was built for publication: A new class of pseudo-random sequences from Mersenne numbers

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