Thesis supervisor: Attila Pethő
Location of studies (in Hungarian): Debreceni Egyetem Informatikai Kar Abbreviation of location of studies: DE IK
Description of the research topic:
The widely used algorithms of the public key cryptography are based on the hardness of factorization of large integers and computation of discrete logarithm. In 1994 P. Shor proved that these problems can be solved by quantum algorithms in polynomial time. Since then a lot of research is done to invent cryptographic primitives which are resistant against quantum computers. A possible direction is the development of algorithms, which are based on the hardness of solution of diophantine equations.
Bibliography
D. Bernstein, J. Buchmann, E. Dahmen (Eds.): Post-Quantum Cryptography, Springer 2009.
A. Bérczes, L. Hajdu, N. Hirata-Kohno, T. Kovács and A. Pethő, A key exchange protocol based on Diophantine equations and S-integers, JSIAM Letters 6 (2014), 85—88.
Recommended language skills (in Hungarian): angol Number of students who can be accepted: 1
Deadline for application: 2018-02-16
2024. IV. 17. ODT ülés Az ODT következő ülésére 2024. június 14-én, pénteken 10.00 órakor kerül sor a Semmelweis Egyetem Szenátusi termében (Bp. Üllői út 26. I. emelet).
Login
