A special purpose integer factorization algorithm

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一个专用的整数分解算法
大整数的因数分解是一个重要的数学问题,在公钥密码学中有实际应用。它被认为是密码分析的一部分。因式分解的进展往往会削弱现有的高效公钥密码系统。尝试除法、Pollard rho、Pollard p-1、二次筛、Lenstra椭圆曲线和Number field筛等算法可用于求解整数分解问题。本文提出了一种求两个素数乘积的合数因子的专用分解算法。讨论了该方案的运行时间复杂度。从理论上证明了该方案的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Comparison of Back Propagation, Long Short-Term Memory (LSTM), Attention-Based LSTM Neural Networks Application in Futures Market of China using R Programming Analysis of Different Methods for Measuring the Performance of Database on Cloud Environment A Study of Scheduling Algorithms to Maintain Small Overflow Probability in Cellular Networks with a Single Cell Karnaugh Map Approach for Mining Frequent Termset from Uncertain Textual Data Software Debugging By Developing and Comparing Very Close Successful Inputs with Failure Inducing Unsuccessful Inputs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1