Polynomial representations of the Diffie-Hellman mapping (Q2730746): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Q177001 / rank | |||
Property / author | |||
Property / author: Igor E. Shparlinski / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2770462 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Diffie-Hellman protocol / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Number theoretic methods in cryptography. Complexity lower bounds / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 18:51, 3 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Polynomial representations of the Diffie-Hellman mapping |
scientific article |
Statements
Polynomial representations of the Diffie-Hellman mapping (English)
0 references
16 December 2001
0 references
cryptography
0 references
Diffie-Hellman key exchange
0 references
Diffie-Hellman decision problem
0 references
complexity lower bounds
0 references
0 references