Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
From MaRDI portal
Publication:436622
DOI10.1016/j.ipl.2012.04.011zbMath1243.94026MaRDI QIDQ436622
Publication date: 25 July 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.04.011
11B68: Bernoulli and Euler numbers and polynomials
94A60: Cryptography
11K45: Pseudo-random numbers; Monte Carlo methods