scholarly journals Algorithm Available for Factoring Big Fermat Numbers

2020 ◽  
pp. 86-97
Author(s):  
Xingbo Wang ◽  
Keyword(s):  
2021 ◽  
pp. 167-173
Author(s):  
Jianhui Li ◽  
◽  
Manlan Liu

In accordance with the traits of parallel computing, the paper proposes a parallel algorithm to factorize the Fermat numbers through parallelization of a sequential algorithm. The kernel work to parallelize a sequential algorithm is presented by subdividing the computing interval into subintervals that are assigned to the parallel processes to perform the parallel computing. Maple experiments show that the parallelization increases the computational efficiency of factoring the Fermat numbers, especially to the Fermat number with big divisors.


1978 ◽  
Vol 32 (143) ◽  
pp. 941 ◽  
Author(s):  
D. E. Shippee
Keyword(s):  

2002 ◽  
pp. 41-58
Author(s):  
Michal Křížek ◽  
Florian Luca ◽  
Lawrence Somer
Keyword(s):  

2002 ◽  
Vol 109 (6) ◽  
pp. 517 ◽  
Author(s):  
Carrie E. Finch ◽  
Lenny Jones
Keyword(s):  

2015 ◽  
Vol 7 (2) ◽  
pp. 220-225
Author(s):  
R. Popovych

We consider recursive binary finite field extensions $E_{i+1} =E_{i} (x_{i+1} )$, $i\ge -1$, defined by D. Wiedemann. The main object of the paper is to give some proper divisors of the Fermat numbers $N_{i} $ that are not equal to the multiplicative order $O(x_{i} )$.


2010 ◽  
Vol 80 (275) ◽  
pp. 1865-1866
Author(s):  
Anders Björn ◽  
Hans Riesel
Keyword(s):  

2002 ◽  
pp. 26-32
Author(s):  
Michal Křížek ◽  
Florian Luca ◽  
Lawrence Somer

Sign in / Sign up

Export Citation Format

Share Document