{"title":"基于形式化验证方法的RSA攻击分析","authors":"Sachin Upadhyay, Yashpal Singh","doi":"10.1109/CICN.2011.33","DOIUrl":null,"url":null,"abstract":"By considering the old results if the private exponent d used in RSA cryptosystem is less than n^0.292 than the system is insecure. So the problem is that we need to consider a very big prime numbers in order to make our system secure. Our approach will help to increase the range of private exponent d up to n^0.5. This will help the individual to have bigger ranges regarding the prime numbers, so that the system remains secure to a greater extent.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"645 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Analysis of Attack on RSA through Formal Verification Methods\",\"authors\":\"Sachin Upadhyay, Yashpal Singh\",\"doi\":\"10.1109/CICN.2011.33\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"By considering the old results if the private exponent d used in RSA cryptosystem is less than n^0.292 than the system is insecure. So the problem is that we need to consider a very big prime numbers in order to make our system secure. Our approach will help to increase the range of private exponent d up to n^0.5. This will help the individual to have bigger ranges regarding the prime numbers, so that the system remains secure to a greater extent.\",\"PeriodicalId\":292190,\"journal\":{\"name\":\"2011 International Conference on Computational Intelligence and Communication Networks\",\"volume\":\"645 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Computational Intelligence and Communication Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CICN.2011.33\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Computational Intelligence and Communication Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CICN.2011.33","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Analysis of Attack on RSA through Formal Verification Methods
By considering the old results if the private exponent d used in RSA cryptosystem is less than n^0.292 than the system is insecure. So the problem is that we need to consider a very big prime numbers in order to make our system secure. Our approach will help to increase the range of private exponent d up to n^0.5. This will help the individual to have bigger ranges regarding the prime numbers, so that the system remains secure to a greater extent.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
