Rows:
| CHALLENGE | AUTHORS | SOLVES (CURRENT) | SOLVE RATE (AT CONTEST TIME) |
|---|---|---|---|
AlpacaHack 2100Misc | 1545 solves | - | |
WelcomeMisc | 1524 solves | - | |
a fact of CTFCrypto | 849 solves | - | |
Simple LoginWeb | 605 solves | Top 28% = 84/300 users | |
EmojifyWeb | 570 solves | - | |
540 solves | - | ||
484 solves | - | ||
super-tomatoCrypto | 373 solves | - | |
hit-and-missMisc | 371 solves | - | |
echoPwn | 352 solves | Top 32% = 56/174 users | |
Xmas LoginWeb | 334 solves | - | |
329 solves | - | ||
Alpaca BankWeb | 320 solves | - | |
314 solves | - | ||
size limitCrypto | 306 solves | - | |
305 solves | - | ||
Encoding BasicsMisc Crypto | 302 solves | - | |
🐈Web | 299 solves | - | |
108Misc | 283 solves | - | |
276 solves | - |
Rows:
一見複雑に見える式でも、実は単純な計算の最適化結果かもしれません。
chal と、元ソースコードの chal.c が与えられています。chal.c ソースコードの処理内容を解析して、 chal バイナリの出力が Correct! となるような入力(= フラグ)を探すことです。