## 1 A Beginner’s Guide To The General Number Field Sieve

### BibTeX

@MISC{_1a,

author = {},

title = {1 A Beginner’s Guide To The General Number Field Sieve},

year = {}

}

### OpenURL

### Abstract

RSA is a very popular public key cryptosystem. This algorithm is known to be secure, but this fact relies on the difficulty of factoring large numbers. Because of the popularity of the algorithm, much research has gone into this problem of factoring a large number. The size of the number that we are able to factor increases exponentially year by year. This fact is partly due to advancements in computing hardware, but it is largely due to advancements in factoring algorithms. The General Number Field Sieve is an example of just such an advanced factoring algorithm. This is currently the best known method for factoring large numbers. This paper is a presentation of the General Number Field Sieve. It begins with a discussion of the algorithm in general and covers the theory that is responsible for its success. Because often the best way to learn an algorithm is by applying it, an extensive numerical example is included as well. I.

### Citations

80 |
Introduction to Cryptography with Coding Theory, 2d ed., Upper Saddle River
- Trappe, Washington
- 2006
(Show Context)
Citation Context ... ⎦ ⎣ ⎦ 19019 0 0 0 1 1 1 0 1 Because (II.1) is a system of 8 equations and 9 unknowns, a (nonunique) solution does exist. One solution to this equation is [a1, a2, a2, a3, a4, a5, a6, a7, a8, a9] T = =-=[1, 1, 0, 0, 1, 1, 0, 0, 0]-=- T . This implies that 455 · 39270 · 1616615 · 3990 is a perfect square. Indeed, a simple calculation shows that 455 · 39270 · 1616615 · 3990 = (339489150) 2 . This method for finding perfect squares ... |

36 | Factorization and Primality Testing - Bressoud - 1989 |

18 | editors. An Introduction to The Theory of Numbers. 5th Ed - Niven, Zuckerman, et al. - 1991 |

13 | An implementation of the number field sieve - Elkenbracht-Huizing - 1996 |

7 | An Introduction to the General Number Field Sieve - Briggs - 1998 |

3 | A First Course - Rotman - 2000 |

2 | Huizing,An implementation of the number field sieve - M - 1995 |

1 | A survey on the number field sieve.” [Online]. Available: citeseer.nj.nec.com/312752.html - Nakamula |

1 | New prime factorisation record obtained using the general number field sieve - Bahr, Franke, et al. |