The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms (Q4268814): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 15:04, 5 March 2024
scientific article; zbMATH DE number 1354457
Language | Label | Description | Also known as |
---|---|---|---|
English | The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms |
scientific article; zbMATH DE number 1354457 |
Statements
The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms (English)
0 references
28 October 1999
0 references
public-key cryptography
0 references
Diffie-Hellman protocol
0 references
discrete logarithms
0 references
finite fields
0 references
elliptic curves
0 references