A Simple Computational Model for Acceptance/Rejection of Binary Sequence Generators

Details A Simple Computational Model for Acceptance/Rejection of Binary Sequence Generators A Simple Computational Model for Acceptance/Rejection of Binary Sequence Generators

2010-05-13

arxiv.org/abs/1005.2277v1

Applied Mathematical Modelling. Volume 31, Issue 8, pp. 1548-1558. August 2007.

Computer Science

Cryptography and Security

16 pages, 0 figures

Scientific paper

10.1016/j.apm.2006.05.004

A simple binary model to compute the degree of balancedness in the output sequence of LFSR-combinational generators has been developed. The computational method is based exclusively on the handling of binary strings by means of logic operations. The proposed model can serve as a deterministic alternative to existing probabilistic methods for checking balancedness in binary sequence generators. The procedure here described can be devised as a first selective criterium for acceptance/rejection of this type of generators.

Affiliated with

Also associated with

No associations

Rating

A Simple Computational Model for Acceptance/Rejection of Binary Sequence Generators 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 A Simple Computational Model for Acceptance/Rejection of Binary Sequence Generators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Simple Computational Model for Acceptance/Rejection of Binary Sequence Generators will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-640433