Thesis supervisor: Tamás Herendi
Location of studies (in Hungarian): University of Debrecen Faculty of Informatics Abbreviation of location of studies: DE IK
Description of the research topic:
Syllabus
It is often important in cryptographic solutions, that the known or newly developed algorithms should work with acceptable efficiency – e.g. high speed and low resource consumption. The methods used by asymmetric cryptography are typically slow and have high resource demand. In some cases, it may be required to have more efficiency of algorithms in symmetric cryptosystems.
The main goal of the research related to the subject is to find or construct powerful parallel algorithms, and observe the possibility of their smart implementation.
Emphasis are on the possibility of massive parallelization and implementation of FPGA devices. A related research topic may be the development – or the consideration of the possibility of the development – of a complete cryptosystem on a single FPGA chip.
Bibliography
[1] J. S. Kraft and L. C. Washington, An introduction to number theory with cryptography. 2nd edition. Boca Raton, FL: CRC Press (2018)
[2] J. von zur Gathen and J. Gerhard, Modern computer algebra. 3rd ed. Cambridge: Cambridge University Press (2013)
[3] J. A. Buchmann, Introduction to cryptography. 2nd ed. New York, NY: Springer (2004)
[4] I. F. Blake, G. Seroussi and N. Smart, Elliptic curves in cryptography. Cambridge: Cambridge University Press (1999)
[5] Francisco Rodríguez-Henríquez, Nazar Abbas Saqib, Arturo Díaz Pérez, Cetin Kaya Koc, Cryptographic Algorithms on Reconfigurable Hardware, Springer (2007)
[6] A. Perrig, and J. D. Tygar, Secure Broadcast Communication in Wired and Wireless Networks, Kluwer Academic Publishers (2004)
[7] D. E. Knuth, The art of computer programming. Vol. 2: Seminumerical algorithms. 3rd ed. Bonn: Addison-Wesley (1998)
Deadline for application: 2019-11-15
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
