Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3035895299 / rank | |||
Normal rank | |||
Revision as of 02:01, 20 March 2024
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
