Rows:
| CHALLENGE | AUTHORS | SOLVES (CURRENT) | SOLVE RATE (AT CONTEST TIME) |
|---|---|---|---|
WelcomeMisc | 1239 solves | - | |
AlpacaHack 2100Misc | 661 solves | - | |
Simple LoginWeb | 510 solves | Top 28% = 84/300 users | |
a fact of CTFCrypto | 459 solves | - | |
EmojifyWeb | 322 solves | - | |
echoPwn | 311 solves | Top 32% = 56/174 users | |
294 solves | - | ||
266 solves | - | ||
246 solves | Top 15% = 71/458 users | ||
qrimeCrypto | 228 solves | Top 38% = 91/239 users | |
hit-and-missMisc | 209 solves | - | |
Country DBWeb | 205 solves | Top 33% = 246/729 teams | |
size limitCrypto | 189 solves | - | |
189 solves | - | ||
187 solves | - | ||
inboundPwn | 187 solves | Top 28% = 57/197 users | |
Alpaca BankWeb | 185 solves | - | |
Fully Padded RSACrypto | 160 solves | - | |
masking tapeRev | 159 solves | Top 19% = 61/316 users | |
Safe PrimeCrypto | 154 solves | - |
Rows:
出力からフラグを復元してください🐍
import os
from Crypto.Util.number import getPrime, bytes_to_long
m = bytes_to_long(os.getenv("FLAG").encode())
p = getPrime(96)
n = p * p * p
e = 65537
c = pow(m, e, n)
print(f"{n,c=}")
出力:
n,c=(272361880253535445317143279209232620259509770172080133049487958853930525983846305005657, 69147423377323669983172806367084358432369489877851180970277804462365354019444586165184)