Modified constructions of binary sequences using multiplicative inverse

DOI10.1007/S11766-008-1855-8zbMath1199.94061OpenAlexW2075077894MaRDI QIDQ1032814

J. Blot

Publication date: 11 November 2009

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-008-1855-8

zbMATH Keywords

exponential sumpseudorandomnessstream cipherbinary sequencemultiplicative inverse

Mathematics Subject Classification ID

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

Related Items (1)

Correlation measure, linear complexity and maximum order complexity for families of binary sequences

Cites Work

• Unnamed Item
• Finite binary sequences constructed by explicit inversive methods
• Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
• Construction of pseudorandom binary sequences using additive characters
• Linear complexity profile of binary sequences with small correlation measure
• On the correlation of pseudorandom numbers generated by inversive methods
• On a family of pseudorandom binary sequences
• Construction of pseudorandom binary sequences by using the multiplicative inverse
• New pseudorandom sequences constructed using multiplicative inverses
• New pseudorandom sequences constructed by quadratic residues and Lehmer numbers
• On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
• On finite pseudorandom binary sequences VII: The measures of pseudorandomness
• On the Distribution of Some New Explicit Nonlinear Congruential Pseudorandom Numbers
• On a problem of D. H. Lehmer
• Construction of large families of pseudorandom binary sequences

This page was built for publication: Modified constructions of binary sequences using multiplicative inverse