Improved algorithms for finding low-weight polynomial multiples in $$\mathbb {F}_{2}^{}[x]$$ F 2 [ x ] and some cryptographic applications
Crossref DOI link: https://doi.org/10.1007/s10623-014-9960-6
Published Online: 2014-04-24
Published Print: 2014-11
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Löndahl, Carl
Johansson, Thomas
Text and Data Mining valid from 2014-04-24