Algorithmic solution of Diophantine equations and applications to cryptography II

Projekt: Foschungsprojekt



An essential part of this project is devoted to the effective solution of Diophantine equations from a theoretical as well as from an algorithmic and computational point of view. We also explore a new method for the construction of elliptic curves of high rank based on Diophantine m-tuples. These investigations involve linear forms in logarithms and have applications to cryptography.
Tatsächlicher Beginn/ -es Ende1/01/0631/12/07