Faster number theory, safer cryptography
Developing a method to simplify polynomials in complex curves
Complex polynomials related to elliptic curves are at the heart of current number theory research. Elliptic curves also have the interest of cryptographers, as they can be used to make cryptographic keys that are hard to break. The research of Marco Streng concerns curves that are more complex than elliptic curves. The related polynomials are too large to work with efficiently, but Streng is developing a method to simplify them.