# How to calculate mapping in bilinear

I am trying to read a paper in cryptography. In key generation phase, paper give a definition for bilinear like G and Gt be two cyclic groups of prime order p

$e: G * G \to G_t$. be a map with the following properties:

and in one place i found a definition like

my doubt is in the last part. Specifically in m.e(g1,gn)^t suppose m is any message, g1=3,gn=13 t=6 (for more information v=5,gi=10.no problem whether all the value assumptions are true or not). then how can i compute e(g1,gn)^t part? sorry for my bad math notation

• You need Miller algorithm to calculate the map, and it could be a challenge to follow properties of rational functions on the curve with variables from field extensions. crypto.stanford.edu/miller – Vadym Fedyukovych Dec 3 '15 at 12:40
• mathoverflow.net/questions/68942/… – Vadym Fedyukovych Dec 3 '15 at 14:30
• Sorry, still i didnt get that. It will be great if you explain me with my given sample data.i got the first two part in cipher text. Remaining is e(g1,gn)^t. @Vadym Fedyukovych – John Mathew Dec 3 '15 at 15:41
• The bitmap in the question is from this paper: Cheng-Kang Chu, Sherman S.M. Chow, Wen-Guey Tzeng, Jianying Zhou, Robert H. Deng, Key-Aggregate Cryptosystem for Scalable Data Sharing in Cloud Storage in IEEE Transactions on Parallel and Distributed Systems, vol. 25, no. 2,(Feb., 2014). – fgrieu Dec 3 '15 at 17:49
• I was trying to give an estimate on problem complexity. It will be hard. To understand bilinear map, one need to start from finite fields textbook up to whatever it takes to learn Miller algorithm. If you prefer "data sharing implementation: done" path, consider a library with map implemented there. For example, PBC, introduced at the thesis referenced in the other question. @John Mathew – Vadym Fedyukovych Dec 3 '15 at 19:57

According to PBC manual, Pairing functions, map $\hat e(,)$ (without t-power) could be calculated as follows:
pairing_pp_t pp;