Rows:
| CHALLENGE | AUTHORS | SOLVES (CURRENT) | SOLVE RATE (AT CONTEST TIME) |
|---|---|---|---|
WelcomeMisc | 1379 solves | - | |
AlpacaHack 2100Misc | 1070 solves | - | |
a fact of CTFCrypto | 660 solves | - | |
Simple LoginWeb | 553 solves | Top 28% = 84/300 users | |
EmojifyWeb | 464 solves | - | |
432 solves | - | ||
388 solves | - | ||
echoPwn | 332 solves | Top 32% = 56/174 users | |
hit-and-missMisc | 293 solves | - | |
super-tomatoCrypto | 287 solves | - | |
267 solves | - | ||
Alpaca BankWeb | 266 solves | - | |
263 solves | Top 15% = 71/458 users | ||
size limitCrypto | 261 solves | - | |
258 solves | - | ||
254 solves | - | ||
Xmas LoginWeb | 254 solves | - | |
πWeb | 253 solves | - | |
qrimeCrypto | 245 solves | Top 38% = 91/239 users | |
Encoding BasicsMisc Crypto | 236 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)