A Discrete Logarithm-based Approach to Compute Low-Weight Multiples of Binary Polynomials
Discrete Mathematics
2016-04-01 v2 Cryptography and Security
Information Theory
math.IT
Abstract
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.
Keywords
Cite
@article{arxiv.1411.4024,
title = {A Discrete Logarithm-based Approach to Compute Low-Weight Multiples of Binary Polynomials},
author = {P. Peterlongo and M. Sala and C. Tinnirello},
journal= {arXiv preprint arXiv:1411.4024},
year = {2016}
}
Comments
12 pages