Card-based cryptography enables players to compute bitwise operations securely, such as bitwise AND and addition of integers. Several multiparty computation protocols and zero-knowledge proof protocols utilizing these secure computations have been developed as applications. However, the realization of an efficient protocol for integer multiplication and division remains an open problem. This paper proposes card-based protocols for multiplication and division based on integer commitment. Compared to general constructions for protocols for multiplication and division based on binary integer commitment, the proposed protocols exhibit superior simplicity and efficiency. Furthermore, these protocols introduce novel applications for card-based cryptography to secure statistical data aggregation.