Rows:
| CHALLENGE | AUTHORS | SOLVES (CURRENT) | SOLVE RATE (AT CONTEST TIME) |
|---|---|---|---|
AlpacaHack 2100Misc | 1651 solves | - | |
WelcomeMisc | 1547 solves | - | |
a fact of CTFCrypto | 886 solves | - | |
Simple LoginWeb | 612 solves | Top 28% = 84/300 users | |
EmojifyWeb | 597 solves | - | |
571 solves | - | ||
510 solves | Top 73% = 683/928 teams | ||
super-tomatoCrypto | 393 solves | - | |
hit-and-missMisc | 388 solves | - | |
echoPwn | 358 solves | Top 32% = 56/174 users | |
Xmas LoginWeb | 356 solves | - | |
347 solves | - | ||
Alpaca BankWeb | 334 solves | - | |
328 solves | - | ||
size limitCrypto | 320 solves | - | |
Encoding BasicsMisc Crypto | 320 solves | - | |
315 solves | - | ||
🐈Web | 314 solves | - | |
BarsWeb | 302 solves | - | |
108Misc | 296 solves | - |
Rows:
一見複雑に見える式でも、実は単純な計算の最適化結果かもしれません。
chal と、元ソースコードの chal.c が与えられています。chal.c ソースコードの処理内容を解析して、 chal バイナリの出力が Correct! となるような入力(= フラグ)を探すことです。