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.
A discrete logarithm-based approach to compute low-weight multiples of binary polynomials / Peterlongo, Pietro; Sala, Massimiliano; Tinnirello, Claudia. - In: FINITE FIELDS AND THEIR APPLICATIONS. - ISSN 1071-5797. - STAMPA. - 38:(2016), pp. 57-71. [10.1016/j.ffa.2015.12.005]
A discrete logarithm-based approach to compute low-weight multiples of binary polynomials
Peterlongo, Pietro;Sala, Massimiliano;Tinnirello, Claudia
2016-01-01
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.| File | Dimensione | Formato | |
|---|---|---|---|
|
sala_peterlongo_tinnirello_2016.pdf
accesso aperto
Descrizione: preprint arxiv
Tipologia:
Pre-print non referato (Non-refereed preprint)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
99.01 kB
Formato
Adobe PDF
|
99.01 kB | Adobe PDF | Visualizza/Apri |
|
1-s2.0-S1071579715001240-main.pdf
Solo gestori archivio
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
373.26 kB
Formato
Adobe PDF
|
373.26 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
