5 results for “Integer Factorization”

Set a search alert

Research ArticleOpen accessPhrase in the titleInteger Factorization: Solution via Algorithm for Constrained Discrete Logarithm ProblemBoris S. VerkhovskyProblem 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 algorithms with sub-exponential complexity have been discovered, the recent RSA Factoring Challenge demonstrated that it was still necessary to use several thousand computers working in … …Journal of Computer Science, Vol. 5, Issue 9 · 30 Dec 2009 · 7,156 accessesView PDF Cite

Research ArticleOpen accessIn the keywordsFast Approach to Factorize Odd Integers with Special DivisorsXingbo Wang, Junjian ZhongThe paper proves that an odd composite integer N can be factorized in O((log2N)4) bit operations if N = pq, the divisor q is of the form 2αu +1 or 2αu-1 with u being an odd integer and α being a positive integer and the other divisor p satisfies 1 …Journal of Mathematics and Statistics, Vol. 16, Issue 1 · 27 Jan 2020 · 7,436 accessesView PDF Cite

Research ArticleOpen accessIn the keywordsCERTIFICATE AUTHORITY SCHEMES USING ELLIPTIC CURVE CRYPTOGRAPHY, RSA AND THEIR VARIANTS-SIMULATION USING NS2S. Shivkumar, G. UmamaheswariA PKI (public key infrastructure) enables users of a basically unsecure public network to securely and privately exchange data through the use of a public and a private cryptographic key pair that is obtained and shared through a trusted authority. The public key infrastructure provides for a digital certificate that can identify an individual or an organization and directory services … …American Journal of Applied Sciences, Vol. 11, Issue 2 · 18 Dec 2013 · 7,379 accessesView PDF Cite

Research ArticleOpen accessIn the abstractAccelerated Search for Gaussian Generator Based on Triple Prime IntegersBoris S. Verkhovsky, Md Shiblee SadikProblem statement: Modern cryptographic algorithms are based on complexity of two problems: Integer factorization of real integers and a Discrete Logarithm Problem (DLP). Approach: The latter problem is even more complicated in the domain of complex integers, where Public Key Cryptosystems (PKC) had an advantage over analogous encryption-decryption protocols in arithmetic of real integers modulo p: The former PKC have … …Journal of Computer Science, Vol. 5, Issue 9 · 30 Sep 2009 · 6,517 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordMathematical Attacks on RSA CryptosystemImad K. Salah, Abdullah Darwish, Saleh OqeiliIn this paper some of the most common attacks against Rivest, Shamir, and Adleman (RSA) cryptosystem are presented. We describe the integer factoring attacks, attacks on the underlying mathematical function, as well as attacks that exploit details in implementations of the algorithm. Algorithms for each type of attacks are developed and analyzed by their complexity, memory requirements and area of … …Journal of Computer Science, Vol. 2, Issue 8 · 31 Aug 2006 · 8,420 accessesView PDF Cite