Paper 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. MINOR revision.
Keywords
SIS problemMultiSIS problemmatricescomplexity
Contact author(s)
igor @ ii uib no
History
2020-08-18: received
Short URL
https://ia.cr/2020/989
License
Creative Commons Attribution
CC BY

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, eprint.iacr.org does not use cookies or embedded third party content.