Matyas-Meyer-Oseas (MMO), Davies-Meyer (DM), and Miyaguchi Preneel (MP) schemes are block cipher based hash functions that used to provide data integrity mechanism. These schemes should be able to fulfill the collision resistance properties. In this paper, we analyze the implementation of Simplified AES (S-AES) algorithm as a compression function on MMO, DM, and MP schemes. We use Yuval’s birthday attack to test the collision resistance of these schemes by conducting 120 experiments of extreme input and pseudo random input. The test results show that the collision occurred. Yuval’s birthday attack for extreme input show that MP has a least number of collisions where MP, DM, and MMO have 102, 112, and 140 collisions, respectively. Otherwise, Yuval’s birthday attack for pseudo random input show that MP has a greatest number of collisions, where MP, DM, and MMO 157, 133, and 117 collisions, respectively. Thus, these three schemes using either extreme or pseudo random input are not resistant to the collision.