Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/132768
DC FieldValue
dc.titleOn the linear complexity profile of some new explicit inversive pseudorandom numbers
dc.contributor.authorMeidl, W.
dc.contributor.authorWinterhof, A.
dc.date.accessioned2016-12-13T05:36:18Z
dc.date.available2016-12-13T05:36:18Z
dc.date.issued2004-04
dc.identifier.citationMeidl, W., Winterhof, A. (2004-04). On the linear complexity profile of some new explicit inversive pseudorandom numbers. Journal of Complexity 20 (2-3) : 350-355. ScholarBank@NUS Repository.
dc.identifier.issn0885064X
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/132768
dc.description.abstractLinear complexity and linear complexity profile are interesting characteristics of a sequence for applications in cryptography and Monte-Carlo methods. We introduce some new explicit inversive pseudorandom number generators and prove lower bounds on their linear complexity profile which are close to the best possible. © 2003 Elsevier Inc. All rights reserved.
dc.sourceScopus
dc.subjectInversive generators
dc.subjectLinear complexity profile
dc.subjectNonlinear pseudorandom number generators
dc.subjectSequences over finite fields
dc.typeArticle
dc.contributor.departmentTEMASEK LABORATORIES
dc.description.sourcetitleJournal of Complexity
dc.description.volume20
dc.description.issue2-3
dc.description.page350-355
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.