Applications to Cryptography

In this part we consider the problem of detecting deviations of binary sequence from randomness in details, because this problem is very important for cryptography for the following reasons.

[1]  Robert E. Tarjan,et al.  A Locally Adaptive Data , 1986 .

[2]  Ronald L. Rivest,et al.  The RC5 Encryption Algorithm , 1994, FSE.

[3]  Jovan Dj. Golic.  Iterative Probabilistic Cryptanalysis of RC4 Keystream Generator , 2000, ACISP.

[4]  William I. Gasarch,et al.  Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series)) , 1997, SIGACT News.

[5]  Elaine B. Barker,et al.  A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications , 2000 .

[6]  Antoine Joux,et al.  A Statistical Attack on RC6 , 2000, FSE.

[7]  Andrei Fionov,et al.  Basics of Contemporary Cryptography for IT Practitioners , 2005, Series on Coding Theory and Cryptology.

[8]  Lawrence E. Bassham,et al.  Randomness Testing of the Advanced Encryption Standard Finalist Candidates , 2000 .

[9]  M. Kendall,et al.  The advanced theory of statistics , 1945 .

[10]  G. Marsaglia.  The Structure of Linear Congruential Sequences , 1972 .

[11]  Pierre L'Ecuyer,et al.  Uniform random number generation , 1994, Ann. Oper. Res..

[12]  Sergey Doroshenko,et al.  The experimental distinguishing attack on RC4 , 2006, IACR Cryptol. ePrint Arch..

[13]  Marina Pudovkina.  Statistical weaknesses in the alleged RC4 keystream generator , 2002, IACR Cryptol. ePrint Arch..

[14]  Scott R. Fluhrer,et al.  Statistical Analysis of the Alleged RC4 Keystream Generator , 2000, FSE.

[15]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[16]  K. Hotta.  Non-BPS D9-Branes in the Early Universe(Universe, Phenomenology and Condensed matter,NONCOMMUTATIVE GEOMETRY AND QUANTUM SPACETIME IN PHYSICS) , 2006 .

[17]  Burton S. Kaliski,et al.  On Differential and Linear Crytoanalysis of the RC5 Encryption Algorithm , 1995, CRYPTO.

[18]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[19]  G. Marsaglia,et al.  Monkey tests for random number generators , 1993 .

[20]  V. S. Stognienko,et al.  A new test for randomness and its application to some cryptographic problems , 2004 .

[21]  Peter Elias,et al.  Interval and recency rank source coding: Two on-line adaptive variable-length schemes , 1987, IEEE Trans. Inf. Theory.

[22]  B. Ya. Ryabko,et al.  “Book Stack” as a New Statistical Test for Random Numbers , 2004, Probl. Inf. Transm..

[23]  Sergey Doroshenko,et al.  On ZK-Crypt, Book Stack, and Statistical Tests , 2006, IACR Cryptol. ePrint Arch..

[24]  A. Kolmogorov.  Three approaches to the quantitative definition of information , 1968 .

[25]  A. C. Atkinson,et al.  The handbook of random number generation and testing with Testrand computer code , 1981 .

[26]  Alistair Moffat.  An improved data structure for cumulative probability tables , 1999 .

[27]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[28]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[29]  Jorma Rissanen,et al.  Fast adaptive arithmetic code for large alphabet sources with asymmetrical distributions , 2003, IEEE Communications Letters.

[30]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[31]  P. Billingsley,et al.  Ergodic theory and information , 1966 .