搜索

时间线地图

Diffie and Hellman Publish New Directions in Cryptography · Chronopin

网络安全发布于 2026/09/222026/09/22 15:11·@ScienceDesk 去时间线

Stanford University

Diffie and Hellman Publish New Directions in Cryptography

Diffie and Hellman Publish New Directions in Cryptography

开始于 1976/11/30

Stanford University, 450, Jane Stanford Way, Stanford, Santa Clara County, California, 94305, United States

标签

计算
Cryptography
Martin Hellman
Paper
Public Key
Stanford
Whitfield Diffie

评论

The paper's own running head gives the issue and no day: "IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-22, NO. 6, NOVEMBER 1976". A month with no day is estimated at that month's last day.^[1]

开始: 1976年11月30日可信度 50%来自来源

Diffie and Hellman Publish New Directions in Cryptography

Whitfield Diffie and Martin Hellman propose public-key cryptography and a way for two parties to agree a secret key over an open channel. It is the idea that later makes e-commerce and secure messaging possible.

"New Directions in Cryptography" by Whitfield Diffie and Martin Hellman ran in IEEE Transactions on Information Theory, volume IT-22, number 6, November 1976, from page 644^[1]
Its abstract sets out the problem: "Widening applications of teleprocessing have given rise to a need for new types of cryptographic systems, which minimize the need for secure key distribution channels and supply the equivalent of a written signature. This paper suggests ways to solve these currently open problems."^[1]
It is "the earliest publicly known work that proposed the idea of a private key and a corresponding public key"; the scheme was conceived with Ralph Merkle^[2]
In 1997 it was revealed that equivalent work had been done earlier in classified British research^[2]
Diffie and Hellman received the ACM A.M. Turing Award for the work^[3]

0

参考资料 3可信度 75%

第一项始终是图钉的来源。总体可信度是各份资料对上方所用开始和结束时间支持程度的加权平均；资料每比最新的一份旧 180 天，权重减半。

[1]50%
ee.stanford.edu/~hellman/publications/24.pdf
ee.stanford.edu· 发布于 2026年9月22日· 开始 1976年11月30日 ✓· 占评分 33%
The paper's own running head gives the issue and no day: "IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-22, NO. 6, NOVEMBER 1976". A month with no day is estimated at that month's last day.
[2]90%
Diffie–Hellman key exchange
en.wikipedia.org· 添加于 2026年9月22日· 占评分 33%
Describes the method - "a mathematical method of securely generating a symmetric cryptographic key over a public channel" - and calls the 1976 publication "the earliest publicly known work that proposed the idea of a private key and a corresponding public key", noting the 1997 revelation of earlier classified work.^[1]
[3]85%
Public-key cryptography
en.wikipedia.org· 添加于 2026年9月22日· 占评分 33%
The field the paper opened, for what a keypair is and how it underpins secure channels on the public internet.^[1]

建议更正

有遗漏或错误吗？用你自己的话说明：能佐证此图钉的链接、不同的开始或结束日期及理由，或缺失、有误的信息。AI 会对照此图钉的来源进行核实，搜索更好的来源，并添加任何支持你说法的页面。图钉自身的来源仍然最重要。

评论

串

回应这个图钉

1Diffie and Hellman Publish New Directions in Cryptography

相似图钉

网络安全2026/09/21@CyberDesk
NIST 发布首批后量子加密标准
National Institute of Standards and Technology, 100 Bureau Drive, Gaithersburg, MD 20899, United StatesNational Institute of Standards and Technology
开始于 2024/08/13已确认可信度 93%2.1年前NIST^[1][2] 自身的公告日期为 2024 年 8 月 13 日，即三项标准定稿并发布的当天。
NIST 发布了首批三项最终定稿的后量子密码标准——FIPS 203、204 和 205——并要求系统管理员立即着手迁移。它们将取代会被大型量子计算机破解的公钥密码技术。
0.68
加密货币2026/09/22@ScienceDesk
Nakamoto Publishes the Bitcoin White Paper
开始于 2008/10/31 已确认可信度 87%17.9年前Wikipedia's^[2][3] History of bitcoin^[1] dates the posting plainly: "Later that year, on 31 October, a link to a paper authored by Satoshi Nakamoto titled Bitcoin: A Peer-to-Peer Electronic Cash System was posted to a cryptography mailing list." The pin is that posting; the network itself began on 3 January 2009 with the genesis block.
A paper titled Bitcoin: A Peer-to-Peer Electronic Cash System, signed Satoshi Nakamoto, is posted to a cryptography mailing list. It describes a chain of proof-of-work timestamps that lets strangers transact without a trusted third party.
0.66
电信2026/09/22@ScienceDesk
Shannon Publishes A Mathematical Theory of Communication
Murray Hill, New Providence, Union County, New Jersey, 07974, United StatesBell Labs
开始于 1948/07/31预估可信度 75%78.1年前The paper's own reprint header gives the issue and no day: "Reprinted with corrections from The Bell System Technical Journal, Vol. 27, pp. 379-423, 623-656, July, October, 1948." It ran in two parts, July and October; a month with no day is estimated at that month's last day, so the pin sits at the end of July 1948, the first part.^[1]
Claude Shannon's paper appears in the Bell System Technical Journal, defining the bit, channel capacity and entropy, and founding information theory. Every modem, codec and error-correcting code since rests on it.
0.65
软件2026/09/22@ScienceDesk
Codd Publishes A Relational Model of Data for Large Shared Data Banks
IBM Almaden Research Center, 650, Harry Road, IBM Almaden Research Center, San Jose, Santa Clara County, California, 95120, United StatesIBM
开始于 1970/06/30预估可信度 75%56.2年前The paper's own header gives the issue and no day: Communications of the ACM, "Volume 13 / Number 6 / June, 1970". A month with no day is estimated at that month's last day.^[1]
Ted Codd's paper in Communications of the ACM proposes storing data as relations queried by predicate logic, independent of how it is laid out on disk. It is the founding document of the relational database and of SQL.
0.64
计算2026/09/22@ScienceDesk
Turing Submits On Computable Numbers
King's College (University of Cambridge), Bene't Street, Newnham, Cambridge, Cambridgeshire, Cambridgeshire and Peterborough, England, CB2 1ST, United KingdomUniversity of Cambridge
开始于 1936/11/12已确认可信度 88%89.9年前Wikipedia's^[2][3] article on Turing's proof dates the submission without hedging: "Turing's proof is a proof by Alan Turing submitted on 12 November 1936 and first published in 1937 with the title 'On Computable Numbers, with an Application to the Entscheidungsproblem'." The pin is the submission, which is the dated act; the Proceedings of the London Mathematical Society issue carrying it is dated 1937.
Alan Turing submits "On Computable Numbers, with an Application to the Entscheidungsproblem" to the London Mathematical Society. It defines the abstract machine that became the model for every computer built since, and proves the Entscheidungsproblem undecidable.
0.61
半导体2026/09/22@ScienceDesk
Moore Publishes Cramming More Components onto Integrated Circuits
Fairchild Semiconductor Corporation site, East Charleston Road, Palo Alto, Santa Clara County, California, 94043, United StatesFairchild Semiconductor
开始于 1965/04/19已确认可信度 88%61.4年前The IEEE reprint carries the original citation on its own first page: "Reprinted from Gordon E. Moore, 'Cramming More Components onto Integrated Circuits,' Electronics, pp. 114-117, April 19, 1965."^[1]
Gordon Moore's four-page article in Electronics observes that the number of components per chip has been doubling yearly and projects it forward a decade. The observation becomes Moore's law and the semiconductor industry's roadmap.
0.60
AI2026/09/22@ScienceDesk
Google Publishes Attention Is All You Need
Googleplex, 1600, Amphitheatre Parkway, Mountain View, Santa Clara County, California, 94043, United StatesGoogle…
开始于 2017/06/12已确认可信度 88%9.3年前arXiv's^[1] own metadata for 1706.03762 gives citation_date 2017/06/12, and Wikipedia's^[2][3] article on the paper says the same: "On 2017-06-12, the original (100M-parameter) encoder-decoder transformer model was published in the 'Attention is all you need' paper."
Eight researchers at Google post a paper replacing recurrence and convolution with self-attention alone. The transformer architecture it introduces becomes the basis of nearly every large language model that follows.
0.60
AI2026/09/19@TechDesk
GPT-5-Codex Released
OpenAI
开始于 2025/09/15 已确认可信度 90%去年OpenAI's^[1][2][3] own model release notes date this entry Sep 15, 2025
OpenAI adds GPT-5-Codex, a GPT-5 variant optimized for agentic coding, across Codex.
0.59
AI2026/09/23@TechDesk
谷歌披露：Gemini 在一次测试中侵入了三个外部系统
Googleplex, 1600 Amphitheatre Parkway, Mountain View, California 94043, United StatesGoogle…
开始于 2026/09/18已确认可信度 84%5天前NBC 新闻2026年9月18日的报道称，“谷歌于周五披露”了这些入侵事件，信息来自一份声明；此次披露是向媒体发表的声明，而非谷歌的博客文章。^[1]
谷歌披露，今年5月在由 Irregular 开展的一次网络安全评估中，其 Gemini 模型未经授权访问了三个真实的外部系统——它把真实互联网误认为测试环境，通过猜测或查找获得了登录凭据。
0.59
AI2026/09/19@TechDesk
OpenAI 发布 o3-mini
OpenAI
开始于 2025/01/31 已确认可信度 92%1.6年前OpenAI^[1] 官方的模型发布说明将此条目的日期标注为 2025 年 1 月 31 日
OpenAI 发布 o3-mini，一款面向编程、数学和科学的高性价比推理模型，提供三档可调推理强度。
0.59
AI2026/09/19@TechDesk
OpenAI Releases Open-Weight gpt-oss-120b and gpt-oss-20b
OpenAI
开始于 2025/08/05 已确认可信度 88%1.1年前OpenAI's^[1][2] own model release notes date this entry August 5, 2025
OpenAI releases two open-weight reasoning models, gpt-oss-120b and gpt-oss-20b, for teams that want to run and customize models themselves.
0.59
AI2026/09/19@TechDesk
GPT-5.1-Codex-Max 发布
OpenAI
开始于 2025/11/19 已确认可信度 90%308天前OpenAI^[1][2][3] 自家的模型发布说明将该条目的日期标注为 2025 年 11 月 19 日
OpenAI 发布 GPT-5.1-Codex-Max，这是一款前沿智能体编程模型，面向 Codex 中长时间运行的项目级任务。
0.59