International Association for Cryptologic Research

Ph.D. Database

The aim of the IACR Ph.D. database is twofold. On the first hand, we want to offer an overview of Ph.D. already completed in the domain of cryptology. Where possible, this should also include a subject classification, an abstract, and access to the full text. On the second hand, it deals with Ph.D. subjects currently under investigation. This way, we provide a timely map of contemporary research in cryptology. All entries or changes need to be approved by an editor. You can contact them via phds (at)


Andy Rupp (#168)
Name Andy Rupp
Topic of his/her doctorate. Computational Aspects of Cryptography and Cryptanalysis
Keywords Black-Box Models, Generic Algorithms, RSA, Discrete Logarithm, Diffie-Hellman, Integer Factorization, Special-Purpose Hardware, LSE Solver, A5/1, A5/2, Time-Memory Tradeoff, ECDSA, Multivariate Signatures
Ph.D. Supervisor(s) Christof Paar
Year of completion 2008
Abstract This thesis deals with various computational aspects of theoretical and applied cryptology. The theoretical part of this dissertation studies the hardness and relations of cryptographic assumptions in black-box models of computation (black-box groups and rings). This yields partial answers to two longstanding open questions in cryptographic research: We provide evidence towards the equivalence of the Integer Factorization problem and the RSA problem and against the equivalence of the Discrete Logarithm problem and the Diffie-Hellman problem. The second part of this thesis is concerned with the development of novel and highly efficient hard- and software architectures for cryptographic and cryptanalytic applications. In particular, we present powerful hardware-based attacks on the GSM stream ciphers A5/1 and A5/2 as well as efficient architectures for ECDSA and MQ signature schemes.
E-Mail Address andy.rupp (at)
Last Change 2011-02-14 10:49:13
To provide an update on this entry, please click .

Contact: phds (at)

[ IACR home page ] [ IACR PhDs page ] © IACR