879 research outputs found
A Discrete Logarithm-based Approach to Compute Low-Weight Multiples of Binary Polynomials
Being able to compute efficiently a low-weight multiple of a given binary
polynomial is often a key ingredient of correlation attacks to LFSR-based
stream ciphers. The best known general purpose algorithm is based on the
generalized birthday problem. We describe an alternative approach which is
based on discrete logarithms and has much lower memory complexity requirements
with a comparable time complexity.Comment: 12 page
Exchangeable pairs and Poisson approximation
This is a survey paper on Poisson approximation using Stein's method of
exchangeable pairs. We illustrate using Poisson-binomial trials and many
variations on three classical problems of combinatorial probability: the
matching problem, the coupon collector's problem, and the birthday problem.
While many details are new, the results are closely related to a body of work
developed by Andrew Barbour, Louis Chen, Richard Arratia, Lou Gordon, Larry
Goldstein, and their collaborators. Some comparison with these other approaches
is offered.Comment: Published at http://dx.doi.org/10.1214/154957805100000096 in the
Probability Surveys (http://www.i-journals.org/ps/) by the Institute of
Mathematical Statistics (http://www.imstat.org
- …