Algorithm for SIS and MultiSIS problems

You are looking at a specific version 20200818:083913 of this paper. See the latest version.

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 problem MultiSIS problem matrices complexity
Contact author(s): igor @ ii uib no
History: 2020-08-18: received
Short URL: https://ia.cr/2020/989
License: CC BY