Democratizing Cryptography/ The Work of Whiteld Diffie and Martin Hellman/ Rebecca Slayton.

Format:

Book

Author/Creator:

Slayton, Rebecca, editor.

Series:

ACM books - Collection 2 ; #42.

ACM books, 2374-6777 ; #42

Language:

English

Subjects (All):

Democratizing Cryptography (Computer Science).

Genre:

Electronic books.

Physical Description:

1 online resource (xx, 538pages) LuaTEX

Edition:

First Edition

Place of Publication:

[New York, NY, USA] : Association for Computing Machinery; [2022].

System Details:

Mode of access: World Wide Web

System requirements: Adobe Acrobat Reader

Contents:

Acknowledgments

Text and Photo Credits

1 Introduction: The Early Lives and Lasting Legacies of Whitfield Diffie and Martin Hellman

Rebecca Slayton

1.1 Introduction

1.2 Early Life and Socialization

1.3 Different Paths to Cryptography

1.4 Finding an Intellectual Soul Mate

1.5 New Directions in Cryptography

1.6 Changing the World: The Chapters Ahead

References

2 Public Key Cryptography's Impact on Society: How Diffie and Hellman Changed the World

Paul C. van Oorschot

2.1 Introduction

2.2 Security Background

2.3 Context: Motivation and Environment

2.4 Inventive Contributions

2.5 Supporting and Related Developments

2.6 Major Impacts on Society

2.7 Concluding Remarks

Acknowledgments

3 Public Key Cryptography in Computer and Network Security

Paul Kocher

3.1 Symmetric Encryption and the Challenge of Scaling Communications Security

3.2 Key Management Before Public Key Cryptography

3.3 Public Key Cryptography

3.4 Digital Signatures and Certificates

3.5 Securing Internet Communications

3.6 Security Protocols

3.7 Beyond Communication

3.8 Securing Supply Chains

3.9 Protecting Software. . . and Protecting from Software

3.10 Protecting Stored Data

3.11 Securing Implementations

3.12 The Need for Aligned Interests and Transparency

3.13 The Potential Impact of Quantum Computing

3.14 The Future

4 The Influence of Public-Key Cryptography on Mathematics

Johannes Buchmann, Michael J. Jacobson, Jr., and Hugh C. Williams

4.1 Introduction

4.2 Primes

4.3 Factoring Integers

4.4 Discrete Logarithms

4.5 Elliptic Curves

4.6 Algebraic Number Fields

4.7 The Quantum Computer

4.8 Quantum-resistant Methods

4.9 Conclusion

5 A Gift that Keeps on Giving: The Impact of Public-Key Cryptography on Theoretical Computer Science

Joan Feigenbaum

5.1 Introduction

5.2 New Concepts in TCS

5.3 New Characterizations of Complexity Classes

5.4 Conclusion

6 Creating an Open Community of Cryptographers

Hilarie Orman

6.1 Introduction

6.2 Initialization

6.3 Shifting in Parallel

6.4 Expanding in New Directions with New People

6.5 Compression

6.6 Expansion

6.7 Permutation and Translation

6.8 Output

6.9 Timeline of Early Events in the Discovery of Public-key Cryptography

7 The Development of a Crypto Policy Community: Diffie-Hellman's Impact on Public Policy

Susan Landau

7.1 The Prologue

7.2 These, Our Actors

7.3 Action from an Unexpected Front: The Pentagon Papers and the White House "Plumbers"

7.4 You Can't Publish That-and Other Forms of Control

7.5 A Shift to Controlling Federal Encryption Standards

7.6 Controlling the Sale of Cryptography

7.7 The Second Crypto War

7.8 The Lasting Public Policy Legacy of Diffie and Hellman's Work

8 An Interview with Whitfield Diffie

9 An Interview with Martin Hellman

10 Information Security

11 Cybersecurity, Nuclear Security, Alan Turing, and Illogical Logic

12 New Directions in Cryptography

Whitfield Diffie and Martin E. Hellman

Abstract

12.1 Introduction

12.2 Conventional Cryptography

12.3 Public Key Cryptography

12.4 One Way Authentication

12.5 Problem Interrelations and Trap Doors

12.6 Computational Complexity

12.7 Historical Perspective

13 Exhaustive Cryptanalysis of the NBS Data Encryption Standard

13.1 Introduction

13.2 The Basic Argument

13.3 Objections to the Basic Argument

13.4 System Architecture

13.5 Chip Design

13.7 Variable Key-size Techniques

13.8 Discussion

Acknowledgment

14 An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance

Stephen C. Pohlig and Martin E. Hellman

14.1 Introduction

14.2 Use in Cryptography

14.3 An Algorithm for p = 2n + 1

14.4 An Algorithm for Arbitrary Primes

14.5 Discussion

15 Privacy and Authentication: An Introduction to Cryptography

15.1 Introduction

15.2 Cryptographic Fundamentals

15.3 Examples of Systems and Solutions

15.4 Cryptographic Taxonomy

15.5 Cryptography in Practice

15.6 Applications of Cryptography

15.7 Selected Bibliography

References

Contributors

Editor and Author Biographies

Index

Other Format:

Print version:

ISBN:

3549993

9781450398282

9781450398268

Access Restriction:

Restricted for use by site license.