Home > Search Results: Primas, Martin
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 4 records found  Search took 0.01 seconds. 
Side information based cryptanalysis
 Primas, Martin ; Rosa, Tomáš (advisor) ; Jedlička, Přemysl (referee)
This thesis presents the side channel attack on implementation of RSA scheme where Montgomery multiplication and Chinese remainder theorem are used. The attack is based on already published Tomoeda`s attack that is studied more exactly in this thesis. Tomoeda`s attack is revised and especially the theoretical bound for probability of success of this attack is found. Next we provide new formal de nition used in searching for approximate greatest common divisors where well known LLL algorithm for searching for approximated shortest vector in lattices is used. Original connection between Tomoeda`s attack and algorithm for searching for approximate greatest common divisors is the main contribution of this work as the connection provide better attack on RSA scheme. In the last part we search for optimal connection of these algorithms and particular attacks are described.
Detailed record
Zero-knowledge proofs
 Primas, Martin ; Tůma, Jiří (advisor) ; Stanovský, David (referee)
Detailed record
Side information based cryptanalysis
 Primas, Martin ; Rosa, Tomáš (advisor) ; Jedlička, Přemysl (referee)
This thesis presents the side channel attack on implementation of RSA scheme where Montgomery multiplication and Chinese remainder theorem are used. The attack is based on already published Tomoeda`s attack that is studied more exactly in this thesis. Tomoeda`s attack is revised and especially the theoretical bound for probability of success of this attack is found. Next we provide new formal de nition used in searching for approximate greatest common divisors where well known LLL algorithm for searching for approximated shortest vector in lattices is used. Original connection between Tomoeda`s attack and algorithm for searching for approximate greatest common divisors is the main contribution of this work as the connection provide better attack on RSA scheme. In the last part we search for optimal connection of these algorithms and particular attacks are described.
Detailed record
Zero-knowledge proofs
 Primas, Martin ; Stanovský, David (referee) ; Tůma, Jiří (advisor)
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