Rows:
| CHALLENGE | AUTHORS | SOLVES (CURRENT) | SOLVE RATE (AT CONTEST TIME) |
|---|---|---|---|
WelcomeMisc | 1462 solves | - | |
AlpacaHack 2100Misc | 1356 solves | - | |
a fact of CTFCrypto | 774 solves | - | |
Simple LoginWeb | 588 solves | Top 28% = 84/300 users | |
EmojifyWeb | 529 solves | - | |
507 solves | - | ||
455 solves | - | ||
hit-and-missMisc | 352 solves | - | |
super-tomatoCrypto | 347 solves | - | |
echoPwn | 345 solves | Top 32% = 56/174 users | |
Xmas LoginWeb | 311 solves | - | |
307 solves | - | ||
Alpaca BankWeb | 304 solves | - | |
295 solves | - | ||
292 solves | - | ||
size limitCrypto | 289 solves | - | |
πWeb | 287 solves | - | |
Encoding BasicsMisc Crypto | 287 solves | - | |
108Misc | 269 solves | - | |
266 solves | Top 15% = 71/458 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)