Efficient Tate pairing computation using double-base chains (Q954437): Difference between revisions
From MaRDI portal
Latest revision as of 20:02, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient Tate pairing computation using double-base chains |
scientific article |
Statements
Efficient Tate pairing computation using double-base chains (English)
0 references
10 November 2008
0 references
public key cryptography
0 references
Tate pairing
0 references
elliptic curves
0 references
double-base chains
0 references
0 references