全部文献期刊会议图书|学者科研项目
中外文文献  中文文献  外文文献
作者:Laurence T. Yang , Li Xu , Sang-Soo Yeo ...
来源:[J].Computers and Mathematics with Applications(IF 2.069), 2010, Vol.60 (2), pp.338-346
摘要:Abstract(#br)Integer factorization is known to be one of the most important and useful methods in number theory and arithmetic. It also has a very close relationship to some algorithms in cryptography such as RSA algorithm. The RSA cryptosystem is one of the most popular and attr...
作者:Qi Wang , Xiubin Fan , Hongyan Zang ...
来源:[J].Theoretical Computer Science(IF 0.489), 2016, Vol.630, pp.76-94
摘要:Abstract(#br)The General Number Sieve is the most efficient algorithm for integer factorization. It consists of polynomial selection, sieving, solving equations and finding square roots. Root lifting of polynomial is discussed in this paper. The p - adic evaluation provided by ea...
作者:Mohit Mishra , Utkarsh Chaturvedi , K. K. Shukla
来源:[J].Soft Computing(IF 1.124), 2016, Vol.20 (9), pp.3363-3371
摘要:Abstract(#br)Integer factorization is a vital number theoretic problem finding frequent use in public key cryptography, and other areas like Fourier transforms. There has been growing interest among researchers in innovative alternative approaches to solving the problem by modeli...
作者:Chandrashekhar Meshram
来源:[J].Information Processing Letters(IF 0.488), 2015, Vol.115 (2), pp.351-358
摘要:... In this paper, we propose a new construction of ID-based encryption scheme based on integer factorization problem and discrete logarithm problem is semantically secure against chosen plaintext attack (CPA) in random oracle model. We demonstrate that our scheme outperforms the...
作者:Ghaith A. Hiary
来源:[J].Mathematics of Computation(IF 1.366), 2015, Vol.85 (300), pp.2065-2069
摘要:A deterministic algorithm for factoring $ n$ $ n^{1/3+o(1)}$ by all the integers in a short interval at once rather than integer by integer as in trial division. The algorithm is implemented.
作者:Laurence T. Yang , Ying Huang , Jun Feng ...
来源:[J].Information Sciences(IF 3.643), 2017, Vol.379, pp.257-273
摘要:... The security of the RSA algorithm lies in the difficulty of factoring large integers efficiently and the General Number Field Sieve (GNFS) algorithm is the most efficient algorithm for factoring integers greater than 110 digits at present. In this paper, targeted to speed up ...
作者:Gireesh Pandey , S.K. Pal
来源:[J].Perspectives in Science, 2016, Vol.8, pp.101-103
摘要:Summary(#br)The general number field sieve (GNFS) is the fastest algorithm for factoring large composite integers which is made up by two prime numbers. Polynomial selection is an important step of GNFS. The asymptotic runtime depends on choice of good polynomial pairs. In this p...
作者:Bartosz Źrałek
来源:[J].Mathematics of Computation(IF 1.366), 2018, Vol.88 (317), pp.1261-1272
摘要:According to a theorem of Coppersmith, Howgrave-Graham, and Nagaraj, relying on lattice basis reduction, the divisors of an integer $ n$ which lie in some fixed residue class modulo a given integer $ A$ can be computed efficiently if $ A$ is large enough. We extend their algorith...
作者:Kefa Rabah
来源:[J].Journal of Applied Sciences, 2006, Vol.6 (2), pp.458
摘要:... In recent years the best known integer factorization algorithms have improved greatly, to the point where it is now easy to factor a 100-decimal digit number and possible to factor larger than 250 decimal digits, given the availability of enough computing power. However, the ...
作者:Boris S. Verkhovsky
来源:[J].Journal of Computer Science, 2009, Vol.5 (9), pp.674
摘要:Problem statement: During the last thirty years many public-key cryptographic protocols based on either the complexity of integer factorization of large semiprimes or the Discrete Logarithm Problem (DLP) have been developed. Approach: Although several factorization algorithm...

我们正在为您处理中,这可能需要一些时间,请稍等。

资源合作:cnki.scholar@cnki.net, +86-10-82896619   意见反馈:scholar@cnki.net

×