I'm using the Boneh-Boyen-Shacham signature scheme and want to estimate complexity in my scheme.
As reported in "Scott M., Efficient Implementation of Cryptographic pairings", if we set parameters as: MNT curve, k=6 and p~160, then P(point mul)=0.6 ms and P(pairing)=4.5 ms.
These two measured times are used in many references. I found another reference (Lu, Rongxing, et al. "A dynamic privacy-preserving key management scheme for location-based services in vanets.") stating P(point exponentiation)=0.6 ms and P(pair)=4.5 ms.
I cannot understand how can I compute processing time for multiplication and exponentiation operations in BBS scheme in following image…
- How many multiplications and exponentiations do we need, and
- what is the processing time of each operation?