I am trying to find a comparison of how different pairing-friendly elliptic curves perform (in terms of security) in real world applications;
I am using PBC library, and it has type A curves and type D curves (also , i am having hard time understanding how pairing types depend on underlying curve types, and which of them have been broken/ or are considered insecure at the moment;
At first glance, there are 3 types of pairings, type 1(symmetric), type 2 (g1!=g2, g2->g1) and type 3; i understand that different algorithms require pairings to be either of type1 or type2 or type3;
I would also like to know more about why some algorithms are limited to certain pairing types. Any references would be greatly welcome