{"title":"p^2+p+1因子分解算法与密码学","authors":"M. Lee, V. Vavrek, S. P. Balakannan","doi":"10.1109/SECTECH.2008.31","DOIUrl":null,"url":null,"abstract":"Factorization of large integers gives a method to successfully attack on RSA cryptosystem algorithm. Williams p+1 gives us such algorithm to factorize the integer n; if there exists a prime divisor p, such that p+1 will have only a small prime divisors. In this paper we demonstrate this algorithm using matrices and show that the method can be generalized.","PeriodicalId":377461,"journal":{"name":"2008 International Conference on Security Technology","volume":"2010 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A p^2+p+1 Factoring Algorithm and Cryptography\",\"authors\":\"M. Lee, V. Vavrek, S. P. Balakannan\",\"doi\":\"10.1109/SECTECH.2008.31\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Factorization of large integers gives a method to successfully attack on RSA cryptosystem algorithm. Williams p+1 gives us such algorithm to factorize the integer n; if there exists a prime divisor p, such that p+1 will have only a small prime divisors. In this paper we demonstrate this algorithm using matrices and show that the method can be generalized.\",\"PeriodicalId\":377461,\"journal\":{\"name\":\"2008 International Conference on Security Technology\",\"volume\":\"2010 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Conference on Security Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SECTECH.2008.31\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Security Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECTECH.2008.31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Factorization of large integers gives a method to successfully attack on RSA cryptosystem algorithm. Williams p+1 gives us such algorithm to factorize the integer n; if there exists a prime divisor p, such that p+1 will have only a small prime divisors. In this paper we demonstrate this algorithm using matrices and show that the method can be generalized.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
