Algorithm for SIS and MultiSIS problems
Igor Semaev
TL;DR
This paper introduces a new sub-exponential algorithm for the SIS problem, which has significant implications for cryptography by potentially improving solution efficiency.
Contribution
The paper presents a novel algorithm for SIS and MultiSIS problems with sub-exponential complexity for certain parameters, advancing current solution methods.
Findings
Algorithm achieves sub-exponential complexity
Applicable to a range of parameters in SIS problems
Potential impact on cryptographic security
Abstract
SIS problem has numerous applications in cryptography. 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Coding theory and cryptography · Complexity and Algorithms in Graphs