Pollard的rho啟發(fā)式方法用于啟發(fā)式求解大整數(shù)n分解因子，具體要結(jié)合導(dǎo)論中來(lái)理解，參考代碼如下：

package cn.ansj;import java.math.BigInteger; import java.security.SecureRandom;class PollardRho{private final static BigInteger ZERO = new BigInteger("0");private final static BigInteger ONE = new BigInteger("1");private final static BigInteger TWO = new BigInteger("2");private final static SecureRandom random = new SecureRandom();public static BigInteger rho(BigInteger N) {BigInteger divisor;BigInteger c = new BigInteger(N.bitLength(), random);BigInteger x = new BigInteger(N.bitLength(), random);BigInteger xx = x;if (N.mod(TWO).compareTo(ZERO) == 0) return TWO;do {x = x.multiply(x).mod(N).add(c).mod(N);xx = xx.multiply(xx).mod(N).add(c).mod(N);xx = xx.multiply(xx).mod(N).add(c).mod(N);divisor = x.subtract(xx).gcd(N);} while((divisor.compareTo(ONE)) == 0);return divisor;}public static void factor(BigInteger N) {if (N.compareTo(ONE) == 0) return;if (N.isProbablePrime(20)) { System.out.println(N); return; }BigInteger divisor = rho(N);factor(divisor);factor(N.divide(divisor));}public static void main(String[] args) {BigInteger N = BigInteger.valueOf(96879);System.out.println(N);factor(N);} } 執(zhí)行結(jié)果：

96879 3 43 751

總結(jié)

以上是生活随笔為你收集整理的Java实现算法导论中Pollard的rho启发式方法的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。