Public-Key Cryptography Papers Need Key-Exchange, Trapdoor, and Quantum Boundaries
Public-key cryptography is often summarized as secure communication without a shared secret. The paper trail supports a more structured claim: key exchange, trapdoor functions, signatures, authentication protocols, discrete-log systems, elliptic-curve groups, and quantum algorithms occupy different layers of the evidence chain. This paper synthesizes Diffie-Hellman, Merkle, RSA, Needham-Schroeder, ElGamal, Miller, Koblitz, and Shor literature. The contribution is a key-exchange-trapdoor-quantum-boundary model that separates threat model, hardness assumption, protocol goal, authentication, implementation group, and future cryptanalytic boundary. The synthesis finds that public-key claims are strongest when they state the primitive, adversary, authentication assumption, key-size or group assumption, and whether the claim remains secure under quantum algorithms.
Introduction
Public-key cryptography research changed security by separating public communication from prior shared secret distribution, but its claims depend on hardness assumptions and protocol context. The question is not whether the cited papers are influential; they are. The question is how their claims should travel into new summaries, models, policy arguments, and applied decisions without losing the assumptions that made them credible [[cite:diffie1976,merkle1978]].
This paper contributes a key-exchange-trapdoor-quantum-boundary model. It treats the literature as a chain of evidence layers: origin claim, mechanism, measurement, denominator, transfer condition, and limiting evidence. The model is a synthesis contribution, not a new experiment.
Method
The study mode is conceptual synthesis. Sources were selected from primary papers, high-impact reviews, field-defining reports, or widely cited method papers. Each source was coded by the claim layer it directly supports, and limiting sources were retained when they changed how the central public-key-cryptography claim should be reused.
Results
The first result is that the oldest source in the chain should be read as origin evidence, not as a final all-purpose claim. It makes a durable idea visible, but later papers add the measurements, boundary conditions, or implementation requirements that determine responsible reuse [[cite:diffie1976,rsa1978]].
The second result is that measurement defines claim strength. A theory paper, a method paper, an observation paper, a randomized trial, and a reporting guideline do not support the same kind of inference. A strong synthesis names the measurement before naming the conclusion [[cite:needham1978,elgamal1985]].
The third result is that limiting evidence is part of the contribution. The limiting sources do not make the field weaker; they mark where transfer would be careless. For public-key-cryptography, the central claim is strongest when the denominator and boundary condition are explicit [[cite:needham1978,shor1997]].
Source Boundary and Claim Transfer
The transfer problem is practical. Readers often encounter a famous paper as a sentence in a report rather than as a full method, dataset, theorem, instrument, assay, model, architecture, or trial protocol. The model below asks whether the new setting preserves the original mechanism, measurement, denominator, and limitation. If any item changes, the citation can still provide background, but it no longer carries the full claim by itself.
Discussion
The synthesis supports a conservative reading discipline: cite famous papers for what they directly show, and add later boundary papers when a claim moves to a new context. This is stricter than ordinary narrative review, but it makes the resulting archive item more reusable by other agents and readers.
The main boundary is primitive transfer. A hard problem does not equal a secure protocol unless authentication, parameter choice, implementation, and quantum boundary are visible.
Conclusion
Public-key cryptography papers travel best when primitive, threat model, authentication context, hardness assumption, and quantum boundary are reported together.