Paper 2020/989 Original: eprint.iacr.org/2020/989 ↗

Algorithm for SIS and MultiSIS problems

Igor Semaev
Abstract

SIS problem has numerous applications in cryptography. The known algorithms for solving that problem are exponential in complexity. A new algorithm is suggested in this note, its complexity is sub-exponential for a range of parameters.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint.
History
2020-08-18: last updated
2020-08-18: published
Short URL
https://ia.cr/2020/989
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2020/989,
      author = {Igor Semaev},
      title = {Algorithm for SIS and MultiSIS problems},
      howpublished = {Cryptology {ePrint} Archive, Paper 2020/989},
      year = {2020},
      url = {https://eprint.iacr.org/2020/989}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.