Adaptive Bitwise Division-based Searching Algorithm for Batch Verification

Abstract

With the development of multicore processor, parallel computation is adopted to accelerate computation for higher efficiency. In signature verification process, batch verification has a high efficiency due to its aggregate operation. However, when there exists a invalid signature, the verification turns out failure, which is time-consuming. This paper proposes an adaptive bitwise division-based searching (ABDS) algorithm to provide a solution to the challenge. When there is only one invalid signature, the time complexity of ABDS algorithm is O(n) = 2 in parallel computation, while that of binary search (BS) algorithm is 1 + log 2n. Compared with BS algorithm, ABDS algorithm has a significant advantage in parallel computation when there are a small number of invalid signatures. The work can be used in searching problem where verification time greatly exceeds aggregation time.