This is the pseudo code for calculating integer factorisation took from CLRS. But what is the point in calculating GCD involved in Line 8 and the need for doubling k when i == k in Line 13.? Help please.
What is the reason behind calculating GCD in Pollard rho integer factorisation?
716 views Asked by DCoder At
1
There are 1 answers
Related Questions in ALGORITHM
- Python: Calculating the growth rate over a year when the dates aren't the same
- Python TypeError: argument to string formatting
- How to make a jump difussion graphic
- Using R to download file from https with login credentials
- Error in "Quandl" while pulling data for commodity in R
- Showing amount with currency
- Quandl - Converting JSON data into data frame uisng R
- How to get company website from a finance ticker (stock symbol)?
- Error while retrieving Volume data from Yahoo
- Pandas: use of aggregate with a MultiIndex
Related Questions in MATH
- Python: Calculating the growth rate over a year when the dates aren't the same
- Python TypeError: argument to string formatting
- How to make a jump difussion graphic
- Using R to download file from https with login credentials
- Error in "Quandl" while pulling data for commodity in R
- Showing amount with currency
- Quandl - Converting JSON data into data frame uisng R
- How to get company website from a finance ticker (stock symbol)?
- Error while retrieving Volume data from Yahoo
- Pandas: use of aggregate with a MultiIndex
Related Questions in GREATEST-COMMON-DIVISOR
- Python: Calculating the growth rate over a year when the dates aren't the same
- Python TypeError: argument to string formatting
- How to make a jump difussion graphic
- Using R to download file from https with login credentials
- Error in "Quandl" while pulling data for commodity in R
- Showing amount with currency
- Quandl - Converting JSON data into data frame uisng R
- How to get company website from a finance ticker (stock symbol)?
- Error while retrieving Volume data from Yahoo
- Pandas: use of aggregate with a MultiIndex
Related Questions in NUMBER-THEORY
- Python: Calculating the growth rate over a year when the dates aren't the same
- Python TypeError: argument to string formatting
- How to make a jump difussion graphic
- Using R to download file from https with login credentials
- Error in "Quandl" while pulling data for commodity in R
- Showing amount with currency
- Quandl - Converting JSON data into data frame uisng R
- How to get company website from a finance ticker (stock symbol)?
- Error while retrieving Volume data from Yahoo
- Pandas: use of aggregate with a MultiIndex
Related Questions in CLRS
- Python: Calculating the growth rate over a year when the dates aren't the same
- Python TypeError: argument to string formatting
- How to make a jump difussion graphic
- Using R to download file from https with login credentials
- Error in "Quandl" while pulling data for commodity in R
- Showing amount with currency
- Quandl - Converting JSON data into data frame uisng R
- How to get company website from a finance ticker (stock symbol)?
- Error while retrieving Volume data from Yahoo
- Pandas: use of aggregate with a MultiIndex
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
Popular Tags
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
That pseudocode is not Pollard-rho factorization despite the label. It is one trial of the related Brent's factorization method. In Pollard-rho factorization, in the ith step you compute x_i and x_(2i), and check the GCD of x_(2i)-x_i with n. In Brent's factorization method, you compute GCD(x_(2^a)-x_(2^a+b),n) for b=1,2, ..., 2^a. (I used the indices starting with 1 to agree with the pseudocode, but elsewhere the sequence is initialized with x_0.) In the code, k=2^a and i=2^a+b. When you detect that i has reached the next power of 2, you increase k to 2^(a+1).
GCDs can be computed very rapidly by Euclid's algorithm without knowing the factorizations of the numbers. Any time you find a nontrivial GCD with n, this helps you to factor n. In both Pollard-rho factorization and Brent's algorithm, one idea is that if you iterate a polynomial such as x^2-c, the differences between the values of the iterates mod n tend to be good candidates for numbers that share nontrivial factors with n. This is because (by the Chinese Remainder Theorem) iterating the polynomial mod n is the same as simultaneously iterating the polynomial mod each prime power in the prime factorization of n. If x_i=x_j mod p1^e1 but not mod p2^e2, then GCD(xi-xj,n) will have p1^e1 as a factor but not p2^e2, so it will be a nontrivial factor.
This is one trial because x_1 is initialized once. If you get unlucky, the value you choose for x_1 starts a preperiodic sequence that repeats at the same time mod each prime power in the prime factorization of n, even though n is not prime. For example, suppose n=1711=29*59, and x_1 = 4, x_2=15, x_3=224, x_4=556, x_5=1155, x_6=1155, ... This sequence does not help you to find a nontrivial factorization, since all of the GCDs of differences between distinct elements and 1711 are 1. If you start with x_1=5, then x_2=24, x_3=575, x_4=401, x_5=1677, x_6=1155, x_7=1155, ... In either factorization method, you would find that GCD(x_4-x_2,1711)=GCD(377,1711)=29, a nontrivial factor of 1711. Not only are some sequences not helpful, others might work, but it might be faster to give up and start with another initial value. So, normally you don't keep increasing i forever, normally there is a termination threshold where you might try a different initial value.