Finding low-weight polynomial multiples using discrete logarithm
| dc.creator | Didier, Frédéric | |
| dc.creator | Laigle-Chapuy, Yann | |
| dc.date | 2007-01-10 | |
| dc.date | 2007-07-12 | |
| dc.date.accessioned | 2026-07-07T08:15:52Z | |
| dc.date.available | 2026-07-07T08:15:52Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/cs/0701069 | |
| dc.identifier | http://arxiv.org/abs/cs/0701069 | |
| dc.identifier | Dans IEEE International Symposium on Information Theory - ISIT'07 (2007) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133589 | |
| dc.subject | Cryptography and Security | |
| dc.title | Finding low-weight polynomial multiples using discrete logarithm | |
| dc.type | text |