forked from trizen/perl-scripts
-
Notifications
You must be signed in to change notification settings - Fork 0
/
chebyshev_factorization_method_mpz.pl
executable file
·147 lines (113 loc) · 4.63 KB
/
chebyshev_factorization_method_mpz.pl
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
#!/usr/bin/perl
# Daniel "Trizen" Șuteu
# Date: 22 June 2020
# https://github.com/trizen
# A simple factorization method, using the Chebyshev T_n(x) polynomials, based on the identity:
# T_{m n}(x) = T_m(T_n(x))
# where:
# T_n(x) = (1/2) * V_n(2x, 1)
# where V_n(P, Q) is the Lucas V sequence.
# See also:
# https://oeis.org/A001075
# https://en.wikipedia.org/wiki/Lucas_sequence
# https://en.wikipedia.org/wiki/Iterated_function
# https://en.wikipedia.org/wiki/Chebyshev_polynomials
use 5.020;
use warnings;
use Math::GMPz;
use ntheory qw(:all);
use experimental qw(signatures);
sub fast_lucasVmod ($P, $n, $m) { # assumes Q = 1
my ($V1, $V2) = (Math::GMPz::Rmpz_init_set_ui(2), Math::GMPz::Rmpz_init_set($P));
foreach my $bit (todigits($n, 2)) {
if ($bit) {
Math::GMPz::Rmpz_mul($V1, $V1, $V2);
Math::GMPz::Rmpz_powm_ui($V2, $V2, 2, $m);
Math::GMPz::Rmpz_sub($V1, $V1, $P);
Math::GMPz::Rmpz_sub_ui($V2, $V2, 2);
Math::GMPz::Rmpz_mod($V1, $V1, $m);
}
else {
Math::GMPz::Rmpz_mul($V2, $V2, $V1);
Math::GMPz::Rmpz_powm_ui($V1, $V1, 2, $m);
Math::GMPz::Rmpz_sub($V2, $V2, $P);
Math::GMPz::Rmpz_sub_ui($V1, $V1, 2);
Math::GMPz::Rmpz_mod($V2, $V2, $m);
}
}
Math::GMPz::Rmpz_mod($V1, $V1, $m);
return $V1;
}
sub chebyshev_factorization ($n, $B, $A = 127) {
# The Chebyshev factorization method, taking
# advantage of the smoothness of p-1 or p+1.
if (ref($n) ne 'Math::GMPz') {
$n = Math::GMPz->new("$n");
}
my $x = Math::GMPz::Rmpz_init_set_ui($A);
my $i = Math::GMPz::Rmpz_init_set_ui(2);
Math::GMPz::Rmpz_invert($i, $i, $n);
my sub chebyshevTmod ($A, $x) {
Math::GMPz::Rmpz_mul_2exp($x, $x, 1);
Math::GMPz::Rmpz_set($x, fast_lucasVmod($x, $A, $n));
Math::GMPz::Rmpz_mul($x, $x, $i);
Math::GMPz::Rmpz_mod($x, $x, $n);
}
my $g = Math::GMPz::Rmpz_init();
my $lnB = log($B);
foreach my $p (@{primes(sqrtint($B))}) {
chebyshevTmod($p**int($lnB / log($p)), $x);
}
my $it = prime_iterator(sqrtint($B) + 1);
for (my $p = $it->() ; $p <= $B ; $p = $it->()) {
chebyshevTmod($p, $x); # T_k(x) (mod n)
Math::GMPz::Rmpz_sub_ui($g, $x, 1);
Math::GMPz::Rmpz_gcd($g, $g, $n);
if (Math::GMPz::Rmpz_cmp_ui($g, 1) > 0) {
return 1 if (Math::GMPz::Rmpz_cmp($g, $n) == 0);
return $g;
}
}
return 1;
}
foreach my $n (
#<<<
Math::GMPz->new("4687127904923490705199145598250386612169614860009202665502614423768156352727760127429892667212102542891417456048601608730032271"),
Math::GMPz->new("2593364104508085171532503084981517253915662037671433715309875378319680421662639847819831785007087909697206133969480076353307875655764139224094652151"),
Math::GMPz->new("850794313761232105411847937800407457007819033797145693534409492587965757152430334305470463047097051354064302867874781454865376206137258603646386442018830837206634789761772899105582760694829533973614585552733"),
#>>>
) {
say "\n:: Factoring: $n";
until (is_prime($n)) {
my $x = int(rand(1e6));
my $p = chebyshev_factorization($n, 500_000, $x);
if ($p > 1) {
say "-> Found factor: $p";
$n /= $p;
}
}
}
__END__
:: Factoring: 4687127904923490705199145598250386612169614860009202665502614423768156352727760127429892667212102542891417456048601608730032271
-> Found factor: 31935028572177122017
-> Found factor: 441214532298715667413
-> Found factor: 515113549791151291993
-> Found factor: 896466791041143516471427
-> Found factor: 12993757635350024510533
:: Factoring: 2593364104508085171532503084981517253915662037671433715309875378319680421662639847819831785007087909697206133969480076353307875655764139224094652151
-> Found factor: 1927199759971282921
-> Found factor: 85625333993726265061
-> Found factor: 2490501032020173490009
-> Found factor: 765996534730183701229
-> Found factor: 58637507352579687279739
-> Found factor: 4393290631695328772611
:: Factoring: 850794313761232105411847937800407457007819033797145693534409492587965757152430334305470463047097051354064302867874781454865376206137258603646386442018830837206634789761772899105582760694829533973614585552733
-> Found factor: 556010720288850785597
-> Found factor: 33311699120128903709
-> Found factor: 341190041753756943379
-> Found factor: 182229202433843943841
-> Found factor: 55554864549706093104640631
-> Found factor: 7672247345452118779313
-> Found factor: 386663601339343857313
-> Found factor: 5658991130760772523
-> Found factor: 1021051300200039481