Continued fractions and Parallel SQUFOF
| dc.creator | McMath, S. | |
| dc.creator | Crabbe, F. | |
| dc.creator | Joyner, D. | |
| dc.date | 2006-01-11 | |
| dc.date.accessioned | 2026-07-07T06:58:49Z | |
| dc.date.available | 2026-07-07T06:58:49Z | |
| dc.description | In this partly expository paper, we discuss three results. (1) That the two-sided continued fraction of the normalized square root (an important part of the SQUFOF algorithm) has several very attractive properties - periodicity, a symmetry point corresponding to a factorization of $N$, and so on. (2) The infrastructure distance formula. (3) A method for parallelization of SQUFOF that maintains its efficiency per procesor as the number of processors increases, and thus is predicted to be useful for very large numbers of processors. The first two are known (in one form or another), the third may be new (at least the implementation in C using MPI is new). | |
| dc.description | 15 pages | |
| dc.identifier | https://arxiv.org/abs/math/0601263 | |
| dc.identifier | http://arxiv.org/abs/math/0601263 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/107508 | |
| dc.subject | Number Theory | |
| dc.subject | History and Overview | |
| dc.subject | 11Y40; 11E16; 11R11 | |
| dc.title | Continued fractions and Parallel SQUFOF | |
| dc.type | text |