TY - GEN
T1 - On the linear complexity of the naor—reingold pseudo-random function
AU - Griffin, Frances
AU - Shparlinski, Igor E.
PY - 1999/11
Y1 - 1999/11
N2 - We show that the new pseudo-random function, introduced recently by M. Naor and O. Reingold, possesses one more attractive and useful property. Namely, it is proved that, under a certain not too restrictive condition on the parameters of this function, for almost all seeds it produces a sequence with exponentially large linear complexity.
AB - We show that the new pseudo-random function, introduced recently by M. Naor and O. Reingold, possesses one more attractive and useful property. Namely, it is proved that, under a certain not too restrictive condition on the parameters of this function, for almost all seeds it produces a sequence with exponentially large linear complexity.
UR - http://www.scopus.com/inward/record.url?scp=0007057181&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-47942-0_25
DO - 10.1007/978-3-540-47942-0_25
M3 - Conference proceeding contribution
AN - SCOPUS:0007057181
SN - 3540666826
SN - 9783540666820
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 301
EP - 308
BT - Information and Communication Security
A2 - Varadharajan, Vijay
A2 - Mu, Yi
PB - Springer, Springer Nature
CY - Berlin; New York
T2 - 2nd International Conference on Information and Communication Security, ICICS - 1999
Y2 - 9 November 1999 through 11 November 1999
ER -