Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields (Q1620973): Difference between revisions
From MaRDI portal
Latest revision as of 03:08, 15 September 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields |
scientific article |
Statements
Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields (English)
0 references
15 November 2018
0 references
discrete logarithm problem
0 references
finite fields
0 references
pairing-based cryptography
0 references
0 references
0 references
0 references
0 references