In this paper, we first provide some properties of truth tables of bent functions. Furthermore, a upper bound of truth table's runs length of a bent function is presented. Based on these results, we propose a new algorithm for enumerating bent functions. At last, we find that our algorithm requires lower storage complexity and is easier to implement with parallel/distributed computing infrastructures by comparing with some known searching algorithms.
