Computer Science – Cryptography and Security
Scientific paper
2011-05-23
Computer Science
Cryptography and Security
8 pages, 2 figures
Scientific paper
Binary machines are a generalization of Feedback Shift Registers (FSRs) in which both, feedback and feedforward, connections are allowed and no chain connection between the register stages is required. In this paper, we present an algorithm for synthesis of binary machines with the minimum number of stages for a given degree of parallelization. Our experimental results show that for sequences with high linear complexity such as complementary, Legendre, or truly random, parallel binary machines are an order of magnitude smaller than parallel FSRs generating the same sequence. The presented approach can potentially be of advantage for any application which requires sequences with high spectrum efficiency or high security, such as data transmission, wireless communications, and cryptography.
No associations
LandOfFree
Synthesis of Parallel Binary Machines does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Synthesis of Parallel Binary Machines, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Synthesis of Parallel Binary Machines will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-22710