lil

A project to develop Law of the Iterated Logarithm based testing tools.

This site is dedicated for techniques, software package, and reports of statistical testing techniques for pseudorandom generators. We developed LIL testing techniques for pseudo-random generator testing.

How to:

1. LILtest: this is an Netbean project folder. Import the project into Netbean and follow the instructions
2. compiled_liltest: alternatively, you can download this compiled .jar file and follow the instructions in the README.TXT

Documentation

1. The idea of LIL testing was first proposed in the paper: Yongge Wang: Linear complexity versus pseudorandomness: on Beth and Dai's result. In: Proc. Asiacrypt 99, pages 288--298. LNCS 1716, Springer Verlag. https://webpages.uncc.edu/yonwang/papers/acrypt991.pdf
2. Yongge Wang and Tony Nicol: Statistical Properties of Pseudo Random Sequences and Experiments with PHP and Debian OpenSSL. Computers and Security (53):44-64, September 2015. An extended abstract appeared in ESORICS 2014, LNCS 8712, pp. 454--471. https://webpages.uncc.edu/yonwang/papers/lilesorics.pdf Elsevier version http://dx.doi.org/10.1016/j.cose.2015.05.005.
3. Yongge Wang: On the Design of LIL Tests for (Pseudo) Random Generators and Some Experimental Results https://webpages.uncc.edu/yonwang/papers/liltest.pdf
4. Yongge Wang: On Stochastic Security of Pseudorandom Sequences https://webpages.uncc.edu/yonwang/papers/lilPrfV2.pdf
5. C.Calude, P.Hertling, B.Khoussainov, and Y.Wang: Recursively enumerable reals and Chaitin's Ω numbers. Theoretical Computer Science 255:125--149, 2001. https://webpages.uncc.edu/yonwang/papers/TCS01.pdf
6. Y.Wang: Genericity, randomness, and polynomial time approximations. SIAM Journal on Computing, 28(2):394-408, 1999. https://webpages.uncc.edu/yonwang/papers/SIAM.pdf
7. Y.Wang: A separation of two randomness concepts. Information Processing Letters, 69(3):115--118, 1999. https://webpages.uncc.edu/yonwang/papers/IPL99.pdf
8. Y.Wang: Resource bounded randomness and computational complexity. Theoretical Computer Science 237(1-2):33--55, 2000. https://webpages.uncc.edu/yonwang/papers/TCS00.pdf
9. Y.Wang: Randomness, stochasticity, and approximations. Theory of Computing Systems 32:517--529, 1999. https://webpages.uncc.edu/yonwang/papers/TOCS99.pdf
10. Y.Wang: A comparison of two approaches to pseudorandomness. Theoretical Computer Science 276(1-2):449--459, 2002. https://webpages.uncc.edu/yonwang/papers/TCS02.pdf
11. Y.Wang: Randomness and Complexity. PhD Thesis, 1996. https://webpages.uncc.edu/yonwang/papers/thesis.pdf