The complexity of certain multi-exponentiation techniques in cryptography (Q2499259)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5045606
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of certain multi-exponentiation techniques in cryptography |
scientific article; zbMATH DE number 5045606 |
Statements
The complexity of certain multi-exponentiation techniques in cryptography (English)
0 references
14 August 2006
0 references
exponentiation
0 references
scalar multiplication
0 references
integer recoding
0 references
elliptic and hyperelliptic curves
0 references
trace zero varieties
0 references
XTR
0 references
groups with automorphisms
0 references
0.89278585
0 references
0.88976026
0 references
0.8843404
0 references
0.88347614
0 references
0.88129574
0 references
0.8811268
0 references
