Oct
02

TUM CTF 2016 – Tacos (Crypto 400)

All my fine arts and philosophy student friends claim discrete logarithms are hard. Prove them wrong. nc 104.198.63.175 1729 vuln_tacos.py Summary: bypassing Fermat primality test with Carmichael numbers and solving discrete logarithm using Pohlig-Hellman algorithm.

Feb
09

Olympic CTF 2014 GuessGame (300)

Be careful, it’s cheating! nc 109.233.61.11 3126 Summary: discrete logarithm with group oracle