Martin E. Hellman
Skip Abstract Section
Abstract
Cyber deterrence, like nuclear deterrence, depends on our adversaries being rational enough to be deterred by our threats but us not by theirs.
- Coppersmith, D. The Data Encryption Standard (DES) and its strength against attacks. IBM Journal of Research and Development 38, 3 (May 1994), 243--250. Google Scholar
Digital Library
- Corrigan-Gibbs, H. Keeping secrets. Stanford Magazine (Nov./Dec. 2014), 58--64; http://tinyurl.com/cyptowar1, expanding to https://alumni.stanford.edu/get/page/magazine/article/?article_id=74801Google Scholar
- Diffie, W. and Hellman, M. Exhaustive cryptanalysis of the NBS data encryption standard. Computer 10, 6 (June 1977), 74--84; http://www-ee.stanford.edu/%7Ehellman/publications/27.pdf Google ScholarDigital Library
- Diffie, W. and Hellman, M. New directions in cryptography. IEEE Transactions on Information Theory IT-22, 6 (Nov. 1976), 644--654; http://www-ee.stanford.edu/%7Ehellman/publications/24.pdf Google ScholarDigital Library
- Ellis, J. The history of non-secret encryption. Cryptologia 23, 3 (1999), 267--273.Google ScholarCross Ref
- Graham, S. Letter to Ralph C. Merkle (Oct. 22, 1975); http://www.merkle.com/1974/RejectionLetter.pdfGoogle Scholar
- Hellman, D. and Hellman M. A New Map for Relationships: Creating True Love at Home & Peace on the Planet. New Map Publishing, Stanford, CA, 2016; http://tinyurl.com/HellmanBook, expanding to http://www-ee.stanford.edu/%7Ehellman/publications/book3.pdfGoogle Scholar
- Hellman, M., Merkle, R., Schroeppel, R., Washington, L., Diffie, W., Pohlig, S., and Schweitzer, P. Results of an Initial Attempt to Cryptanalyze the NBS Data Encryption Standard. Technical Report SEL 76--042 (available from NTIS). Electrical Engineering Department, Stanford University, Stanford, CA, Sept. 9, 1976 (revised Nov. 10, 1976); http://tinyurl.com/nbs-des-analysis, expanding to http://www-ee.stanford.edu/~hellman/resources/1976_sel_des_report.pdfGoogle Scholar
- Hellman, M. Risk analysis of nuclear deterrence. The Bent of Tau Beta Pi 99, 2 (Spring 2008), 14--22; http://tinyurl.com/hellman74, expanding to http://www-ee.stanford.edu/%7Ehellman/publications/74.pdfGoogle Scholar
- Hellman, M. How risky is nuclear optimism? Bulletin of the Atomic Scientists 67, 2 (Mar. 2011), 47--56; http://tinyurl.com/HowRisky, expanding to http://www-ee.stanford.edu/~hellman/publications/75.pdfGoogle ScholarCross Ref
- Lehmer, D. and Powers, R. On factoring large numbers. Bulletin of the American Mathematical Society 37, 10 (1931), 770--776.Google ScholarCross Ref
- Merkle, R. Secure communication over insecure channels. Commun. 21, 4 (Apr. 1978), 294--299. Google ScholarDigital Library
- Merkle, R. A digital signature based on a conventional encryption function. In Advances in Cryptology, CRYPTO 1987, Lecture Notes in Computer Science, Vol. 293 (Santa Barbara, CA, Aug. 16--20). Springer-Verlag, Berlin, Heidelberg, Germany, 1988, 369--378. Google ScholarDigital Library
- Meyer, J. Letter to IEEE (July 7, 1977); https://stacks.stanford.edu/file/druid:wg115cn5068/1977%200707%20Meyer%20letter.pdf and https://purl.stanford.edu/wg115cn5068Google Scholar
- Morrison, M. and Brillhart, J. A method of factoring and the factorization of F7. Mathematics of Computation 29, 129 (Jan. 1975), 183--205.Google Scholar
- Pomerance, C. A tale of two sieves. Notices of the AMS 43, 12 (Dec. 1996), 1473--1485.Google Scholar
- Rivest, R., Shamir, A., and Adleman, L. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21, 2 (Feb. 1978), 120--126. Google ScholarDigital Library
- Sanger, D. U.S. must step up capacity for cyberattacks, chief argues. The New York Times (Mar. 20, 2015), A4.Google Scholar
- Schwartz, J. Memo to Martin Hellman (Oct. 7, 1977); https://stacks.stanford.edu/file/druid:wg115cn5068/1977%201007%20Schwartz2MH.pdfGoogle Scholar
- Shor, P. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing 26, 5 (1997), 1484--1509. Google ScholarDigital Library
- Turing, A. On computable real numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, Series 2 42 (1936), 230--265; https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdfGoogle Scholar
Index Terms
- Cybersecurity, nuclear security, alan turing, and illogical logic
Recommendations
Cybersecurity, Nuclear Security, Alan Turing, and Illogical Logic
CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications SecurityMy work that is being recognized by the 2015 ACM A. M. Turing Award is in cybersecurity, while my primary interest for the last thirty-five years is concerned with reducing the risk that nuclear deterrence will fail and destroy civilization. This Turing ...
Cybersecurity, Nuclear Security, Alan Turing, and Illogical Logic
ACM Turing award lecturesMy work that is being recognized by the 2015 ACM A. M. Turing Award is in cybersecurity, while my primary interest for the last thirty-five years is concerned with reducing the risk that nuclear deterrence will fail and destroy civilization. This Turing ...
Security beyond cybersecurity: side-channel attacks against non-cyber systems and their countermeasures
AbstractSide-channels are unintended pathways within target systems that leak internal information, exploitable via side-channel attack techniques that extract the target information, compromising the system’s security and privacy. Side-channel attacks ...
Comments