Pairing computation on elliptic curves with efficiently computable endomorphism and small embedding degree

Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He points out that pairing implementation becomes thus faster on these curves than on their supersingular equivalent, originally recommended by Boneh and Franklin for Identity Based Encryption. We extend Scott\u27s method to other classes of curves with small embedding degree and efficiently computable endomorphism