A system for cyclic redundancy check (CRC) calculations with modulo-2 multiplication is disclosed for repetitive CRC computations that optimizes processing efficiency and maximizes capacity. The resulting system results in the use of relatively fewer logical gates and conserves on power. The system receives a message ({right arrow over (m)}) including a plurality of blocks ({right arrow over (b)}.sub.i) and a set of pre-computed coefficients ({right arrow over (.beta.)}.sub.i). The system performs a modulo-2 multiply-accumulate operation on the message ({right arrow over (m)}) using the relationship given by:.function..fwdarw..ident..times..fwdarw..beta..fwdarw. ##EQU00001##