Pairing-based cryptography: Difference between revisions

Revision as of 07:33, 1 July 2021

Revision as of 04:05, 6 July 2021

Line 15:

# <math> G_1 = G_2</math>;

# <math> G_1 \ne G_2</math> but there is an ''efficiently computable'' [[homomorphism]] <math>\phi : G_2 \to G_1</math>;

# <math> G_1 \ne G_2</math> and there are no ''efficiently computable'' homomorphisms between <math>G_1</math> and <math>G_2</math>.<ref name="pfc">{{cite journal|last1=Galbraith|first1=Steven|last2=Paterson|first2=Kenneth|last3=Smart|first3=Nigel|title=Pairings for Cryptographers|journal=Discrete Applied Mathematics|date=2008|volume=156|issue=16|pages=3113–3121|doi=10.1016/j.dam.2007.12.010|doi-access=free}}</ref>

==Usage in cryptography==