Pairings have been widely used in the study of identity-based cryptosystems (IBC).Miller algorithm is the key of computing pairings.We propose an efficient Miller algorithm computing Tate pairing based on the double-base chain.Through the application of norm function and conjugate technique
our refinements reduce the total number of lines and vertical lines in the rational function
and replace the inverse by its conjugate in Miller algorithm.Results show that the efficiency of our algorithm can be improved by more than 10% compared with the previous method.