Cryptohack_Roll your Own

很有趣的题目，我的构造：

(p+1)**pmod(p**2)=1

(p+1)**kmod(p**2)=k*p+1

p=0xb7955f7174f770628920e8b5d528c7253c01594077a2e851e5df4af03955f0fb2e497c5008feb2cfd9ccd84322edb937fddbe54e084a6da233b93efac986610d
print(is_prime(p))
print('{"g": "'+hex(p+1)[2:]+'","n": "'+hex(p*p)[2:]+'"}')

print(pow(p+1,p,p*p))

c=0x7be2aa8d1c925f33fdba281b84ef094cc9c4b40f2b99e3dee746d42436f4a33c668ac86217c91bcc322e964a3891a99d75308e45cc548414ba5751c6be2337a4f4f064a14573c2c4d0af4859994d2ece70544f112c9b56efee1a06914c224fbe150b5a0b2823adc551eba66147c86c29c547b36db94ff8b8eac2b04b46c148bc
print(c)
x=(c-1)//p
print('{"x": "'+hex(x)[2:]+'"}')

比较懒，交互比较简单，没有写交互脚本。