Diffie-Hellmanův problém
| Thesis title in Czech: | Diffie-Hellmanův problém |
|---|---|
| Thesis title in English: | Diffie–Hellman problem |
| Key words: | Diffie-Hellmanův problém, diskrétní logaritmus, složitost, asymetrická kryptografie |
| English key words: | Diffie-Hellman problem, discrete logarithm, computional complexity, asymmetric cryptography |
| Academic year of topic announcement: | 2016/2017 |
| Thesis type: | Bachelor's thesis |
| Thesis language: | |
| Department: | Department of Algebra (32-KA) |
| Supervisor: | doc. Mgr. Pavel Růžička, Ph.D. |
| Author: | hidden - assigned and confirmed by the Study Dept. |
| Date of registration: | 18.10.2016 |
| Date of assignment: | 31.10.2016 |
| Confirmed by Study dept. on: | 09.12.2016 |
| Guidelines |
| Cílem práce je popsat Diffie-Hellmanův problém, jeho vztah k problému diskrétního logaritmu a k rozhodovacímu Diffie-Hellmanovu problém. |
| References |
| 1. Boneh, Dan (1998) The Decision Diffie–Hellman Problem. Proceedings of the Third Algorithmic Number Theory Symposium. Lecture Notes
2. Ueli M. Maurer and Stefan Wolf (March 2000). The Diffie–Hellman Protocol. Designs, Codes, and Cryptography (Springer-Verlag) 19 (2–3): 141–171. Retrieved 2008-09-28 in Computer Science 1423: 48–63 3. Whitfield Diffie and Martin E. Hellman (November 1976). New Directions in Cryptography. IEEE Transactions on Information Theory. IT-22 (6): 644–654. Retrieved 2005-11-23. 4. Feng Bao. Robert Deng, Huafei Zhu (2002). Variations of Diffie–Hellman problem. ICICS (Springer-Verlag). |