Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515)
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 7614562
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields |
scientific article; zbMATH DE number 7614562 |
Statements
Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (English)
0 references
9 November 2022
0 references
discrete logarithm problem
0 references
pairing-based cryptosystems
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8435847163200378
0 references
0.8296952247619629
0 references
0.8253815770149231
0 references
0.8232435584068298
0 references
