[ Last changed: 1st June 1995 ]

Security Group Seminar, 23rd May 1995


Speaker:
Bob Morris, University of Cambridge and NSA

Date:
Tuesday 23rd May 4.15pm

Place:
Room TP4, Computer Laboratory

Title:
FACTORIZATION FOR COMPUTER SCIENTISTS

Thesis I: During the past few decades, there has been an immense amount of research on the factorization of large integers. The size of the largest numbers that can be readily and rapidly factored into primes has increased from about twenty or thirty digits a few decades ago, to perhaps one hundred digits nowadays.

Thesis II: The amount of innovation in the theory and practice of factorization in the past century or so has been disappointingly small. The result is that a competent mathematician of the mid 19th century would perceive modern factorization methods as merely minor modifications to the methods known in his own day. Yet these "minor modifications" are themselves of considerable interest.

Modern research papers in this subject are remarkably difficult to read and understand. The amount of space and time spent on deriving detailed asymptotic estimates of space and running time interfere greatly with understanding the underlying methods.

I propose to discuss factorization methods, both old and new, and in a way that will be accessible to an audience that understands just a tiny amount of number theory.


PostScript version of slides
Security Group Seminar, 23rd May 1995 / Mark.Lomas@cl.cam.ac.uk