# MathSciDoc: An Archive for Mathematician ∫

#### TBDmathscidoc:2207.43107

IACR Cryptol. ePrint Arch., 2010.11
In this paper, we present a new algorithm, such that, for the small integer solution (SIS) problem, if the solution is bounded ( by an integer \beta in l_\infty norm, which we call a bounded SIS (BSIS) problem, {\it and if the difference between the row dimension n and the column dimension m of the corresponding matrix is relatively small with respect the row dimension m}, we can solve it easily with a complexity of polynomial in m.
@inproceedings{jintai2010fast,