batch verification.pdf

Introduction
ECDSA Algorithm
A Naive Algorithm for ECDSA Batch Verification
A New Batch-verification Algorithm for ECDSA (S1)
A More Efficient Batch-verification Algorithm (S2)
Efficient Variants of S1 and S2
Experimental Results
Conclusion
References
Conclusion
There are several ways to extend our study, some of which are listed
below.
◮ We described a way to reduce the running time of the
symbolic-addition phase of Algorithm S2 from O(mt 2 ) to O( √ mt 2 ).
An analogous speedup for the elimination phase would be very
useful.
◮ Our best symbolic-computation algorithm runs in O(mt 2 ) time.
Removal of a factor of t would be useful to achieve higher speedup
values.
◮ It is of interest to study our algorithms in conjunction with the
earlier works on ECDSA*.
◮ Our batch verification algorithms can be easily ported to other
curves (like the Koblitz and Pseudorandom families recommended by
NIST).
Sabyasachi Karati
Batch Verification of ECDSA Signatures AfricaCrypt 2012 Ifrane, Morocco