Challenges

Lemme double the number of ictf Haskell challenges real quick.

nc puzzler7.imaginaryctf.org 8001

Welcome to round 29!

ictf{w3lcom3_to_r0und_29!}

Discrete log can be broken if the prime isn't strong enough, and that's why I use getStrongPrime.

https://imaginaryctf.org/f/J4bCJ#server.py nc ictf.maple3142.net 1337

I've created a linear time complexity sorting algorithm! It takes a while to run, though...

https://imaginaryctf.org/f/Gj4BL#timesort

There's something not quite right about this site, but I can't quite put my finger on it... It's certainly very unique.

http://puzzler7.imaginaryctf.org:8000/