{"title":"改进的RSA算法:一种安全的方法","authors":"Aayush Chhabra, S. Mathur","doi":"10.1109/CICN.2011.117","DOIUrl":null,"url":null,"abstract":"In this paper we introduce an approach which is more secure than original RSA algorithm, which is used for digital signatures and encryption in public key cryptography. This approach eliminates the need to transfer n, the product of two random but essentially big prime numbers, in the public key due to which it becomes difficult for the intruder to guess the factors of n and hence the encrypted message remains safe from the hackers. Thus this approach provides a more secure path for transmission and reception of messages through public key cryptography.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"183 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":"{\"title\":\"Modified RSA Algorithm: A Secure Approach\",\"authors\":\"Aayush Chhabra, S. Mathur\",\"doi\":\"10.1109/CICN.2011.117\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we introduce an approach which is more secure than original RSA algorithm, which is used for digital signatures and encryption in public key cryptography. This approach eliminates the need to transfer n, the product of two random but essentially big prime numbers, in the public key due to which it becomes difficult for the intruder to guess the factors of n and hence the encrypted message remains safe from the hackers. Thus this approach provides a more secure path for transmission and reception of messages through public key cryptography.\",\"PeriodicalId\":292190,\"journal\":{\"name\":\"2011 International Conference on Computational Intelligence and Communication Networks\",\"volume\":\"183 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"27\",\"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.117\",\"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.117","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper we introduce an approach which is more secure than original RSA algorithm, which is used for digital signatures and encryption in public key cryptography. This approach eliminates the need to transfer n, the product of two random but essentially big prime numbers, in the public key due to which it becomes difficult for the intruder to guess the factors of n and hence the encrypted message remains safe from the hackers. Thus this approach provides a more secure path for transmission and reception of messages through public key cryptography.