Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring (Q1606932): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q29544284 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(99)00047-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2085772322 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:32, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring |
scientific article |
Statements
Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring (English)
0 references
25 July 2002
0 references
generalized Diffie-Hellman assumption
0 references
factorization algorithm
0 references
Blum integers
0 references
