Computing the biases of parity-check relations

Details Computing the biases of parity-check relations Computing the biases of parity-check relations

2009-04-28

arxiv.org/abs/0904.4412v1

2009 IEEE International Symposium on Information Theory (ISIT2009), Seoul : Cor\'ee, R\'epublique de (2009)

Computer Science

Cryptography and Security

Scientific paper

A divide-and-conquer cryptanalysis can often be mounted against some keystream generators composed of several (nonlinear) independent devices combined by a Boolean function. In particular, any parity-check relation derived from the periods of some constituent sequences usually leads to a distinguishing attack whose complexity is determined by the bias of the relation. However, estimating this bias is a difficult problem since the piling-up lemma cannot be used. Here, we give two exact expressions for this bias. Most notably, these expressions lead to a new algorithm for computing the bias of a parity-check relation, and they also provide some simple formulae for this bias in some particular cases which are commonly used in cryptography.

Affiliated with

Also associated with

No associations

Rating

Computing the biases of parity-check relations 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 Computing the biases of parity-check relations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing the biases of parity-check relations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-713171