South of England Computational and Algorithmic Number Theory Seminars
Saturday 2 December 1995
Oxford (Mathematical Institute)
"Galois Theory and Polynomial Factorization: Effective Links"
We investigate how polynomial factorization can make more use
of Galois Theory, rather than assume that "polynomials are random".
13.30-14.00 P. Leyland
"A Hostile Attack on an RSA Key"
A group of 4 people with modest resources factored a 384-bit RSA key
with PPMPQS over 3 months --- entirely unnoticed. 512-bit keys are now
vulnerable to hostile attack, putting gigabucks at risk.
"Back to the Dark Ages: a new look at some old factoring
In recent years, there has been spectacular progress in the practical
of factoring. By contrast, the theoretical problem of finding
algorithms which provably factor composite numbers has made little, if
progress. In this talk, I report on joint work with James McKee
some old exponential-time ("Dark Ages") deterministic algorithms: we
deterministic running times for them, and provide several new examples
algorithms of this type.
15.15-16.15 S. Siksek
"Infinite Descent on Elliptic Curves"
Back to the SECANTS programme page
Back to the SECANTS home page
Page maintained by Steven Galbraith