Pietro Peterlongo

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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(More)
  • 1