Randomness quality of permuted pseudorandom binary sequences

Authors:
Syn Kiat Tan;Sheng-Uei Guan
Affiliations:
Department of Electrical and Computer Engineering, National University of Singapore, 10 Kent Ridge Crescent, Singapore 119260, Singapore;Department of Computer Science & Software Engineering, Xian Jiatong-Liverpool University, Suzhou, China
Venue:
Mathematics and Computers in Simulation
Year:
2009

Citing 13
Cited 0

The shrinking generator

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Theory and Applications of Cellular Automata in Cryptography

IEEE Transactions on Computers
Built-In Test for Circuits with Scan Based on Reseeding of Multiple-Polynomial Linear Feedback Shift Registers

IEEE Transactions on Computers - Special issue on fault-tolerant computing
Minimal cost one-dimensional linear hybrid cellular automata of degree through 500

Journal of Electronic Testing: Theory and Applications
Good random number generators are (not so) easy to find

Selected papers from the 2nd IMACS symposium on Mathematical modelling---2nd MATHMOD
On the Generation of High-Quality Random Numbers by Two-Dimensional Cellular Automata

IEEE Transactions on Computers
Cellular Automata-Based Recursive Pseudoexhaustive Test Pattern Generator

IEEE Transactions on Computers
Shift Register Sequences

Shift Register Sequences
Test-decompression mechanism using a variable-length multiple-polynomial LFSR

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Cellular automata computations and secret key cryptography

Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
An evolutionary approach to the design of controllable cellular automata structure for random number generation

IEEE Transactions on Evolutionary Computation
2-D CA variation with asymmetric neighborship for pseudorandom number generation

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Pseudorandom number generation with self-programmable cellular automata

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper uses the DIEHARD statistical test suite to test the randomness quality of ''permuted'' versions of maximum length sequences generated by linear finite state machines (LFSM) such as cellular automata and linear feedback shift registers. Analysis shows that permuted sequences can be equivalently generated by using time-varying transformations derived from the original LFSM. Based on the above, we suggest the permuted transformation sequence scheme. Experimental results show that DIEHARD results are improved with respect to the original non-permuted sequences-up to seven more tests can be passed (total of 19 tests). Furthermore, a permutation vector is used to generate cyclically distinct permuted sequences and each sequence has a desirable maximum length period of 2^n-1.