Finding low-weight polynomial multiples using discrete logarithm

Details Finding low-weight polynomial multiples using discrete logarithm Finding low-weight polynomial multiples using discrete logarithm

2007-01-10

arxiv.org/abs/cs/0701069v3

Dans IEEE International Symposium on Information Theory - ISIT'07 (2007)

Computer Science

Cryptography and Security

Scientific paper

Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The classical algorithm to solve this problem is based on a time memory trade-off. We will present an improvement to this approach using discrete logarithm rather than a direct representation of the involved polynomials. This gives an algorithm which improves the theoretical complexity, and is also very flexible in practice.

Affiliated with

Also associated with

No associations

Rating

Finding low-weight polynomial multiples using discrete logarithm 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 Finding low-weight polynomial multiples using discrete logarithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding low-weight polynomial multiples using discrete logarithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-447683