Galil, Landau and Yung proposed the synchronous broadcasting network as a model for distributed computation and studied the multiple identification problem, where each of the p processors has a bit-string of length n and wants to determine the subset of processors that have the same string as itself. They described an O(n log
2p + p) algorithm where the processors do not use any algebraic operations. In this paper an improved version is given with complexity O(n log p) for the case n
p and O(n log p loglog p + p) for the general case.