Abstract
This paper discusses the linear complexity property of binary sequences generated using matrix recurrence relation defined over Z4. Generally algorithm to generate random number is based on recursion with seed value/values. In this paper a linear recursion sequence of matrices or vectors over Z 4 is generated from which random binary sequence is obtained. It is shown that such sequences have large linear complexity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have