using LLL-Reduction for solving RSA snd Factorization Problem.pdf

using LLL-Reduction for solving RSA snd Factorization Problem.pdf

ID:34589295

大小:296.72 KB

页数:29页

时间:2019-03-08

using LLL-Reduction for solving RSA snd Factorization Problem.pdf_第1页
using LLL-Reduction for solving RSA snd Factorization Problem.pdf_第2页
using LLL-Reduction for solving RSA snd Factorization Problem.pdf_第3页
using LLL-Reduction for solving RSA snd Factorization Problem.pdf_第4页
using LLL-Reduction for solving RSA snd Factorization Problem.pdf_第5页
资源描述:

《using LLL-Reduction for solving RSA snd Factorization Problem.pdf》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、UsingLLL-ReductionforSolvingRSAandFactorizationProblems:ASurveyAlexanderMayDepartmentofComputerScienceTUDarmstadt64289Darmstadt,Germanymay@informatik.tu-darmstadt.deAbstract.25yearsago,Lenstra,LenstraandLovaszpresentedtheircelebratedLLLlatticereductio

2、nalgorithm.AmongthevariousapplicationsoftheLLLalgorithmisamethodduetoCoppersmithforfindingsmallrootsofpolynomialequations.WegiveasurveyoftheapplicationsofthisrootfindingmethodtotheproblemofinvertingtheRSAfunctionandthefactorizationproblem.Aswewillsee,mo

3、stoftheresultsareofadualnature:Theycaneitherbeinterpretedascryptanalyticresultsorashardness/securityresults.Keywords:LLLreduction,Coppersmith’smethod,RSA,Factoring1IntroductionTheRSAcryptosysteminventedbyRivest,ShamirandAdleman[74]in1977istoday’smosti

4、mportantpublic-keycryptosystem.LetusdenotebyN=pqanRSA-moduluswhichistheproductoftwoprimesp,qofthesamebit-size.Letebeanintegerco-primetoEuler’stotientfunctionφ(N)=(p−1)(q−1).TheRSAencryptionfunctiontakesamessagemtotheethpowerintheringZN.ThesecurityofRS

5、AreliesonthedifficultyofinvertingtheRSAencryptionfunctionontheaverage,i.e.extractingethrootsintheringZN.WecallthisproblemtheRSAinversionproblemortheRSAproblemforshort.Letdbetheinverseofemoduloφ(N).ComputingdthpowersinZNinvertstheRSAencryptionfunction.Si

6、ncedcanbeeasilycomputedwhentheprimefactorizationofNisknown,theRSAcryptosystemisatmostassecureastheproblemofcomputingdandtheproblemoffactoringN.Indeed,onecanshowthatthelasttwoproblemsarepolynomialtimeequivalent.However,itisoneofthemostchallengingproble

7、mstoproveordisprovethepolynomialtimeequivalenceoftheRSAproblemandtheproblemoffactoringN.Thereareresultsthattheseproblemsarenotequivalentunderrestrictedreductions[20].Ontheotherhand,onecanshowthatinrestrictedgenericattackmodels,bothproblemsappeartobeeq

8、uivalent[21,57].DespiteconsiderableeffortstoattackRSA(see[11,53]forsurveys),thecurrentlybestwayisstilltofactortheRSAmodulus.Consequently,researchersfocussedforalongtimeontheconstructionoffactorizationalgorithmsforattackingRSA.Inthisfactorizatio

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。