cryptoProhard

Coloring Heist

scarlet

Task: break a zero-knowledge proof for graph 3-coloring by predicting server-generated salts. Solution: exploit a truncated LCG by recovering its full state via a lattice (LLL) attack on known outputs, then predict all salts to match commitments to colors.

$ ls tags/ techniques/
lattice_attacklcg_state_recoverytruncated_output_attacklll_reduction

🔒

Permission denied (requires tier.pro)

Sign in to access full writeups

Sign in with GitHub to continue. No email required.

$sign in

$ grep --similar

Similar writeups