Foley Regulating Contested Reality
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
NSA's Efforts to Secure Private-Sector Telecommunications Infrastructure
Under the Radar: NSA’s Efforts to Secure Private-Sector Telecommunications Infrastructure Susan Landau* INTRODUCTION When Google discovered that intruders were accessing certain Gmail ac- counts and stealing intellectual property,1 the company turned to the National Security Agency (NSA) for help in securing its systems. For a company that had faced accusations of violating user privacy, to ask for help from the agency that had been wiretapping Americans without warrants appeared decidedly odd, and Google came under a great deal of criticism. Google had approached a number of federal agencies for help on its problem; press reports focused on the company’s approach to the NSA. Google’s was the sensible approach. Not only was NSA the sole government agency with the necessary expertise to aid the company after its systems had been exploited, it was also the right agency to be doing so. That seems especially ironic in light of the recent revelations by Edward Snowden over the extent of NSA surveillance, including, apparently, Google inter-data-center communications.2 The NSA has always had two functions: the well-known one of signals intelligence, known in the trade as SIGINT, and the lesser known one of communications security or COMSEC. The former became the subject of novels, histories of the agency, and legend. The latter has garnered much less attention. One example of the myriad one could pick is David Kahn’s seminal book on cryptography, The Codebreakers: The Comprehensive History of Secret Communication from Ancient Times to the Internet.3 It devotes fifty pages to NSA and SIGINT and only ten pages to NSA and COMSEC. -
Cryptography
Cryptography From Wikipedia, the free encyclopedia Jump to: navigation, search "Secret code" redirects here. For the Aya Kamiki album, see Secret Code. German Lorenz cipher machine, used in World War II to encrypt very-high-level general staff messages Cryptography (or cryptology; from Greek κρυπτός, kryptos, "hidden, secret"; and γράφ, gráph, "writing", or -λογία, -logia, respectively)[1] is the practice and study of hiding information. Modern cryptography intersects the disciplines of mathematics, computer science, and engineering. Applications of cryptography include ATM cards, computer passwords, and electronic commerce. Cryptology prior to the modern age was almost synonymous with encryption, the conversion of information from a readable state to nonsense. The sender retained the ability to decrypt the information and therefore avoid unwanted persons being able to read it. Since WWI and the advent of the computer, the methods used to carry out cryptology have become increasingly complex and its application more widespread. Alongside the advancement in cryptology-related technology, the practice has raised a number of legal issues, some of which remain unresolved. Contents [hide] • 1 Terminology • 2 History of cryptography and cryptanalysis o 2.1 Classic cryptography o 2.2 The computer era • 3 Modern cryptography o 3.1 Symmetric-key cryptography o 3.2 Public-key cryptography o 3.3 Cryptanalysis o 3.4 Cryptographic primitives o 3.5 Cryptosystems • 4 Legal issues o 4.1 Prohibitions o 4.2 Export controls o 4.3 NSA involvement o 4.4 Digital rights management • 5 See also • 6 References • 7 Further reading • 8 External links [edit] Terminology Until modern times cryptography referred almost exclusively to encryption, which is the process of converting ordinary information (plaintext) into unintelligible gibberish (i.e., ciphertext).[2] Decryption is the reverse, in other words, moving from the unintelligible ciphertext back to plaintext. -
An Archeology of Cryptography: Rewriting Plaintext, Encryption, and Ciphertext
An Archeology of Cryptography: Rewriting Plaintext, Encryption, and Ciphertext By Isaac Quinn DuPont A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Faculty of Information University of Toronto © Copyright by Isaac Quinn DuPont 2017 ii An Archeology of Cryptography: Rewriting Plaintext, Encryption, and Ciphertext Isaac Quinn DuPont Doctor of Philosophy Faculty of Information University of Toronto 2017 Abstract Tis dissertation is an archeological study of cryptography. It questions the validity of thinking about cryptography in familiar, instrumentalist terms, and instead reveals the ways that cryptography can been understood as writing, media, and computation. In this dissertation, I ofer a critique of the prevailing views of cryptography by tracing a number of long overlooked themes in its history, including the development of artifcial languages, machine translation, media, code, notation, silence, and order. Using an archeological method, I detail historical conditions of possibility and the technical a priori of cryptography. Te conditions of possibility are explored in three parts, where I rhetorically rewrite the conventional terms of art, namely, plaintext, encryption, and ciphertext. I argue that plaintext has historically been understood as kind of inscription or form of writing, and has been associated with the development of artifcial languages, and used to analyze and investigate the natural world. I argue that the technical a priori of plaintext, encryption, and ciphertext is constitutive of the syntactic iii and semantic properties detailed in Nelson Goodman’s theory of notation, as described in his Languages of Art. I argue that encryption (and its reverse, decryption) are deterministic modes of transcription, which have historically been thought of as the medium between plaintext and ciphertext. -
Diffie and Hellman Receive 2015 Turing Award Rod Searcey/Stanford University
Diffie and Hellman Receive 2015 Turing Award Rod Searcey/Stanford University. Linda A. Cicero/Stanford News Service. Whitfield Diffie Martin E. Hellman ernment–private sector relations, and attracts billions of Whitfield Diffie, former chief security officer of Sun Mi- dollars in research and development,” said ACM President crosystems, and Martin E. Hellman, professor emeritus Alexander L. Wolf. “In 1976, Diffie and Hellman imagined of electrical engineering at Stanford University, have been a future where people would regularly communicate awarded the 2015 A. M. Turing Award of the Association through electronic networks and be vulnerable to having for Computing Machinery for their critical contributions their communications stolen or altered. Now, after nearly to modern cryptography. forty years, we see that their forecasts were remarkably Citation prescient.” The ability for two parties to use encryption to commu- “Public-key cryptography is fundamental for our indus- nicate privately over an otherwise insecure channel is try,” said Andrei Broder, Google Distinguished Scientist. fundamental for billions of people around the world. On “The ability to protect private data rests on protocols for a daily basis, individuals establish secure online connec- confirming an owner’s identity and for ensuring the integ- tions with banks, e-commerce sites, email servers, and the rity and confidentiality of communications. These widely cloud. Diffie and Hellman’s groundbreaking 1976 paper, used protocols were made possible through the ideas and “New Directions in Cryptography,” introduced the ideas of methods pioneered by Diffie and Hellman.” public-key cryptography and digital signatures, which are Cryptography is a practice that facilitates communi- the foundation for most regularly used security protocols cation between two parties so that the communication on the Internet today. -
The Export of Cryptography in the 20 Century and the 21
The Export of Cryptography th st in the 20 Century and the 21 ∗ Whitfield Diffie and Susan Landau Sun Microsystems, Inc Palo Alto CA April 19, 2005 August 2000 On the 14th of January 2000, the Bureau of Export Administration issued long-awaited revisions to the rules on exporting cryptographic hardware and software. The new regulations, which grew out of a protracted tug of war between the computer industry and the U.S. Government, are seen by indus- try as a victory. Their appearance, which was attended by both excitement and relief, marked a substantial change in export policy. This paper exam- ines the evolution of export control in the cryptographic area and considers its impact on the deployment of privacy-protecting technologies within the United States. Before the electronic age, all \real-time" interaction between people had to take place in person. Privacy in such interactions could be taken for granted. No more than reasonable care was required to assure yourself that only the people you were addressing | people who had to be right there with you | could hear you. Telecommunications have changed this. The people with whom you interact no longer have to be in your immediate vicinity; they can be on the other side of the world, making what was once impossible spontaneous and inexpensive. Telecommunication, on the other hand, makes protecting yourself from eavesdropping more difficult. Some other security mechanism is required to replace looking around to see that ∗To appear in the Handbook of the History of Information Security Elsevier B.V. 1 no one is close enough to overhear: that mechanism is cryptography, the only security mechanism that directly protects information passing out of the physical control of the sender and receiver. -
The Mathematics of the RSA Public-Key Cryptosystem Burt Kaliski RSA Laboratories
The Mathematics of the RSA Public-Key Cryptosystem Burt Kaliski RSA Laboratories ABOUT THE AUTHOR: Dr Burt Kaliski is a computer scientist whose involvement with the security industry has been through the company that Ronald Rivest, Adi Shamir and Leonard Adleman started in 1982 to commercialize the RSA encryption algorithm that they had invented. At the time, Kaliski had just started his undergraduate degree at MIT. Professor Rivest was the advisor of his bachelor’s, master’s and doctoral theses, all of which were about cryptography. When Kaliski finished his graduate work, Rivest asked him to consider joining the company, then called RSA Data Security. In 1989, he became employed as the company’s first full-time scientist. He is currently chief scientist at RSA Laboratories and vice president of research for RSA Security. Introduction Number theory may be one of the “purest” branches of mathematics, but it has turned out to be one of the most useful when it comes to computer security. For instance, number theory helps to protect sensitive data such as credit card numbers when you shop online. This is the result of some remarkable mathematics research from the 1970s that is now being applied worldwide. Sensitive data exchanged between a user and a Web site needs to be encrypted to prevent it from being disclosed to or modified by unauthorized parties. The encryption must be done in such a way that decryption is only possible with knowledge of a secret decryption key. The decryption key should only be known by authorized parties. In traditional cryptography, such as was available prior to the 1970s, the encryption and decryption operations are performed with the same key. -
Cryptography Export Controls - Canada's Dichotomous Cryptography Policy
Canadian Journal of Law and Technology Volume 4 Number 3 Article 5 8-1-2005 Cryptography Export Controls - Canada's Dichotomous Cryptography Policy Paul Bates Follow this and additional works at: https://digitalcommons.schulichlaw.dal.ca/cjlt Part of the Computer Law Commons, Intellectual Property Law Commons, Internet Law Commons, Privacy Law Commons, and the Science and Technology Law Commons Recommended Citation Paul Bates, "Cryptography Export Controls - Canada's Dichotomous Cryptography Policy" (2005) 4:3 CJLT. This Article is brought to you for free and open access by the Journals at Schulich Law Scholars. It has been accepted for inclusion in Canadian Journal of Law and Technology by an authorized editor of Schulich Law Scholars. For more information, please contact [email protected]. CRYPTOGRAPHY EXPORT CONTROLS — CANADA’S DICHOTOMOUS CRYPTOGRAPHY POLICY Paul Bates† Introduction 1 of the Canadian Charter of Rights and Freedoms (Charter). 6 The effort to erect strong legal barriers to ryptography makes electronic transactions more trans-national distribution of cryptography has signifi- C secure and reliable. Recognizing the importance of cant gaps because strong cryptography can be obtained cryptography to e-commerce, the Canadian government and used within Canada without legal restrictions. This adopted a digital cryptography policy in 1998. The paper advocates that Canada should exercise its discre- policy provides for ‘‘digital freedom’’ for domestic cryp- tion under the WA to diminish, not fortify, the restric- tography by permitting Canadians to develop, import, tions of the export control regime. and use for lawful purposes, any cryptographic products, without restrictions based upon the strength of the cryp- tography, the source of supply, the identity of the recip- ient, or the nature of the use. -
Lecture 1: Course Introduction
Lecture 1: Course Introduction Thomas Johansson T. Johansson (Lund University) 1 / 17 Course intro - Cryptography Welcome to Cryptography (EDIN01)! Everything in English! Course information The course web page: http://www.eit.lth.se Prerequisites: Math and programming skills! T. Johansson (Lund University) 2 / 17 Other crypto/security courses Dept. of EIT, Crypto and Security group (Continuation course for PhD students: Mathematical Cryptology (EDIN05), 7,5hp) Security courses: Computer Security (EIT060), 7,5hp Web Security (EITF05), 4hp Advanced Computer Security (EITN50) 7,5hp Advanced Web Security (EITN41), 7,5hp NEW COURSE: Secure Systems Engineering, 7.5hp (vt1 2020) Project in EIT (EITN35), 7,5hp Master’s thesis: see the department website: http://www.eit.lth.se T. Johansson (Lund University) 3 / 17 Introduction to Cryptography Much of the theoretical work in cryptography concerns cryptographic primitives, algorithms with basic cryptographic properties. A cryptographic protocol involve back and forth communication among two or more parties. Symmetric-key cryptography – methods in which both the sender and receiver share the same key (block ciphers, stream ciphers, MAC algorithms). Cryptographic hash functions are a related and important class of cryptographic algorithms. Public-key cryptography – two different but mathematically related keys are used a public key and a private key. T. Johansson (Lund University) 4 / 17 History of cryptography Before the modern era, cryptography was concerned solely with message confidentiality (i.e., encryption) Encryption was used to (attempt) to ensure secrecy for spies, military, and diplomats. The field has expanded to include techniques for message integrity checking, sender/receiver identity authentication, digital signatures, interactive proofs and secure computation, .. -
The Greatest Pioneers in Computer Science
The Greatest Pioneers in Computer Science Ivan Srba, Veronika Gondová 19th October 2017 5th Heidelberg Laureate Forum 2 Laureates of mathematics and computer science meet the next generation September 24–29, 2017, Heidelberg https://www.heidelberg-laureate-forum.org 3 Awards in Computer Science 4 Awards in Computer Science 5 • ACM A.M. Turing Award • “Nobel Prize of Computing” • Awarded to “an individual selected for contributions of a technical nature made to the computing community” • Accompanied by a prize of $1 million Awards in Computer Science 6 • ACM A.M. Turing Award • “Nobel Prize of Computing” • Awarded to “an individual selected for contributions of a technical nature made to the computing community” • Accompanied by a prize of $1 million • ACM Prize in Computing • Awarded to “an early to mid-career fundamental innovative contribution in computing” • Accompanied by a prize of $250,000 Some of Laureates We Met at 5th HLF 7 PeWe Postcard 8 Leslie Lamport 9 ACM A.M. Turing Award (2013) Source: https://www.heidelberg-laureate-forum.org/blog/laureate/leslie-lamport/ Leslie Lamport 10 ACM A.M. Turing Award (2013) “for fundamental contributions to the theory and practice of distributed and concurrent systems, notably the invention of concepts such as causality and logical clocks, safety and liveness, replicated state machines, and sequential consistency.” • Developed Lamport Clocks for distributed systems • The paper “Time, Clocks, and the Ordering of Events in a Distributed System” from 1978 has become one of the most cited works in computer science • Developed LaTeX • Invented the first digital signature algorithm • Currently work in Microsoft Research Source: https://www.heidelberg-laureate-forum.org/blog/laureate/leslie-lamport/ Balmer’s Peak 11 • The theory that computer programmers obtain quasi-magical, superhuman coding ability • when they have a blood alcohol concentration percentage between 0.129% and 0.138%. -
Arxiv:2106.11534V1 [Cs.DL] 22 Jun 2021 2 Nanjing University of Science and Technology, Nanjing, China 3 University of Southampton, Southampton, U.K
Noname manuscript No. (will be inserted by the editor) Turing Award elites revisited: patterns of productivity, collaboration, authorship and impact Yinyu Jin1 · Sha Yuan1∗ · Zhou Shao2, 4 · Wendy Hall3 · Jie Tang4 Received: date / Accepted: date Abstract The Turing Award is recognized as the most influential and presti- gious award in the field of computer science(CS). With the rise of the science of science (SciSci), a large amount of bibliographic data has been analyzed in an attempt to understand the hidden mechanism of scientific evolution. These include the analysis of the Nobel Prize, including physics, chemistry, medicine, etc. In this article, we extract and analyze the data of 72 Turing Award lau- reates from the complete bibliographic data, fill the gap in the lack of Turing Award analysis, and discover the development characteristics of computer sci- ence as an independent discipline. First, we show most Turing Award laureates have long-term and high-quality educational backgrounds, and more than 61% of them have a degree in mathematics, which indicates that mathematics has played a significant role in the development of computer science. Secondly, the data shows that not all scholars have high productivity and high h-index; that is, the number of publications and h-index is not the leading indicator for evaluating the Turing Award. Third, the average age of awardees has increased from 40 to around 70 in recent years. This may be because new breakthroughs take longer, and some new technologies need time to prove their influence. Besides, we have also found that in the past ten years, international collabo- ration has experienced explosive growth, showing a new paradigm in the form of collaboration. -
IJM), ISSN 0976 – 6502(Print), ISSN 0976 - 6510(Online), Volumeinternational 4, Issue 6, November - December JOURNAL (2013) of MANAGEMENT (IJM)
International Journal of Management (IJM), ISSN 0976 – 6502(Print), ISSN 0976 - 6510(Online), VolumeINTERNATIONAL 4, Issue 6, November - December JOURNAL (2013) OF MANAGEMENT (IJM) ISSN 0976-6502 (Print) ISSN 0976-6510 (Online) IJM Volume 4, Issue 6, November - December (2013), pp. 209-212 © IAEME: www.iaeme.com/ijm.asp © I A E M E Journal Impact Factor (2013): 6.9071 (Calculated by GISI) www.jifactor.com DISTINGUISH FROM SYMMETRIC AND ASYMMETRIC CRYPTO SYSTEMS. CITE THE STRENGTHS AND SHORTCOMINGS OF THE EACH SYSTEM V. Sridevi 1, V. Sumathi 2 and M. Guru Prasad 3 1Department of Biotechnology, Sri Venkateswara University, Tirupati, A.P 2Department of Biotechnology, Sri Padmavati Mahila Visvavidyalayam, Tirupati, A.P. 3Department of Biochemistry, Bharatiyar University, Coimbatore, Chennai. ABSTRACT In a symmetric cipher, both parties must use the same key for encryption and decryption. This means that the encryption key must be shared between the two parties before any messages can be decrypted. Symmetric systems are also known as shared secret systems or private key systems. Symmetric ciphers are significantly faster than asymmetric ciphers, but the requirements for key exchange make them difficult to use. In an asymmetric cipher, the encryption key and the decryption keys are separate. In an asymmetric system, each person has two keys. One key, the public key, is shared publicly. The second key, the private key, should never be shared with anyone.When you send a message using asymmetric cryptography, you encrypt the message using the recipients public key. The recipient then decrypts the message using his private key. That is why the system is called asymmetric. -
Oral History Interview with Martin Hellman
An Interview with MARTIN HELLMAN OH 375 Conducted by Jeffrey R. Yost on 22 November 2004 Palo Alto, California Charles Babbage Institute Center for the History of Information Technology University of Minnesota, Minneapolis Copyright 2004, Charles Babbage Institute Martin Hellman Interview 22 November 2004 Oral History 375 Abstract Leading cryptography scholar Martin Hellman begins by discussing his developing interest in cryptography, factors underlying his decision to do academic research in this area, and the circumstances and fundamental insights of his invention of public key cryptography with collaborators Whitfield Diffie and Ralph Merkle at Stanford University in the mid-1970s. He also relates his subsequent work in cryptography with Steve Pohlig (the Pohlig-Hellman system) and others. Hellman addresses his involvement with and the broader context of the debate about the federal government’s cryptography policy—regarding to the National Security Agency’s (NSA) early efforts to contain and discourage academic work in the field, the Department of Commerce’s encryption export restrictions (under the International Traffic of Arms Regulation, or ITAR), and key escrow (the so-called Clipper chip). He also touches on the commercialization of cryptography with RSA Data Security and VeriSign, as well as indicates some important individuals in academe and industry who have not received proper credit for their accomplishments in the field of cryptography. 1 TAPE 1 (Side A) Yost: My name is Jeffrey Yost. I am from the Charles Babbage Institute and am here today with Martin Hellman in his home in Stanford, California. It’s November 22nd 2004. Yost: Martin could you begin by giving a brief biographical background of yourself—of where you were born and where you grew up? Hellman: I was born October 2nd 1945 in New York City.