This paper aims to investigate the performance of various well-known hashing techniques utilized in Bloom filters which are building blocks of public bus ticketing systems in practice. Bloom filters, known for their efficiency in membership testing, rely heavily on the quality of hash functions to achieve high performance. By integrating a Bloom-filter-based approach into an automatic bus ticketing system, we reduce database query overhead and enhance operational efficiency. Our study evaluates both cryptographic and non-cryptographic hashing techniques in terms of computational speed, false positive rates, and practical applicability. Experimental results highlight the significant impact of hash function selection on system performance, with non-cryptographic functions like MurmurHash3 achieving a superior balance between speed and accuracy. This study demonstrates the broader implications of hash function performance on Bloom filter designs and their potential for scalable, real-world systems.