University of Birmingham > Talks@bham > Computer Security Seminars > The explicit isomorphism problem and its applications"

## The explicit isomorphism problem and its applications"Add to your list(s) Download to your calendar using vCal - Peter Kutas Hungarian Academy of Sciences
- Thursday 31 January 2019, 11:00-12:00
- Computer Science, The Sloman Lounge (UG).
If you have a question about this talk, please contact Mani Bhesania. Let A be an algebra over a field K which is given by a basis and a multiplication table of the basis elements. Furthermore, suppose that A is isomorphic to M_n(K), the algebra of nxn matrices with entries from K. The algorithmic task, known as the explicit isomorphism problem, is to compute an isomorphism between A and M_n(K). This problem comes from computational representation theory, but has various applications in many areas of computational mathematics: solving diophantine equations, finding generators for the group of rational points of an elliptic curves, parametrizing algebraic varieties. Recently, it has also been linked to the creation of error-correcting codes and cryptography. After surveying the known cases of the explicit isomorphism problem, I would like discuss these applications. 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 listsAnalysis seminar Lab Lunch Nanoscale Physics Seminars## Other talksAn attack on ECDSA using lattice techniques Role of Mechanics and Geometry in Cellular Information Processing Verification of Byzantine Fault Tolerant Systems TBA School Seminar Weak universalities for some singular stochastic PDEs |