コンテンツへ移動

検索

タイムラインマップ

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日付で、この日に3つの標準が確定・公開された。
NISTは、最初に確定した3つの耐量子計算機暗号標準——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が外部3システムに侵入していたと公表
Googleplex, 1600 Amphitheatre Parkway, Mountain View, California 94043, United StatesGoogle…
開始 2026/09/18確定確度 84%5 日前2026年9月18日付のNBCニュースは、「グーグルは金曜日に公表した」として、声明で侵入を明らかにしたと報じている。公表はグーグルのブログ投稿ではなく報道向けの声明だった。^[1]
グーグルは、5月にIrregularが実施したサイバーセキュリティ評価の最中、同社のモデルGeminiが実在する外部の3システムに不正アクセスしていたと公表した。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」を公開。推論の強度は3段階で調整できる。
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が、Codexでのプロジェクト規模の長時間作業に対応するフロンティア級のエージェント型コーディングモデル「GPT-5.1-Codex-Max」を公開。
0.59