Rows:
| CHALLENGE | AUTHORS | SOLVES (CURRENT) | SOLVE RATE (AT CONTEST TIME) |
|---|---|---|---|
WelcomeMisc | 953solves | - | |
Simple LoginWeb | 411solves | Top 28%= 84/300 users | |
echoPwn | 265solves | Top 32%= 56/174 users | |
202solves | Top 15%= 71/458 users | ||
qrimeCrypto | 187solves | Top 38%= 91/239 users | |
Country DBWeb | 166solves | Top 33%= 246/729 teams | |
inboundPwn | 155solves | Top 28%= 57/197 users | |
masking tapeRev | 125solves | Top 19%= 61/316 users | |
before-writePwn | 117solves | - | |
catcpyPwn | 110solves | Top 20%= 41/197 users | |
99solves | Top 15%= 42/279 users | ||
Alpaca PollWeb | 98solves | Top 9%= 42/458 users | |
JackpotWeb | 96solves | Top 29%= 63/213 users | |
Rainbow Sweet AlchemistCrypto | 92solves | Top 17%= 42/239 users | |
hexechoPwn | 92solves | Top 15%= 27/174 users | |
OysterPwn | 78solves | Top 42%= 40/95 users | |
CaaSWeb | 68solves | Top 4%= 13/300 users | |
writePwn | 64solves | - | |
Pico Note 1Web | 60solves | Top 3%= 10/300 users | |
A Dance of Add and MulCrypto | 60solves | Top 12%= 30/239 users |
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)