Coloring Fraud

scarlet

Task: Zero-Knowledge Proof protocol for graph 3-coloring on K4 (not 3-colorable) using a custom hash function with a weak reduced-round permutation. Solution: Exploited the linear (non-nonlinear) permute_fast function by building a GF(2) system of equations to find hash collisions between different colors, allowing fake ZKP proofs for 128 rounds.