polski
Master Thesis
The Weil pairing and the computation of discrete logarithms on elliptic curves
PhD Thesis
Complexity of Ring Isomorphism Problem
Manuscripts
|
Computing isomorphisms between rings of the form F_q[X]/(f)
|
|
Towards a deterministic polynomial-time algorithm for computing isomorphisms between rings of the form F_q[X]/(f)
|
- Home
- Algorithmics Research Group
- Foundations of Computer Science
- Faculty of Mathematics and Computer Science
- Contact
- Satori
- Reports on Mathematical Logic
- Forum TCS
- UsosWeb
- Informatyka na szlaku
- Photos
- People
- Demian Banakh
- Bartłomiej Bosek
- Marcin Briański
- Iwona Cieślik
- Jan Derbisz
- Andrzej Dorobisz
- Lech Duraj
- Monika Gillert
- Katarzyna Grygiel
- Grzegorz Gutowski
- Grzegorz Herman
- Jędrzej Hodor
- Pawel M. Idziak
- Marcin Kozik
- Jakub Kozik
- Jacek Krzaczkowski
- Agnieszka Łupińska
- Piotr Micek
- Piotr Mikołajczyk
- Jonathan Narboni
- Andrzej Pezarski
- Bartosz Podkanowicz
- Adam Polak
- Krzysztof Potępa
- Wojciech Szpankowski
- Maciej Ślusarek
- Jan Tułowiecki
- Krzysztof Turowski
- Bartosz Walczak
- Michał Wrona
- Marek Zaionc
- Former colleagues