Research Article
Invalid Signatures Searching Bitwise Divisions-Based Algorithm for Vehicular Ad-Hoc Networks
Algorithm 3
Early stopping bitwise divisions’ algorithm.
| Input: nonempty Set | | Output: set | | (1) | function EFBD () | | (2) | if then | | (3) | if Verify () then | | (4) | return | | (5) | else | | (6) | return | | (7) | end if | | (8) | end if | | (9) | | | (10) | | | (11) | | | (12) | if then | | (13) | return | | (14) | end if | | (15) | if then | | (16) | return | | (17) | end if | | (18) | if then | | (19) | return SingleVerify (F) | | (20) | end if | | (21) | if then | | (22) | choose two groups on random bit | | (23) | | | (24) | | | (25) | else | | (26) | | | (27) | end if | | (28) | | | (29) | return | | (30) | end function |
|
