Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring (Q1606932): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q29544284, #quickstatements; #temporary_batch_1705870497004 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q29544284 / rank | |||
Normal rank | |||
Revision as of 21:55, 21 January 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
