A special purpose integer factorization algorithm

Authors:
Porkodi Chinniah;Nagarathnam Muthusamy;Arumuganathan Ramalingam
Affiliations:
PSG College of Technology, Coimbatore;Carnegie Mellon University, Pittsburgh;PSG College of Technology, Coimbatore
Venue:
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
Year:
2012

Citing 10
Cited 0

A simple unpredictable pseudo random number generator

SIAM Journal on Computing
An efficient probabilistic public key encryption scheme which hides all partial information

Proceedings of CRYPTO 84 on Advances in cryptology
The quadratic sieve factoring algorithm

Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Lenstra's factorisation method based on elliptic curves

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Parallel algorithms for integer factorisation

Number theory and cryptography
Integer Factoring

Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Cryptography: Theory and Practice

Cryptography: Theory and Practice
Handbook of Applied Cryptography

Handbook of Applied Cryptography
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION

DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION

Quantified Score

Hi-index	0.00

Visualization

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.