DocumentCode
692097
Title
Sequences, randomness and security
Author
Boztas, Serdar
Author_Institution
RMIT Univ., Melbourne, VIC, Australia
fYear
2013
fDate
Oct. 27 2013-Nov. 1 2013
Firstpage
3
Lastpage
3
Abstract
The definition of of randomness and pseudorandomness in the context of sequence generation is far from controversial. We provide a survey of some approaches to randomness, including: 1. Information theoretic (i.e., probabilistic) approaches, such as those based on Shannon and Renyi entropies, and 2. Complexity theoretic approaches based essentially on Kolmogorov complexity. We discuss the settings where one approach may be superior to the other. We also consider the design and analysis of randomness tests, illustrating it with some examples.
Keywords
entropy; telecommunication security; Kolmogorov complexity; Renyi entropies; Shannon entropies; complexity theoretic; information theoretic approaches; pseudorandomness; randomness tests; security; sequences; Abstracts; Educational institutions;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Design and Its Applications in Communications, The Sixth International Workshop on
Conference_Location
Tokyo
Print_ISBN
978-1-4799-6028-6
Type
conf
DOI
10.1109/IWSDA.2013.6849047
Filename
6849047
Link To Document