DOCSLIB.ORG

2018 Inductees

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
2018 Inductees 2018 Inductees Marvin Caruthers...................................................................................2 Stan Honey ............................................................................................3 Sumita Mitra ..........................................................................................4 Arogyaswami Paulraj .............................................................................5 Jacqueline Quinn ..................................................................................6 Ronald Rivest .........................................................................................7 Adi Shamir .............................................................................................8 Leonard Adleman ..................................................................................9 Ching Wan Tang ..................................................................................10 Steven Van Slyke ................................................................................. 11 Warren S. Johnson .............................................................................. 12 Howard S. Jones Jr. ............................................................................. 13 Mary Engle Pennington ....................................................................... 14 Joseph C. Shivers Jr. ........................................................................... 15 Paul Terasaki ........................................................................................ 16 10 Things You Need to Know About Marvin Caruthers Inventor of Chemical Synthesis of DNA 2018 NATIONAL INVENTORS U.S. PATENT NOS. 4,415,732 & 4,458,066 HALL OF FAME INDUCTEE Marvin Caruthers 1. Caruthers’ invention is widely considered to be one of the BORN FEBRUARY 11, 1940 cornerstone technologies behind the biotechnology revolution. 2. Since 1973, he has been a distinguished professor of chemistry and Marvin Caruthers helped jump-start biochemistry at the University of Colorado-Boulder. the biotechnology industry. With his team at the University of Colorado- 3. Notable results from his work include the development and Boulder, Caruthers developed the commercialization of pharmaceutical drugs Epogen and Neupogen. methods for chemically synthesizing DNA —transforming protein and DNA 4. He was the co-founder of several successful biotech companies synthesis from highly specialized basic including Amgen, Applied Biosystems, Array BioPharma and miRagen research into a widely used research, Therapeutics. diagnostic and forensic tool. 5. He considers himself to be equally a researcher, inventor and The ability to synthesize DNA — rapidly entrepreneur. and in the laboratory — enables researchers to learn how certain 6. In 2007, Caruthers donated $20 million to the University of Colorado- genetic sequences are formed, and to Boulder to construct a new biotechnology center on campus. The locate and isolate genes for selected proteins. Early clinical studies on drugs center is named for his late wife, Jennie Smoly Caruthers. stemming from Caruthers’ techniques 7. He says his “comfortable but intense” childhood working on a farm showed remarkable benefits for patients with severe kidney disease shaped his work ethic. and cancer. 8. He believes the biotechnology revolution would not have been His procedures have been incorporated possible without intellectual property protection. into “gene machines” automating synthetic DNA production used by 9. He was awarded the 2006 U.S. National Medal of Science. biochemists, biologists, molecular biologists and biophysical chemists. 10. He holds 43 U.S. patents. More recently, his procedures have been adapted for use with modified To learn more about the 2018 Class of Inductees, visit www.invent.org/honor/inductees/. inkjet printers to synthesize DNA on glass chips. Caruthers’ innovation will be celebrated this May as he is Inducted into the 2018 Class of the National Inventors Hall of Fame. © 2018 National Inventors Hall of Fame, Inc. 10 Things You Need to Know About Stan Honey Inventor of Football’s Yellow ‘First-and-Ten Line’ 2018 NATIONAL INVENTORS U.S. PATENT NO. 6,141,060 HALL OF FAME INDUCTEE Stan Honey 1. Stan Honey is a native of San Marino, Calif. BORN APRIL 8, 1955 2. Honey earned his B.S. in engineering and applied science at Yale University, and his MSEE at Stanford University. A pioneer in the field of sports television graphics, Stan Honey has transformed 3. His television technology inventions combine two lifelong interests: how we all watch sports. Innovations electronics and navigation. developed by Honey and his team at Sportvision include the Virtual Yellow 1st 4. He has received numerous awards, including three Emmys for technical & Ten ® line, introduced on Sept. 27, 1998, and engineering innovations in sports television broadcasts. during an ESPN-televised game between the Baltimore Ravens and the Cincinnati 5. He co-founded Etak Inc., a company that pioneered automobile Bengals. Now ubiquitous in football, navigation systems and digital mapping. the superimposed yellow line has been hailed as one of the most important 6. He co-founded Sportvision in 1998. developments in sports broadcast history. 7. Honey is a 2017 inductee of the Sports Broadcasting Hall of Fame. Other televised sports advances led by Honey include K-Zone™, a baseball 8. He was the sailing and navigation coach for the 2008 movie “Morning pitch tracking and highlighting system; Light.” RACEf/x®, which tracks NASCAR racers using GPS; and LiveLine™, a helicopter- 9. His approach to engineering is “figure it out.” mounted, GPS-tracked camera system first implemented during the 2013 10. He holds 31 U.S. patents in television graphics and in navigation America’s Cup in conjunction with GPS technology and tracking. tracking on the race boats and marks. A professional yachtsman and To learn more about the 2018 Class of Inductees, visit www.invent.org/honor/inductees/. navigator, Honey was the 2010 Yachtsman of the Year, and is a 2012 inductee of the National Sailing Hall of Fame. As navigator, Honey has set records for transatlantic, transpacific, circumnavigation, and 24-hour passages under sail. Honey’s innovation will be celebrated this May as he is Inducted into the 2018 Class of the National Inventors Hall of Fame. © 2018 National Inventors Hall of Fame, Inc. 10 Things You Need to Know About Sumita Mitra Inventor of Nanocomposite Dental Materials 2018 NATIONAL INVENTORS U.S. PATENT NOS. 6,387,981, 6,572,693 & 6,730,156 HALL OF FAME INDUCTEE Sumita Mitra 1. She retired after more than 30 years with 3M, and now runs Mitra BORN FEBRUARY 27, 1949 Chemical Consulting LLC with her husband. 2. Mitra earned her B.S. in chemistry from India’s Presidency College, her Sumita Mitra’s dental innovations M.S. in organic chemistry from India’s University of Calcutta, and her capture the importance of strength Ph.D. in organic/polymer chemistry from the University of Michigan. and the elegance of beauty, allowing her to solve ongoing issues plaguing 3. Mitra was born in India, going to school in Kolkata until she moved to both dental patients and professionals. the United States. By revolutionizing the field of dentistry with her invention of the 4. She was corporate scientist of the new materials/products research first nanocomposite dental materials, and development efforts at 3M’s Dental Products Division from 1998- she made the development and 2010. commercialization of many dental products possible. 5. Mitra is a former science coach for the American Chemical Society, Mitra’s invention of Filtek™ Supreme where she volunteered to share her chemistry knowledge in Minnesota Universal Restorative improved communities. upon previous dental composites by providing superior optical properties 6. Mitra also served as the industrial director of the Minnesota Dental both initially and long-term, while Research Center for Biomaterials and Biomechanics at the University of exhibiting excellent mechanical Minnesota’s School of Dentistry. strength and wear resistance. The Filtek™ Supreme product line has 7. She is the winner of many honors and awards, including the been used in more than 600 million International Association for Dental Research Peyton-Skinner Award dental restorations worldwide since the for Innovation in Dental Materials (2012); American Chemical Society product launched in 2002. (ACS) Hero of Chemistry (2009); and the ACS Regional Industrial Innovation Award (2004). Mitra’s innovation will be celebrated this May as she is Inducted into the 8. She is an experienced lecturer, giving more than 100 presentations 2018 Class of the National Inventors and teaching courses at various universities in 45 countries. Hall of Fame. 9. Mitra has more than 90 publications in the areas of polymer science and dental materials. 10. She holds 98 U.S. patents and their international equivalents. To learn more about the 2018 Class of Inductees, visit www.invent.org/honor/inductees/. © 2018 National Inventors Hall of Fame, Inc. 10 Things You Need to Know About Arogyaswami Paulraj Inventor of MIMO Wireless Technology 2018 NATIONAL INVENTORS U.S. PATENT NO. 5,345,599 HALL OF FAME INDUCTEE Arogyaswami Paulraj 1. Paulraj is a native of India. BORN APRIL 14, 1944 2. His MIMO wireless technology is currently used in all 4G and WiFi services. If it wasn’t for Arogyaswami Paulraj, you would be living in a much slower 3. He served for three decades in the Indian Navy. world. Paulraj pioneered MIMO — Multiple Input, Multiple
Load more

Recommended publications
  • 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.
    [Show full text]
  • 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.
    [Show full text]
  • A Memorable Trip Abhisekh Sankaran Research Scholar, IIT Bombay
    A Memorable Trip Abhisekh Sankaran Research Scholar, IIT Bombay It was my first trip to the US. It had not yet sunk in that I had been chosen by ACM India as one of two Ph.D. students from India to attend the big ACM Turing Centenary Celebration in San Francisco until I saw the familiar face of Stephen Cook enter a room in the hotel a short distance from mine; later, Moshe Vardi recognized me from his trip to IITB during FSTTCS, 2011. I recognized Nitin Saurabh from IMSc Chennai, the other student chosen by ACM-India; 11 ACM SIG©s had sponsored students and there were about 75 from all over the world. Registration started at 8am on 15th June, along with breakfast. Collecting my ©Student Scholar© badge and stuffing in some food, I entered a large hall with several hundred seats, a brightly lit podium with a large screen in the middle flanked by two others. The program began with a video giving a brief biography of Alan Turing from his boyhood to the dynamic young man who was to change the world forever. There were inaugural speeches by John White, CEO of ACM, and Vint Cerf, the 2004 Turing Award winner and incoming ACM President. The MC for the event, Paul Saffo, took over and the panel discussions and speeches commenced. A live Twitter feed made it possible for people in the audience and elsewhere to post questions/comments which were actually taken up in the discussions. Of the many sessions that took place in the next two days, I will describe three that I found most interesting.
    [Show full text]
  • Dr. Adi Shamir
    using the encryption key, allowing anyone to verify the signatory as “Electronics, Information and Communication” field the one with the decryption key. Achievement : Contribution to information security through pioneering research on cryptography The invention of the secret sharing scheme which Dr. Adi Shamir (Israel) protects information from disasters Born: July 6, 1952 (Age: 64, Nationality: Israel) Professor, Weizmann Institute of Science Information dispersal is crucial for the secure storage of important data. In 1979, Dr. Shamir was the first to propose the “secret sharing Summary scheme,” which specifies the dispersal method that ensures the security The advent of open digital networks, namely the Internet, has enabled of information depending on the extent of dispersed information us to lead a convenient lifestyle like never before. Such comfort has leakage. This was achieved using the polynomial method. been made possible thanks to security measures preventing the theft and Based on the fact that a straight line is a first degree polynomial, and a parabola manipulation of valuable information. It is Dr. Adi Shamir who proposed is a second degree polynomial, secret information is represented as points on the many of the underlying concepts in information security and developed polynomial. Points other than the secret information are dispersed and stored. By a series of practical solutions. doing so, a first degree polynomial requires two pieces of dispersed information, Information in digital networks is coded in binary digits. Utilizing and that of the second degree requires three pieces of dispersed information to mathematical methodology, Dr. Shamir has invented and proposed recover the secret information.
    [Show full text]
  • Alan Mathison Turing and the Turing Award Winners
    Alan Turing and the Turing Award Winners A Short Journey Through the History of Computer TítuloScience do capítulo Luis Lamb, 22 June 2012 Slides by Luis C. Lamb Alan Mathison Turing A.M. Turing, 1951 Turing by Stephen Kettle, 2007 by Slides by Luis C. Lamb Assumptions • I assume knowlege of Computing as a Science. • I shall not talk about computing before Turing: Leibniz, Babbage, Boole, Gödel... • I shall not detail theorems or algorithms. • I shall apologize for omissions at the end of this presentation. • Comprehensive information about Turing can be found at http://www.mathcomp.leeds.ac.uk/turing2012/ • The full version of this talk is available upon request. Slides by Luis C. Lamb Alan Mathison Turing § Born 23 June 1912: 2 Warrington Crescent, Maida Vale, London W9 Google maps Slides by Luis C. Lamb Alan Mathison Turing: short biography • 1922: Attends Hazlehurst Preparatory School • ’26: Sherborne School Dorset • ’31: King’s College Cambridge, Maths (graduates in ‘34). • ’35: Elected to Fellowship of King’s College Cambridge • ’36: Publishes “On Computable Numbers, with an Application to the Entscheindungsproblem”, Journal of the London Math. Soc. • ’38: PhD Princeton (viva on 21 June) : “Systems of Logic Based on Ordinals”, supervised by Alonzo Church. • Letter to Philipp Hall: “I hope Hitler will not have invaded England before I come back.” • ’39 Joins Bletchley Park: designs the “Bombe”. • ’40: First Bombes are fully operational • ’41: Breaks the German Naval Enigma. • ’42-44: Several contibutions to war effort on codebreaking; secure speech devices; computing. • ’45: Automatic Computing Engine (ACE) Computer. Slides by Luis C.
    [Show full text]
  • Grid Optimization of Large-Area OLED Lighting Panel Electrodes Haoning Tang, Yibin Jiang, Ching Wan Tang, and Hoi-Sing Kwok, Fellow, IEEE
    JOURNAL OF DISPLAY TECHNOLOGY, VOL. 12, NO. 6, JUNE 2016 605 Grid Optimization of Large-Area OLED Lighting Panel Electrodes Haoning Tang, Yibin Jiang, Ching Wan Tang, and Hoi-Sing Kwok, Fellow, IEEE Abstract—Luminance loss resulting from potential drop on the transparent indium tin oxide (ITO) electrode due to its relatively high resistivity is one of the most essential issues in the design of large-area organic light-emitting diode (OLED) lighting panels. One solution is to pattern metal grid with low sheet resistance on the ITO electrode. However, the shape, height, and width of the metal grid element have a great influence on the final luminance uniformity of the device. In this paper, a method is proposed to op- timize these parameters in order to get the best luminance unifor- mity for large-area OLED lighting panels. The method takes two grid geometry parameters—height and width—into account and predicts the highest relative luminance by finite element method simulations under different operating voltages. Fig. 1. (a) OLED lighting panel made of Al cathode and ITO transparent anode with metallic grid applied. (b) Top view of metal grid for square and hexagonal Index Terms—Electrode, large-area, luminance uniformity, shape: apothem h and width w are the same for both hexagonal and square shape. metal grid, OLED lighting. have a better enhancement on uniformity [8]. It has been demon- I. INTRODUCTION strated that a Poisson equation model can provide a calculation LED LIGHTING panel has the advantages of high effi- on the potential distribution on the electrode [6], [9].
    [Show full text]
  • Contents 1 a Brief Introduction to Cryptography
    RSA Catherine Easton July 2007 VIGRE REU at the University of Chicago, Apprentice Program Abstract This paper examines the mathematics of the RSA code through a simple example. Contents 1 A Brief Introduction to Cryptography 1 2 RSA 2 2.1 Keys needed in RSA . 2 2.2 RSA Encryption . 2 2.3 RSA decryption . 4 1 A Brief Introduction to Cryptography In the classical explanation of cryptography, Alice wishes to write a message to Bob, but Eve continues to intercept her messages. Alice and Bob decide to encrypt their messages. Alice and Bob can meet in person and exchange a key. With this informa- tion, they can both encrypt and decrypt messages to each other. Even if Eve manages to intercept a message, she will not be able to gain any information from it, seeing as it is encoded and she does not know the key necessary for decryption. This scenario uses private-key cryptography. Now, however, let us assume that it is impossible for Alice and Bob to meet, and that they are therefore unable to exchange the key. Obviously, Alice cannot send Bob the key, seeing as their messages are being intercepted by Eve, who would then know the key as well. To overcome this barrier, Alice and Bob must use public-key cryptography. Bob selects both an encryption function and a cor- responding decryption function. He sends only the encryption function to Alice. 1 She then uses the encryption function to encrypt her message. Once her message is encrypted, Alice herself is unable to decrypt it.
    [Show full text]
  • Looking for Computers in the Biological Cell. After Twenty Years⋆
    Looking for Computers in the Biological Cell. After Twenty Years? Gheorghe P˘aun Institute of Mathematics of the Romanian Academy PO Box 1-764, 014700 Bucure¸sti,Romania [email protected] 1 Preliminary Cautious and Explanations The previous title needs some explanations which I would like to bring from the very beginning. On the one hand, it promises too much, at least with respect to my scientific preoccupations in the last two decades and with respect to the discussion which follows. It is true that there are attempts to use the cell as it is (bacteria, for instance) or parts of it (especially DNA molecules) to compute, but a research direction which looks more realistic, at least for a while, and which has interested me, is to look in the cell for ideas useful to computer science, for computability models which, passing from biological structures and processes to mathematical models, of a computational type, can not only ensure a better use of the existing computers, the electronic ones, but they can also return to the starting point, as tools for biological investigations. Looking to the cell through the mathematician-computer scientist glasses, this is the short description of the present approach, and in this area it is placed the personal research experience which the present text is based on. On the other hand, the title announces already the autobiographical intention. Because a Reception Speech is a synthesis moment, if not also a career summarizing moment, it cannot be less autobiographical than it is, one uses to say, any novel or poetry volume.
    [Show full text]
  • DNA Computing
    DNA Computing Uladzislau Maiseichykau Michael Newell Overview ● Introduction to DNA computing ● History ● Differences between DNA and traditional computing ● Potential ● Limitations ● Constructing a DNA computing experiment ● Early DNA computing ● Modern DNA computing ● Future of DNA computing What is DNA Computing? DNA computing uses DNA, chemistry, and molecular hardware instead of traditional silicon-based circuits to run calculations and computations Interest in DNA computing stems from the possibility of processing larger sets of data in a smaller space than silicon computers, and the fast-approaching physical limits to Moore’s Law History ● Initially developed by Leonard Adleman from University of Southern California in 1994 ● Used DNA to solve the Traveling Salesman problem ● In 1997, researchers from University of Rochester used DNA to create logic gates ● Researchers from Weizmann Institute of Science unveiled a programmable computing machine that used enzymes and DNA in 2002 ● 2013, the first biological transistor, the transcriptor, was created Comparison to Standard Computing “DNA computers are unlikely to become stand-alone competitors for electronic computers.” Smallest most efficient computers, modifies cells Build items vs. raw mathematics Potential ● Ultra small devices ● Self assembly (nano) - ex: Sierpinski triangle ● Exotic and new molecular structures ● Nano-Gold + DNA = 10 smaller details on chips Limitations ● Human involvement to set up each experiment/calculation ● Response times can be as slow as minutes, hours,
    [Show full text]
  • Chemistry 2015-2016 Newsletter
    CHEMISTRY 2015-2016 NEWSLETTER Table of Contents CONTACT ADDRESS University of Rochester 3 Chemistry Department Faculty and Staff Department of Chemistry 404 Hutchison Hall 4 Letter from the Chair RC Box 270216 Rochester, NY 14627-0216 6 Donors to the Chemistry Department PHONE 10 In Memoriam (585) 275-4231 14 Alumni News EMAIL Saunders 90th Birthday [email protected] 16 Faculty Grants & Awards WEBSITE 18 www.sas.rochester.edu/chm 24 COR-ROC Inorganic Symposium FACEBOOK 25 CBI Retreat & Mat Sci Symposium www.facebook.com/UofRChemistry 26 Departmental Summer Picnic CREDITS 27 REU Program 2016 EDITOR 28 International Student Research Program Lynda McGarry 29 Pie in the Eye 30 Graduate Student Welcome Party LAYOUT & DESIGN EDITOR Deb Contestabile 31 Chemistry Welcomes Kathryn Knowles Yukako Ito (’17) 32 Faculty News REVIEWING EDITORS 64 Senior Poster Session Deb Contestabile 65 Commencement 2016 COVER ART AND LOGOS 67 Student Awards & News Deb Contestabile Yukako Ito (’17) 73 Doctoral Degrees Awarded 75 Postdoctoral Fellows PHOTOGRAPHS 76 Faculty Publications UR Communications John Bertola (B.A. ’09, M.S. ’10W) 82 Seminars & Colloquia Deb Contestabile Ria Tafani 89 Staff News Sheridan Vincent Thomas Krugh 93 Instrumentation UR Friday Photos Yukako Ito (’17) 95 Department Funds Ursula Bertram (‘18) Lynda McGarry 96 Alumni Update Form 1 2 PROFESSORS OF CHEMISTRY Faculty and Staff Robert K. Boeckman, Jr. Kara L. Bren Joseph P. Dinnocenzo ASSISTANT CHAIR FOR ADMINISTRATION James M. Farrar Kenneth Simolo Rudi Fasan Ignacio Franco ADMINISTRATIVE ASSISTANT TO THE CHAIR Alison J. Frontier Barbara Snaith Joshua L. Goodman Pengfei Huo ADMINISTRATIVE ASSISTANTS William D. Jones Deb Contestabile Kathryn Knowles Robin Cooley Todd D.
    [Show full text]
  • Public Key Cryptography
    EECS 70 Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 6 This note is partly based on Section 1.4 of “Algorithms," by S. Dasgupta, C. Papadimitriou and U. Vazirani, McGraw-Hill, 2007. An online draft of the book is available at http://www.cs.berkeley.edu/ vazirani/algorithms.html Public Key Cryptography In this note, we discuss a very nice and important application of modular arithmetic: the RSA public-key cryptosystem, named after its inventors Ronald Rivest, Adi Shamir and Leonard Adleman. Cryptography is an ancient subject that really blossomed into its modern form at the same time1 as the other great revolutions in the general fields of information science/engineering. The basic setting for basic cryptography is typically described via a cast of three characters: Alice and Bob, who with to communicate confidentially over some (insecure) link, and Eve, an eavesdropper who is listening in and trying to discover what they are saying. Let’s assume that Alice wants to transmit a message x (written in binary) to Bob. She will apply her encryp- tion function E to x and send the encrypted message E(x) (also called the cyphertext) over the link; Bob, upon receipt of E(x), will then apply his decryption function D to it and thus recover the original message (also called the plaintext): i.e., D(E(x)) = x. Since the link is insecure, Alice and Bob have to assume that Eve may get hold of E(x). (Think of Eve as being a “sniffer" on the network.) Thus ideally we would like to know that the encryption function E is chosen so that just knowing E(x) (without knowing the decryption function D) doesn’t allow one to discover anything about the original message x.
    [Show full text]
  • Directorate for Mathematical and Physical REPORT NO' *Artificial
    DOCUMENT RESUME ED 259 943 SE 045 918 TITLE Division of Computer Research Summary of Awards, Fiscal Year 1984. INSTITUTION National Science Foundation, Washington, DC. Directorate for Mathematical and Physical Sciences. REPORT NO' NSF-84-77 PUB DATE 84 NOTE 93p. PUB TYPE Reports - Descriptive (141) EDRS PRICE MF01/PC04 Pigs Postage. DESCRIPTORS *Artificial Intelligence; *Computer Oriented Programs; *Computers; *Computer Science; Databases; *Grants; Higher Education; Mathematics; Program Descriptions IDENTIFIERS National Science Foundation ABSTRACT Provided in this report are summaries of grants awarded by the National Science Foundation Division of Computer Research in fiscal year 1984. Similar areas of research are grouped (for the purposes of this report only) into these major categories: (1) computational mathematics; (2) computer systems design; (3) intelligent systems;(4) software engineering; (5) software systems science; (6) special projects, such as database management, computer-based modeling, and privacy and security of computer systems; (7) theoretical computer science; (8) computer research equipment; and (9) coordinated experimental research. Also included are presidential young investigator awards and awards for small business innovation research. Within each category, awards are listed alphabetically by state and institution. Each entry includes the grantee institution, name of the principal investigator(s), project title, award identification number, award amount, award duration, and desCription. (This report lists fewer
    [Show full text]