University of Birmingham > Talks@bham > Computer Security Seminars > On the computation of a 30750-bit binary field discrete logarithm

## On the computation of a 30750-bit binary field discrete logarithmAdd to your list(s) Download to your calendar using vCal - Rob Granger (University of Surrey)
- Thursday 31 October 2019, 11:00-12:00
- Computer Science, The Sloman Lounge (UG).
If you have a question about this talk, please contact Isra Ahmed. In this talk I will present some of the ideas behind, motivation for and details of the computation of a discrete logarithm in the finite field of 2 This is joint work with Thorsten Kleinjung, Arjen K. Lenstra, Benjamin Wesolowski and Jens Zumbragel. This talk is part of the Computer Security Seminars series. ## This talk is included in these lists:- Computer Science Departmental Series
- Computer Science Distinguished Seminars
- Computer Science, The Sloman Lounge (UG)
- Computer Security Seminars
Note that ex-directory lists are not shown. |
## Other listsMolecular and Medical Physics Seminar Series Postgraduate Seminars in the School of Computer Science Condensed Matter Physics Seminars## Other talksA degree sequence Komlós theorem Raising research profile – communications support Privileged side-channel attacks for enclave adversaries Supercriticality: From Blue Fluid to Green Chemistry FENL: an ISE to mitigate analogue micro-architectural leakage The Lanczos Algorithm: Complementing Your Approximations - Part 1 |