Improving the Diffie-Hellman Secure Key Exchange
Bibliographic record
Abstract
Diffie-Hellman (DH) is a well-known cryptographic algorithm used for secure key exchange. The first appearance of DH was in 1976. The algorithm allows two users to exchange a symmetric secret key through an insecure wired or wireless channel and without any prior secrets. DH works under the domain of integers Z*/sub n/ where n = p. Here, p and /spl alpha/ are the two parameters of DH where p is a large prime number and /spl alpha/ is a generator selected from the cyclic group Z*/sub n/. In this paper, we propose two modifications of DH. The first modification is to change the domain to integer with n=2p/sup t/ where Z*/sub n/ is still cyclic and the second modification is to change the domain to Gaussian arithmetic Z*/sub n/. After implementing the three algorithms we found that the symmetric key size derived from the two modified algorithms is much greater than the classical one. Moreover, attacking the two modified algorithms using Pohlig-Hellman algorithm, using the same prime value p and private value a or b, needs much more time than the classical one.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.004 | 0.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.009 |
| Open science | 0.003 | 0.003 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".