AI Chat AI Image Generator AI Video Text to Speech

Algorithm for SIS and MultiSIS problems

08/17/2020

∙

by Igor Semaev, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 01/01/2018

A Fast Algorithm for Line Clipping by Convex Polyhedron in E3

A new algorithm for line clipping against convex polyhedron is given. Th...

0 Vaclav Skala, et al. ∙

research

∙ 06/22/2017

Computing the homology of basic semialgebraic sets in weak exponential time

We describe and analyze an algorithm for computing the homology (Betti n...

0 Felipe Cucker, et al. ∙

research

∙ 10/05/2020

A Note on Exponential-Time Algorithms for Linearwidth

In this note, we give an algorithm that computes the linearwidth of inpu...

0 Yasuaki Kobayashi, et al. ∙

research

∙ 03/30/2021

A note about claw function with a small range

In the claw detection problem we are given two functions f:D→ R and g:D→...

0 Andris Ambainis, et al. ∙

research

∙ 10/03/2022

Two new classes of exponential Runge-Kutta integrators for efficiently solving stiff systems or highly oscillatory problems

We study two new classes of exponential Runge-Kutta (ERK) integrators fo...

0 Bin Wang, et al. ∙

research

∙ 07/10/2018

Computing the Homology of Semialgebraic Sets I: Lax Formulas

We describe and analyze an algorithm for computing the homology (Betti n...

0 Peter Bürgisser, et al. ∙

research

∙ 09/16/2018

Calculation of extended gcd by normalization

We propose a new algorithm solving the extended gcd problem, which provi...

0 Marc Wolf, et al. ∙