Department of Mathematics
Title : Some algorithms for integer factorisation
| Speaker: Shi Bai Affiliation: University of Auckland Time: 14:00 Tuesday, 19 March, 2013 Location: 303-412 |
Abstract
| Public-key cryptosystems such as RSA are based on the the presumed hardness of factoring large integers and hence algorithms for factoring integers are of practical importance. In this talk we describe the number field sieve, the most efficient algorithm known for factoring large integers. The number field sieve consists of several stages, the first one being polynomial selection. The running time of subsequent stages depends on the quality of the chosen polynomials in polynomial selection. In this talk, we will describe some methods to choose good polynomials in the number field sieve. |
-
Programmes and Centres
- New Zealand Institute of Mathematics and its Applications (NZIMA)
- Community for Understanding and Learning in the Mathematical Sciences (CULMS)
- Centre for Mathematical Social Science (CMSS)
- Department of Computer Science
- Department of Engineering Science
- Department of Physics
- Department of Statistics
- Auckland Bioengineering Institute
