This paper establishes a classification of the critical numbers for restricted sumsets in finite abelian groups, determining them exactly for even-order groups and bounding them for odd-order groups, while revealing a fundamental structural dichotomy governed by parity. For groups of even order, we prove a universal rigidity theorem: the index-$2$ subgroup creates an immutable arithmetic barrier at density $1/2$, fixing the critical number at $|G|/2+1$ regardless of the group's internal structure. In sharp contrast, we demonstrate that for groups of odd order, this barrier vanishes, causing the critical threshold to collapse to significantly lower densities bounded by index-$5$ obstructions or the smallest prime divisor. These results unify and vastly generalize previous work on cyclic groups, providing a definitive structural theory for the transition from sparsity to saturation. As a decisive application, we resolve a conjecture of Han and Ren in algebraic coding theory. By translating the additive rigidity at density $1/2$ into a geometric constraint, we prove that for all sufficiently large $q$, any subset of rational points on an elliptic curve $E/\mathbb{F}_q$ generating an MDS code must satisfy the tight bound $|P|\le|E(\mathbb{F}_q)|/2$.