Fast Algorithm to solve a family of SIS problem with l_\infty norm

Jintai Ding Southern Chinese University of Technology; University of Cincinnati

TBD mathscidoc: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.
No keywords uploaded!
[ Download ] [ 2022-07-21 14:56:17 uploaded by dingjt ] [ 14 downloads ] [ 0 comments ]
@inproceedings{jintai2010fast,
  title={Fast Algorithm to solve a family of SIS problem with l_\infty norm},
  author={Jintai Ding},
  url={http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20220721145617414320689},
  booktitle={IACR Cryptol. ePrint Arch.},
  year={2010},
}
Jintai Ding. Fast Algorithm to solve a family of SIS problem with l_\infty norm. 2010. In IACR Cryptol. ePrint Arch.. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20220721145617414320689.
Please log in for comment!
 
 
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved