On the linear complexity of the naor—reingold pseudo-random function

Frances Griffin, Igor E. Shparlinski

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

9 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationInformation and Communication Security
Subtitle of host publicationSecond International Conference, ICICS’99, Sydney, Australia, November 9-11, 1999. Proceedings
EditorsVijay Varadharajan, Yi Mu
Place of PublicationBerlin; New York
PublisherSpringer, Springer Nature
Pages301-308
Number of pages8
ISBN (Electronic)9783540479420
ISBN (Print)3540666826, 9783540666820
DOIs
Publication statusPublished - Nov 1999
Event2nd International Conference on Information and Communication Security, ICICS - 1999 - Sydney, Australia
Duration: 9 Nov 199911 Nov 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1726
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other2nd International Conference on Information and Communication Security, ICICS - 1999
CountryAustralia
CitySydney
Period9/11/9911/11/99

Fingerprint Dive into the research topics of 'On the linear complexity of the naor—reingold pseudo-random function'. Together they form a unique fingerprint.

Cite this