This thesis focuses on the lower bounds for generic algorithms for discrete logarithms problem and Diffie-Hellman's problems. This thesis introduces two diffrent models of Black-Box for that purpose. On these models thesis approxi- mates and compares success probability of generic algorithms for given problems including Maurer's reduction. This reduction solves discrete logarithms problem using a appropriate elliptic curve and a Diffie-Hellman's oracle. This thesis also researches generic algorithm for identifiaction schemes, that are based on discrete logarithms problem. 1
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:367669 |
| Date | January 2017 |
| Creators | Snítilá, Jitka |
| Contributors | Příhoda, Pavel, Jedlička, Přemysl |
| Source Sets | Czech ETDs |
| Language | Czech |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0022 seconds