why $e(g,g)^N=1$ in bilinear pairings holds?

I can't get the point of prime order bilinear pairings:$\mathbb{G}\times\mathbb{G}\rightarrow\mathbb{G}_T$,$g=$ generator of $\mathbb{G}$ , $N=p*q$, $p$ and $q$ primes and $e(g,g)^N=1$. why $e(g,g)^N=1$ holds? Why is it 1?

-

1 Answer

If $N$ is the order of the group $\mathbb{G}_T$, then for any element $x \in \mathbb{G}_T$ we have that $x^N = 1$. This follows from the Lagrange theorem. Since $e(g,g) \in \mathbb{G}_T$, the same applies to it.

-
So the reason is because: $e(g,g)^N=e(g^q,g^p)=e(1,1)=1$ Right? If i have e$(g^q,x) =e(1,x)$ this is equal to 1 also? – curious Sep 27 '12 at 13:14

1
No, if the order of $g$ is the composite $N$, then $g^q$ and $g^p$ will be different than $1$. The reason that $e(g,g)^N = 1$ holds is that $e(g,g)$ is the generator of $\mathbb{G}_T$ and has order $N$. – Conrado PLG Sep 27 '12 at 16:22
$e(g^{a1},g^{a2})^N=1$ holds also? – curious Sep 27 '12 at 16:52
Yes, since $e(g^{a_1},g^{a_2})^N = e(g,g)^{N a_1 a_2} = (e(g,g)^N)^{a_1 a_2} = 1^{a_1 a_2} = 1$. – Conrado PLG Sep 27 '12 at 19:03
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 27, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9249704480171204, "perplexity_flag": "head"}