{"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}
{"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}
{"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}
{"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}