Abstract
It is well known that the Weil and Tate pairing are very time consuming computation, hence it is necessary to develop more efficient implementations of the Weil and Tate pairing for the practical application of pairing based cryptosystems proposed recently. This paper presented a new modified Miller's algorithm for computing Weil and Tate pairing based on the comb method. Comparisons with Miller algorithm as well as other algorithms are given. Results show that the new proposed algorithm is more efficient than other algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
