Factoring a semiprime n by estimating φ(n) Kyle Kloster May 7, 2010 Abstract A factoring algorithm, called the Phi-Finder algorithm, is presented that factors a product of two primes, n = pq, by determining φ(n). The - Factoring - Document - PDFSEARCH.IO

First Page	Meta Content
	Factoring a semiprime n by estimating φ(n) Kyle Kloster May 7, 2010 Abstract A factoring algorithm, called the Phi-Finder algorithm, is presented that factors a product of two primes, n = pq, by determining φ(n). The Add to Reading List Document Date: 2017-11-24 12:06:22 Open Document File Size: 256,38 KB Share Result on Facebook

Factoring a semiprime n by estimating φ(n) Kyle Kloster May 7, 2010 Abstract A factoring algorithm, called the Phi-Finder algorithm, is presented that factors a product of two primes, n = pq, by determining φ(n). TheAdd to Reading List