Porkodi Chinniah, Nagarathnam Muthusamy, A. Ramalingam
{"title":"A special purpose integer factorization algorithm","authors":"Porkodi Chinniah, Nagarathnam Muthusamy, A. Ramalingam","doi":"10.1145/2393216.2393246","DOIUrl":null,"url":null,"abstract":"Factorization of large integers is a significant mathematical problem with practical applications to public key cryptography. It is considered to be a part of cryptanalysis. The progress in factoring tends to weaken the existing efficient public key cryptosystems. Several algorithms such as trial division, Pollard rho, Pollard p-1, Quadratic sieve, Lenstra's elliptic curve and Number field sieve are available to solve the integer factorization problem. In this paper a special purpose factorization algorithm is proposed to find the factors of a composite number which is the product of two primes. The running time complexity of the proposed scheme is discussed. The efficiency of the scheme is proved theoretically.","PeriodicalId":90853,"journal":{"name":"International journal of advanced computer science","volume":"4 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2012-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/2393216.2393246","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International journal of advanced computer science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2393216.2393246","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Factorization of large integers is a significant mathematical problem with practical applications to public key cryptography. It is considered to be a part of cryptanalysis. The progress in factoring tends to weaken the existing efficient public key cryptosystems. Several algorithms such as trial division, Pollard rho, Pollard p-1, Quadratic sieve, Lenstra's elliptic curve and Number field sieve are available to solve the integer factorization problem. In this paper a special purpose factorization algorithm is proposed to find the factors of a composite number which is the product of two primes. The running time complexity of the proposed scheme is discussed. The efficiency of the scheme is proved theoretically.