small primitive roots and malleability of rsa moduli

small primitive roots and malleability of rsa moduli

ID:34488718

大小:119.80 KB

页数:8页

时间:2019-03-06

small primitive roots and malleability of rsa moduli_第1页
small primitive roots and malleability of rsa moduli_第2页
small primitive roots and malleability of rsa moduli_第3页
small primitive roots and malleability of rsa moduli_第4页
small primitive roots and malleability of rsa moduli_第5页
资源描述:

《small primitive roots and malleability of rsa moduli》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、SmallprimitiverootsandmalleabilityofRSAmoduliLuisDieulefait†,JorgeJim´enezUrroz∗†Dept.Algebra.UniversitatdeBarcelona´∗Dept.Matem`aticaAplicadaIV.UniversitatPolit`ecnicadeCatalunyaCampusNord,c/JordiGirona,1-3,08034Barcelonae-mail:ldieulefait@ub.es,jjimenez@ma

2、4.upc.eduAbstractIntheirpaper[9],P.PaillierandJ.VillarmakeaconjectureaboutthemalleabilityofanRSAmodulus.Inthispaperwepresentanexplicitalgo-rithmrefutingtheconjecture.ConcretelywecanfactorizeanRSAmodulusnusingverylittleinformationonthefactorizationofaconcrete

3、n′coprimeton.However,webelievetheconjecturemightbetrue,whenimposingsomeextraconditionsontheauxiliaryn′allowedtobeused.Inparticular,thepapershowshowsubtlethenotionofmalleabilityis.Keywords:Cryptography,RSA,Malleability,primitiveroots1IntroductionTheexistenceo

4、fatradeoffbetweenone-waynessandchosenciphertextsecuritydatesarXiv:0801.0030v1[math.NT]29Dec2007backtotheeightieswhen,forexample,itwasobservedin[10,11,4].Insomesense,onecannotachieveone-wayencryptionwithalevelofsecurityequivalenttosolvecertaindifficultproblem,at

5、thesametimeasthecryptosystembeingIND-CCAse-curerespecttoit.Thissocalledparadoxhasbeenattemptedtobeformallyprovedmanytimes,byanumberofauthors,sincefirstobserved.Howevernoonesucceededuntilveryrecently,whenPaillerandVillar(cf.[9])clarifiedthequestionforthecaseoff

6、actoring-basedcryptosystems.Inparticular,theygivepreciseconditionsforcertainsecurityincompatibilitiestoexist.Moreprecisely,theyreformulatetheparadoxintermsofkeypreservingblack-boxreductionsandprovethatiffactoringcanbereducedinthestandardmodeltobreakingone-wa

7、ynessofthecryptosystemthenitisimpossibletoachievechosen-cyphertextsecurity.Astheauthorsmentionintheirpaper(cf.[9]),combiningthisresultwiththesecurityproofscontainedin[2,3]givesaveryinterestingseparationresultbetweentheRandomOraclemodel1andthestandardmodel.Mo

8、reover,assuminganextrahypothesis,whichtheycall“non-malleability”ofthekeygenerator,theyareabletoextendtheresultfromkeypreservingblackboxreductionstothecaseofarbitraryblackboxreductions.Hence,asth

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

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

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