Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes (Q3452347): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:13, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes |
scientific article |
Statements
Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes (English)
0 references
11 November 2015
0 references
