A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Knapsack暗号への攻撃を効果的にするためのSampling Reductionの改良と考察(応用,数論アルゴリズムとその応用,<特集>平成20年研究部会連合発表)
Modification of Sampling Reduction for an Effective Attack against Knapsack Based Cryptosystems(Application,Algorithmic Number Theory and Its Application,Joint Symposium of JSIAM Activity Groups 2008)
2008
Nihon Oyo Suri Gakkai ronbunshi
Modification of Sampling Reduction for an Effective Attack against Knapsack Based Cryptosystems(Application,Algorithmic Number Theory and Its Application,Joint Symposium of JSIAM Activity Groups 2008)
Preserved Fulltext
. Lattice reduction algorithms are powerful tools for breaking knaps 肌 k based cryptosystems . In 2005 , Ludwig introduced a new lattice reduction algorithm called Sam − pling Reduction . In this paper , we explain Sampling Reduction would not be eHfective for the a . ttack against knapsack based cryptosystems by using our experimental results , Furthermore , we propose a Modi 丘ed Sampling Reduction , and also show that it is more effective than the original Sampling Reduction by using the experinlelltal results .
doi:10.11540/jsiamt.18.4_687
fatcat:un4fgishznezjfgiwswztwtzc4