Paper 2007/423
Finding Low Weight Polynomial Multiples Using Lattices
Laila El Aimani and Joachim von zur Gathen
Abstract
The low weight polynomial multiple problem arises in the context of stream ciphers
cryptanalysis and of efficient finite field arithmetic, and is believed to be difficult. It can be formulated as follows: given
a polynomial
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. stream ciphers analysis, low weight polynmial multiples, lattices, shortest vector
- Keywords
- stream ciphers analysislow weight polynomial multipleslatticesshortest vector.
- Contact author(s)
- elaimani @ bit uni-bonn de
- History
- 2009-08-17: last of 3 revisions
- 2007-11-18: received
- See all versions
- Short URL
- https://ia.cr/2007/423
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2007/423, author = {Laila El Aimani and Joachim von zur Gathen}, title = {Finding Low Weight Polynomial Multiples Using Lattices}, howpublished = {Cryptology {ePrint} Archive, Paper 2007/423}, year = {2007}, url = {https://eprint.iacr.org/2007/423} }