Theses topics, completed
The following list describes completed theses or internships. You should get an impression of which kind of theses you can do with us. If you are interested in writing a thesis with us, contact us.
- Decomposition of polynomials
- One is interested in functional decomposition f = g(h) of polynomials. First an algorithms is described, which computes decompositions in polynomial time. This algorithm was originally proposed by Zippel (1991). A bound for the number of minimal collisions is derived. Finally a proof of a conjecture in von zur Gathen et al. (2010) is given, which states a normal form for a special class of decomposable polynomials.
- Elliptic curve signatures with security reductions
- Recently, several signature schemes have been proposed that offer additional features and have strong security reductions. Investigation of existing schemes may lead to further new features.
- Web application vulnerabilities and exploits
- The thesis will provide an insight into the security aspects of Digital Signatures and Digital Certificates, the desired properties of a Web Application providing issuance, revocation, etc. of Digital Certificates; and cover various attack models exploiting the vulnerabilities in such a Web Application. It would aim toward exploring how(why) various attacks exploit flaws in the design and implementation of a web application and their countermeasures.
- An In-Depth Study of Contemporary Hash Functions
- The thesis covers an exhaustive study of selected contemporary hash functions, namely the potential candidates of the Advanced Hash Standard. Hash functions are the backbone of many cryptographic protocols and are used extensively for example for digital signatures. Thus, hash functions form an integral part of internet security, and need to be constructed very carefully. The thesis carries out a comprehensive study on the security and the efficiency of the candidate hash functions. The best comparative option will be reported. Ongoing.
- Secure sms
- Modern mobile phones allow for a lot of additional software. The aim of this thesis is to demonstrate by an actual implementation that secure sms are possible and simple.
- Identity Based Encryption
- Identity based encryption and security reductions are two hot topics in cryptography. This thesis aims to provide better solutions for identity based encryption with the high demands of security reductions based on weakly secure primitives. Completed.