Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Based on what mentioned in the paper "Pairings For Cryptographers" the two inputs of a pairing map are two members of two additive groups on elliptic curves, while the output is an element of a multiplicative group on a finite field. enter image description here I would like to know is there any mathematical or technical advantages for a multiplicative finite filed group (in compare with an additive elliptic curve group)? or is there any mathematical or technical disadvantages for an additive elliptic curve group (in compare with multiplicative finite filed group)? The following image shows this question more accurate. enter image description here Please help me enter image description here

share|improve this question
The setting described in the paper is the only we currently know that provides pairings with all required properties. You do not really have a choice (besides which curves and concrete pairing map to use). – DrLecter Jul 15 '14 at 8:40
I replayed you at the end of my question beacause I cannot insert formula here – Mohsen Jul 15 '14 at 10:46
Formulas can be inserted here with common Latex notation, by using '$ $'. – tylo Jul 15 '14 at 11:14
See here for formatting help. – Artjom B. Jul 15 '14 at 11:24
The mathematical disadvantage for $E(F_p)$ as the target group $G_T$ is that no such construction exists. – mikeazo Jul 15 '14 at 11:42

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.