Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/132768
| Title: | On the linear complexity profile of some new explicit inversive pseudorandom numbers | Authors: | Meidl, W. Winterhof, A. |
Keywords: | Inversive generators Linear complexity profile Nonlinear pseudorandom number generators Sequences over finite fields |
Issue Date: | Apr-2004 | Citation: | Meidl, 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. | Abstract: | Linear 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. | Source Title: | Journal of Complexity | URI: | http://scholarbank.nus.edu.sg/handle/10635/132768 | ISSN: | 0885064X |
| Appears in Collections: | Staff Publications |
Show full 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.