2000 character limit reached
Algorithm for SIS and MultiSIS problems
Published 17 Aug 2020 in cs.CR, cs.DS, and math.NT | (2008.07216v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.