Dikran Karagueuzian

The Brent-Pollard Heuristic, used in factorization algorithms and elliptic curve cryptography, is the principle that polynomial functions on finite fields are similar to random maps. Using Galois Theory and Representation Theory, it is possible to prove theorems that make this heuristic more precise. I supervise a PhD student who is building models for a financial product: self-refinancing mortgages. I also manage a team of undergraduate researchers attempting to solve a deterministic financial game using reinforcement learning.