Factorization of the eighth Fermat number-Reference-Cited by-同舟云学术

Factorization of the eighth Fermat number

Published:1981 Issue:154 Volume:36 Page:627-630
ISSN:0025-5718
Container-title:Mathematics of Computation
language:en
Short-container-title:Math. Comp.

Author:

Brent Richard P.,Pollard John M.

Abstract

We describe a Monte Carlo factorization algorithm which was used to factorize the Fermat number F 8 = 2 256 + 1 {F_8} = {2^{256}} + 1 . Previously F 8 {F_8} was known to be composite, but its factors were unknown.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,Computational Mathematics,Algebra and Number Theory

Link

http://www.ams.org/mcom/1981-36-154/S0025-5718-1981-0606520-5/S0025-5718-1981-0606520-5.pdf

Reference7 articles.

1. An improved Monte Carlo factorization algorithm;Brent, Richard P.;BIT,1980

2. Two new factors of Fermat numbers;Hallyburton, John C., Jr.;Math. Comp.,1975

3. A method of factoring and the factorization of 𝐹₇;Morrison, Michael A.;Math. Comp.,1975

4. A Monte Carlo method for factorization;Pollard, J. M.;Nordisk Tidskr. Informationsbehandling (BIT),1975

5. Monte Carlo methods for index computation (𝑚𝑜𝑑𝑝);Pollard, J. M.;Math. Comp.,1978

Cited by 59 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the deepest cycle of a random mapping;Journal of Combinatorial Theory, Series A;2024-08

2. Continued Fractions Applied to the One Line Factoring Algorithm for Breaking RSA;Journal of Cybersecurity and Privacy;2024-01-10

3. Wie man eine Zahl faktorisiert;Grundlagen der Kryptographie;2024

4. Privacy preserving via multi-key homomorphic encryption in cloud computing;Journal of Information Security and Applications;2023-05

5. Prime Test;Financial Mathematics and Fintech;2022