Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields |
scientific article |
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
