Computational Aspects of Cryptography and Cryptanalysis

1., Âuflage
ISBN: 978-3-89966-337-2
Verlag: Bochumer Universitätsverlag Westdeutscher Universitätsverlag

Buch, Englisch, Band 6, 245 Seiten, PB, Format (B × H): 150 mm x 210 mm, Gewicht: 350 g

Reihe: IT-Security

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.

Autoren/Hrsg.

Rupp, Andy

Über Autor(innen)

Andy Rupp studied Computer Science at Saarland University (Germany) between 1999 and 2004. After receiving his master's degree in CS he started as a PhD student for Electrical Engineering and Information Sciences at Ruhr-University Bochum (Germany). From 2004 to 2008 he successfully pursued his PhD studies in Cryptography and Security under the supervision of Prof. Christof Paar, Chair of Embedded Security. Andy's research interests include practical aspects of cryptography and security like efficient architectures for cryptographic and cryptanalytic applications as well as theoretical aspects like number-theoretic assumptions and cryptographic models.