WolvCTF-2023 Crypto
题目作者: 未知
一 血: 晨曦
一血奖励: 0金币
解 决: 3
提 示:
描 述: Or, more precisely: $\mathbb{Z}/2^k\mathbb{Z}^*$-Diffie-Hellman Sick of how slow it is to take the modulus of a large prime number? Tired of performing exponentiation over some weird group like ed25519? Just use the integers mod 2^k group! Efficient, reliable, doesn't require any hard math!
附 件: 下载