{"title":"Introduction: The Early Lives and Lasting Legacies of Whitfield Diffie and Martin Hellman","authors":"R. Slayton","doi":"10.1145/3549993.3549996","DOIUrl":"https://doi.org/10.1145/3549993.3549996","url":null,"abstract":"","PeriodicalId":305424,"journal":{"name":"Democratizing Cryptography","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115174018","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Gift that Keeps on Giving: The Impact of Public-Key Cryptography on Theoretical Computer Science","authors":"J. Feigenbaum","doi":"10.1145/3549993.3550000","DOIUrl":"https://doi.org/10.1145/3549993.3550000","url":null,"abstract":"5.","PeriodicalId":305424,"journal":{"name":"Democratizing Cryptography","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132238102","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Creating an Open Community of Cryptographers","authors":"H. Orman","doi":"10.1145/3549993.3550001","DOIUrl":"https://doi.org/10.1145/3549993.3550001","url":null,"abstract":"","PeriodicalId":305424,"journal":{"name":"Democratizing Cryptography","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133588362","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Influence of Public-Key Cryptography on Mathematics","authors":"J. Buchmann, M. Jacobson, H. Williams","doi":"10.1145/3549993.3549999","DOIUrl":"https://doi.org/10.1145/3549993.3549999","url":null,"abstract":"","PeriodicalId":305424,"journal":{"name":"Democratizing Cryptography","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116853371","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In 1975 and 1976, Whitfield Diffie and Martin Hellman conceived and introduced fundamental new methods that changed how communications are secured. Their landmark paper “New Directions in Cryptography” explained both public key cryptography and what would become known as Diffie-Hellman key exchange. These ideas, influenced and augmented by a few souls within a small community, set the world on a new course by establishing novel cryptographic techniques for protecting information transmitted over untrusted channels. Our aim herein is to consider how public key cryptography has changed the world, and in particular its impact on society. We review the original contributions of Diffie and Hellman, and provide context to relate these to pre-existing and subsequent cryptographic techniques. Aided by this understanding, we connect their contributions to resulting major changes in society. To retain accessibility for non-specialists, our treatment largely avoids mathematical details, while selectively introducing technical terms to maintain technical accuracy. 1 Security background We begin with some basic concepts and terminology to develop a working vocabulary. When information is transmitted over a physical channel (physical line) such as a traditional phone line, cable, or optical fibre, the line may be physically shielded or isolated, to reduce the risk of unauthorized access such as by a physical wiretap. If such a communication channel is accessible to unintended parties, it is called an open or untrusted channel. In general, ordinary information (plaintext) sent over untrusted channels is at risk of interception. For example, plaintext sent over a radio channel is accessible to anyone with a suitable wireless receiver. A common defense is to convert plaintext characters into a related sequence of characters (ciphertext) that are not meaningful even if intercepted. To do so, at the sender’s end a sequence of instructions (called an encryption algorithm) is used to convert plaintext to ciphertext, which is then transmitted. To recover the plaintext, the operation is reversed at the receiver’s end by a decryption algorithm. In this way, encryption provides a confidentiality property, whereby the meaningful content is available only to authorized parties. Unauthorized parties cannot recover the plaintext because the encryption and decryption algorithms require a secret number, which may be viewed as a random string of 0s and 1s; 128 of these would be called a 128-bit cryptographic key. The aim is that only the sender and recipient (i.e., their computing devices) share this secret key.1 Historically, decryption requires the same key as used for encryption; in this case we use the terms symmetric-key algorithms and symmetric keys. Distinct from confidentiality or secrecy is the concept of authentication. The ability to recognize individuals (entity authentication) is taken for granted in human-to-human interactions, but more challenging in written comm
1975年和1976年，惠特菲尔德·迪菲和马丁·赫尔曼构想并引入了根本性的新方法，改变了通信的安全方式。他们的里程碑式论文《密码学的新方向》解释了公钥密码学和后来被称为迪菲-赫尔曼密钥交换的东西。这些想法受到一个小社区中少数人的影响和增强，通过建立新的加密技术来保护在不受信任的渠道上传输的信息，使世界走上了一条新的道路。我们在这里的目的是考虑公钥加密是如何改变世界的，特别是它对社会的影响。我们回顾了Diffie和Hellman的原始贡献，并提供了将这些贡献与现有的和后续的加密技术联系起来的上下文。在这种理解的帮助下，我们将他们的贡献与社会的重大变化联系起来。为了保持非专业人员的可访问性，我们的处理在很大程度上避免了数学细节，同时有选择地引入技术术语以保持技术准确性。我们从一些基本概念和术语开始，以形成一个工作词汇表。当信息通过物理通道(物理线路)(如传统的电话线、电缆或光纤)传输时，该线路可能被物理屏蔽或隔离，以减少未经授权访问(如物理窃听)的风险。如果这样的通信通道可供非预期的各方访问，则称为开放通道或不可信通道。一般来说，通过不可信通道发送的普通信息(明文)有被拦截的风险。例如，任何人只要有合适的无线接收器就可以访问通过无线电信道发送的明文。一种常见的防御方法是将明文字符转换为即使被截获也没有意义的相关字符序列(密文)。为此，在发送端使用一系列指令(称为加密算法)将明文转换为密文，然后传输密文。为了恢复明文，在接收端通过解密算法反转操作。通过这种方式，加密提供了一种机密性，因此有意义的内容仅对授权方可用。未经授权的各方无法恢复明文，因为加密和解密算法需要一个秘密数字，这可能被视为0和1的随机字符串;其中128个被称为128位加密密钥。目的是只有发送方和接收方(即他们的计算设备)共享这个密钥从历史上看，解密需要与加密相同的密钥;在这种情况下，我们使用术语对称密钥算法和对称密钥。与机密性或保密性不同的是身份验证的概念。识别个人(实体身份验证)的能力在人与人之间的交互中被认为是理所当然的，但在书面通信中更具挑战性。(你能确定你收到的明信片是你姐姐寄来的吗?)为了提供适度的身份验证，而不仅仅依赖于上下文和语义内容，我们通常* 3 Nov 2020。作为民主化密码学的一章，R. Slayton(主编)，ACM出版社。1将加密过程视为算法，密钥是必需的输入参数。对于给定的明文消息，不同的密钥会产生不同的密文。
{"title":"Public Key Cryptography’s Impact on Society: How Diffie and Hellman Changed the World","authors":"P. V. Oorschot","doi":"10.1145/3549993.3549997","DOIUrl":"https://doi.org/10.1145/3549993.3549997","url":null,"abstract":"In 1975 and 1976, Whitfield Diffie and Martin Hellman conceived and introduced fundamental new methods that changed how communications are secured. Their landmark paper “New Directions in Cryptography” explained both public key cryptography and what would become known as Diffie-Hellman key exchange. These ideas, influenced and augmented by a few souls within a small community, set the world on a new course by establishing novel cryptographic techniques for protecting information transmitted over untrusted channels. Our aim herein is to consider how public key cryptography has changed the world, and in particular its impact on society. We review the original contributions of Diffie and Hellman, and provide context to relate these to pre-existing and subsequent cryptographic techniques. Aided by this understanding, we connect their contributions to resulting major changes in society. To retain accessibility for non-specialists, our treatment largely avoids mathematical details, while selectively introducing technical terms to maintain technical accuracy. 1 Security background We begin with some basic concepts and terminology to develop a working vocabulary. When information is transmitted over a physical channel (physical line) such as a traditional phone line, cable, or optical fibre, the line may be physically shielded or isolated, to reduce the risk of unauthorized access such as by a physical wiretap. If such a communication channel is accessible to unintended parties, it is called an open or untrusted channel. In general, ordinary information (plaintext) sent over untrusted channels is at risk of interception. For example, plaintext sent over a radio channel is accessible to anyone with a suitable wireless receiver. A common defense is to convert plaintext characters into a related sequence of characters (ciphertext) that are not meaningful even if intercepted. To do so, at the sender’s end a sequence of instructions (called an encryption algorithm) is used to convert plaintext to ciphertext, which is then transmitted. To recover the plaintext, the operation is reversed at the receiver’s end by a decryption algorithm. In this way, encryption provides a confidentiality property, whereby the meaningful content is available only to authorized parties. Unauthorized parties cannot recover the plaintext because the encryption and decryption algorithms require a secret number, which may be viewed as a random string of 0s and 1s; 128 of these would be called a 128-bit cryptographic key. The aim is that only the sender and recipient (i.e., their computing devices) share this secret key.1 Historically, decryption requires the same key as used for encryption; in this case we use the terms symmetric-key algorithms and symmetric keys. Distinct from confidentiality or secrecy is the concept of authentication. The ability to recognize individuals (entity authentication) is taken for granted in human-to-human interactions, but more challenging in written comm","PeriodicalId":305424,"journal":{"name":"Democratizing Cryptography","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126404365","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Page 1 Photographed by Richard Morgenstein, http://www.morgenstein. com/. Page 8 Chuck Painter / Stanford News Service. Heidelberg Laurate Forum Foundation. Page 14 Page 259 Heidelberg Laureate Forum Foundation. “The Heidelberg Laureate Forum Foundation presents the HLF Portraits: Whitfield Diffie.” Online video clip. YouTube, posted Jul 4, 2017. Web. Accessed Aug 17, 2017. Transcript used by permission. Heidelberg Laureate Forum Foundation. “The Heidelberg Laureate Forum Foundation presents the HLF Portraits: Martin Hellman.” Online video clip. YouTube, posted Jul 4, 2017. Web. Accessed Aug 17, 2017. Transcript used by permission. Page 281
Richard Morgenstein拍摄，http://www.morgenstein。com/。第8页Chuck Painter /斯坦福新闻服务。海德堡桂冠论坛基金会。第14页第259页海德堡桂冠论坛基金会。“海德堡获奖者论坛基金会展出HLF肖像:惠特菲尔德·迪菲。”在线视频剪辑。YouTube, 2017年7月4日发布。网络。2017年8月17日发布。文字记录经许可使用。海德堡桂冠论坛基金会。“海德堡获奖者论坛基金会展示了HLF肖像:马丁·赫尔曼。”在线视频剪辑。YouTube, 2017年7月4日发布。网络。2017年8月17日发布。文字记录经许可使用。281页
{"title":"Text and Photo Credits","authors":"Photo Credits","doi":"10.1145/3549993.3549995","DOIUrl":"https://doi.org/10.1145/3549993.3549995","url":null,"abstract":"Page 1 Photographed by Richard Morgenstein, http://www.morgenstein. com/. Page 8 Chuck Painter / Stanford News Service. Heidelberg Laurate Forum Foundation. Page 14 Page 259 Heidelberg Laureate Forum Foundation. “The Heidelberg Laureate Forum Foundation presents the HLF Portraits: Whitfield Diffie.” Online video clip. YouTube, posted Jul 4, 2017. Web. Accessed Aug 17, 2017. Transcript used by permission. Heidelberg Laureate Forum Foundation. “The Heidelberg Laureate Forum Foundation presents the HLF Portraits: Martin Hellman.” Online video clip. YouTube, posted Jul 4, 2017. Web. Accessed Aug 17, 2017. Transcript used by permission. Page 281","PeriodicalId":305424,"journal":{"name":"Democratizing Cryptography","volume":"221 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115736121","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Democratizing Cryptography: The Work of Whitfield Diffie and Martin Hellman","authors":"","doi":"10.1145/3549993","DOIUrl":"https://doi.org/10.1145/3549993","url":null,"abstract":"","PeriodicalId":305424,"journal":{"name":"Democratizing Cryptography","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130100209","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Interview with Martin Hellman","authors":"","doi":"10.1145/3549993.3550004","DOIUrl":"https://doi.org/10.1145/3549993.3550004","url":null,"abstract":"","PeriodicalId":305424,"journal":{"name":"Democratizing Cryptography","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123166043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A cryptographic system is described which is secure if and only if computing log arithms over GF ( p ) is infeasible. Previously published algorithms for computing this function require O ( p 1 / 2 ) complexity in both time and space. An improved algo rithm is derived which requires O ( log 2 p ) complexity if p − 1 has only small prime factors. Such values of p must be avoided in the cryptosystem. Constructive uses for the new algorithm are also described.
{"title":"An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance","authors":"S. Pohlig, M. E. Hellman","doi":"10.1145/3549993.3550009","DOIUrl":"https://doi.org/10.1145/3549993.3550009","url":null,"abstract":"A cryptographic system is described which is secure if and only if computing log arithms over GF ( p ) is infeasible. Previously published algorithms for computing this function require O ( p 1 / 2 ) complexity in both time and space. An improved algo rithm is derived which requires O ( log 2 p ) complexity if p − 1 has only small prime factors. Such values of p must be avoided in the cryptosystem. Constructive uses for the new algorithm are also described.","PeriodicalId":305424,"journal":{"name":"Democratizing Cryptography","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126279638","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：