pell_factorization.pl 1.5 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667
  1. #!/usr/bin/perl
  2. # Daniel "Trizen" Șuteu
  3. # Date: 03 February 2019
  4. # https://github.com/trizen
  5. # A simple integer factorization method, using square root convergents.
  6. # See also:
  7. # https://en.wikipedia.org/wiki/Pell%27s_equation
  8. use 5.020;
  9. use strict;
  10. use warnings;
  11. use ntheory qw(:all);
  12. use experimental qw(signatures);
  13. sub pell_factorization ($n) {
  14. my $x = sqrtint($n);
  15. my $y = $x;
  16. my $z = 1;
  17. my $r = 2 * $x;
  18. my $w = $r;
  19. return $n if is_prime($n);
  20. return $x if is_square($n);
  21. my ($f1, $f2) = (1, $x);
  22. for (; ;) {
  23. $y = $r*$z - $y;
  24. $z = divint($n - $y*$y, $z);
  25. $r = divint($x + $y, $z);
  26. ($f1, $f2) = ($f2, addmod(mulmod($r, $f2, $n), $f1, $n));
  27. if (is_square($z)) {
  28. my $g = gcd($f1 - sqrtint($z), $n);
  29. if ($g > 1 and $g < $n) {
  30. return $g;
  31. }
  32. }
  33. return $n if ($z == 1);
  34. }
  35. }
  36. for (1 .. 10) {
  37. my $n = random_nbit_prime(31) * random_nbit_prime(31);
  38. say "PellFactor($n) = ", pell_factorization($n);
  39. }
  40. __END__
  41. PellFactor(2101772756469048319) = 1228264087
  42. PellFactor(2334333625703344609) = 1709282917
  43. PellFactor(2358058220132276317) = 1210584887
  44. PellFactor(1482285997261862561) = 1197377617
  45. PellFactor(2759217719449375403) = 1559110667
  46. PellFactor(2828146117168463857) = 1493774729
  47. PellFactor(1732707024229573211) = 1165003451
  48. PellFactor(2510049724431882299) = 1820676019
  49. PellFactor(1585505630716792319) = 1311005599
  50. PellFactor(1612976091192715981) = 1453708381