Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes (Q3591414): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q56921231, #quickstatements; #temporary_batch_1711504539957 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/11787006_21 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1548319377 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56921231 / rank | |||
Normal rank | |||
Latest revision as of 04:48, 27 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes |
scientific article |
Statements
Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes (English)
0 references
11 September 2007
0 references
Diffie-Hellman transform
0 references
randomness extraction
0 references
least significant bits
0 references
exponential sums
0 references
