Home > Search Results: keywords:"Diffie-Hellman's problems"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.01 seconds. 
Generic algorithms
 Snítilá, Jitka ; Příhoda, Pavel (advisor) ; Jedlička, Přemysl (referee)
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
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English