Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations

From MaRDI portal
Publication:437681


DOI10.1016/j.ipl.2011.11.017zbMath1242.94023MaRDI QIDQ437681

J. Herrera, H. S. Yoon

Publication date: 18 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.11.017


11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A60: Cryptography

11K45: Pseudo-random numbers; Monte Carlo methods


Related Items



Cites Work