ctfshow—红包4

最新推荐文章于 2024-06-06 13:35:30 发布

Wcbddd

最新推荐文章于 2024-06-06 13:35:30 发布

阅读量233

点赞数

分类专栏： CTF CTF加密解密文章标签： python 开发语言

本文链接：https://blog.csdn.net/HAI_WD/article/details/131522599

版权

CTF 同时被 2 个专栏收录

81 篇文章 1 订阅

订阅专栏

CTF加密解密

56 篇文章 6 订阅

订阅专栏

该文章介绍了一个CTF（CaptureTheFlag）加密挑战，涉及到数论中的幂运算和模运算。题目要求通过已知的数学关系解密获取`s`的值，进而计算出`k`。关键在于利用公式简化，当`c=0`时，可以求得`s`和`r`，进一步求得`k`，从而解决挑战。

摘要由CSDN通过智能技术生成

0x00 前言

CTF 加解密合集：CTF 加解密合集

0x01 题目

from secrets import randbelow
from nationalsecret import p, r, k, flag

g = 2
y = pow(g, k, p)

def gogogo():
    print("Another chance:")
    t = int(input('t = '))
    c = randbelow(p)
    print("Here is my real challenge:")
    print(f'c = {c}')
    print("Give me your answer.")
    s = int(input('s = '))
    return pow(g, s, p) == t * pow(y, c, p) % p

def dododo():
    print("Here is my gift for National's Day!")
    t = pow(g, r, p)
    print(f't = {t}')
    print("What do you want?")
    c = int(input('c = '))
    s = (r + c*k) % (p - 1)
    print("This is another gift:")
    print(f's = {s}')

print("Happy National's Day!")
print("Don't play CTF these days.")
print("Just go out and play~")
print("Don't finish this chall,")
print("although I should tell you that")
print(f"p = {p}")


dododo()

if gogogo():
    print(f"FUIYOH! You can get flag: {flag}")
    print("and then go out and play!")
else:
    print("HAIYAA! You are wrong. Just go out and play!")