English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/78138
Share/Impact:
Statistics
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:
Title

A Deterministic Approach to Pseudorandom Pattern Generators

AuthorsFúster Sabater, Amparo; Caballero-Gil, P.
KeywordsDeterministic approach
pattern generator
algorithm
cryptography
Issue Date2005
PublisherSpringer
CitationLecture Notes in Computer Science 3746: 695- 704 (2005)
AbstractAn easy method of computing the number of 1's and 0's (balancedness) as well as the number of runs (run quantification) in the sequence obtained from a LFSR-based pseudorandom patter generator has been developed. The procedure is a deterministic alternative to the traditional application of statistical tests. The computation method allows one to check deviation of balancedness and run distribution goodness from standard values. As a straight consequence of the above procedure, simple rules to design pattern generators with adequate pseudorandomness properties are also derived.
Description11 páginas, 6 tablas
URIhttp://hdl.handle.net/10261/78138
DOI10.1007/11573036_66
ISSN0302-9743
Appears in Collections:(IFA) Artículos
Files in This Item:
File Description SizeFormat 
438411.pdf169,38 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.