Hi, I'm a CS student currently trying to find a topic for my bachelor thesis. We covered elliptic curves and the ECDLP in one of our modules. I think it is an interesting topic, so I've been reading into it a bit more on my own. My supervisor is from theoretical CS and expects me to come up with a concrete proposal myself. My problem is that I'm not sure what a realistic bachelor thesis scope looks like in this area. From what I understand, you're not expected to produce novel results, but rather demonstrate that you can work through a topic independently and present it well. Some ideas I had so far: Performance comparison of ECDLP algorithms (e.g. Baby-Step Giant-Step, Pollard-Rho, Pohlig-Hellman). I'm not sure if a pure runtime comparison would be too shallow for a thesis, or whether there's a way to make it more substantial – e.g. by connecting the empirical results to the theoretical complexity analysis. Security analysis of a Montgomery curve, e.g.…