Martin Hellman

Q: What Schools Are Affiliated With Martin Hellman

Martin Hellman is affiliated with the following schools: New York University Tandon School of Engineering, Massachusetts Institute of Technology, Stanford University, New York University

Martin Hellman's AcademicInfluence.com Rankings

Martin Hellman

Computer Science

#100

World Rank

#106

Historical Rank

#60

USA Rank

computer-science Degrees

Martin Hellman

Mathematics

#733

World Rank

#1334

Historical Rank

#320

USA Rank

Measure Theory

#537

World Rank

#752

Historical Rank

#221

USA Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Martin Hellman's Degrees

PhD Electrical Engineering Stanford University
Masters Electrical Engineering Stanford University
Bachelors Electrical Engineering New York University

Why Is Martin Hellman Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Martin Edward Hellman is an American cryptologist and mathematician, best known for his invention of public key cryptography in cooperation with Whitfield Diffie and Ralph Merkle. Hellman is a longtime contributor to the computer privacy debate, and has applied risk analysis to a potential failure of nuclear deterrence.

(See a Problem?)

Martin Hellman's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

New Directions in Cryptography (1976) (15076)
The Gaussian wire-tap channel (1978) (1857)
An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance (2022) (1331)
Hiding information and signatures in trapdoor knapsacks (1978) (822)
A cryptanalytic time-memory trade-off (1980) (736)
On secret sharing systems (1983) (646)
Privacy and authentication: An introduction to cryptography (1979) (498)
Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard (1977) (459)
Probability of error, equivocation, and the Chernoff bound (1970) (341)
The Mathematics of Public-Key Cryptography (1979) (295)
Multiuser cryptographic techniques (1976) (262)
Bistable Behavior of ALOHA-Type Systems (1975) (261)
Differential-Linear Cryptanalysis (1994) (247)
On the security of multiple encryption (1981) (245)
The Nearest Neighbor Classification Rule with a Reject Option (1970) (205)
Responses to NIST's proposal (1992) (185)
An overview of public key cryptography (1978) (185)
An extension of the Shannon theory approach to cryptography (1977) (122)
Learning with Finite Memory (1970) (104)
The two-armed-bandit problem with time-invariant finite memory (1970) (92)
The dentition of Dryopithecus and the origin of man. Anthropological papers of the AMNH ; v. 28, pt. 1 (79)
A note on Wyner's wiretap channel (Corresp.) (1977) (62)
Fast Computation of Discrete Logarithms in GF(q) (1982) (49)
Concerning a bound on undetected error probability (Corresp.) (1976) (47)
I. `DES will be totally insecure within ten years¿ (1979) (40)
On Memory Saved by Randomization (1971) (38)
Concerning a Bound on Undetected Error Probability (1970) (34)
Ossification of epiphysial cartilages in the hand (34)
Convolutional source encoding (1975) (33)
Chosen-Key Attacks on a Block Cipher (1987) (31)
Time-memory-processor trade-offs (1988) (31)
The effects of randomization on finite-memory decision schemes (1972) (25)
On tree coding with a fidelity criterion (1975) (24)
Optimal Finite Memory Learning Algorithms for the Finite Sample Problem (1976) (20)
On three incomplete anthropoid jaws from the Siwaliks, India. American Museum novitates ; no. 130 (13)
Hypothesis testing with finite memory in finite time (Corresp.) (1972) (12)
Finite-memory hypothesis testing-Comments on a critique (Corresp.) (1970) (12)
Finite-memory algorithms for estimating the mean of a Gaussian distribution (Corresp.) (1974) (12)
On Using Natural Redundancy for Error Detection (1974) (11)
The Effect of Neighboring Conductors on the Currents and Fields in Plane Parallel Transmission Lines (1969) (10)
INFORMATION SYSTEMS LABORATORY (1976) (9)
Fossil Anthropoids of the Yale-Cambridge India Expedition of 1935 (2018) (9)
Drainage and the DES (1982) (8)
Convolutional encoding for Wyner's wiretap channel (Corresp.) (1979) (7)
How risky is nuclear optimism? (2011) (7)
Time-memory-processor tradeoffs (1983) (7)
An introduction to cryptography (1984) (6)
An overview of public key cryptography (1978) (6)
Another Cryptanalytic Attack on 'A Cryptosystem for Multiple Communication' (1981) (5)
Commercial encryption (1987) (5)
Factors Influencing Occlusion (2009) (5)
The largest super-increasing subset of a random set (1983) (4)
Further notes on the molars of Hesperopithecus and of Pithecanthropus. Bulletin of the AMNH ; v. 48, article 13. (3)
On the necessity of cryptanalytic exhaustive search (1983) (3)
Oral history interview with Martin Hellman (2004) (3)
On the Necessity of Exhaustive Search for System-Invariant Cryptanalysis (1981) (3)
The future of orthodontia; a present-day problem for the orthodontist. (1947) (3)
Diagnosis in Orthodontia and the Method of Technique I Use in Practice (2009) (3)
Error Detection in the Presence of Synchronization Loss (1975) (2)
Cybersecurity, nuclear security, alan turing, and illogical logic (2017) (2)
A confidence model for finite-memory learning systems (Corresp.) (1972) (2)
Computer Encryption: Key Size (1977) (2)
Cybersecurity, Nuclear Security, Alan Turing, and Illogical Logic (2016) (2)
Technical correspondence: On multiple encryption security. author's response (1981) (1)
Differential-Linear Crypt analysis (1994) (1)
Beyond war: implications for computer security and encryption (1984) (1)
Cryptographic Key Size Issues (1982) (1)
Notes on the type of Hesperopithecus haroldcookii Osborn. American Museum novitates ; no. 53 (1)
On the Difficulty of Computing Logarithms Over GF (q^m) (1980) (1)
Risk Analysis of Nuclear Deterrence by Dr. Martin E. Hellman, New York Epsilon ’66 he first fundamental canon of The Code of Ethics for Engineers adopted by Tau Beta Pi (2008) (1)
A Tribute to David Kahn (2009) (1)
New Directions in Cryptography (1976) (2021) (1)
Presentation of Illuminated Address (2009) (0)
Computational Complexity, Efficiency and Accountability in Large Scale Teleprocessing Systems (1979) (0)
Orthodontia a specialty in esthetics or correction? (1947) (0)
Cryptographic Protection Of Information In Communication Networks (1977) (0)
Dental Insurance--a must. (1970) (0)
Low Cost Data Compression (1976) (0)
Publications of the University of Pennsylvania Bicentennial Conference MEDICAL SCIENCES CAUSE AND GROWTH OF CANCER (2005) (0)
The Coefficient Matrix Reduces by (3.5) To (1972) (0)
Low complexity finite memory decision rules (1973) (0)
Associate Editors-R. L. Pickholtz, Computer; A. Lender, Data; J. W. Smith, Electronics; W. T. Barnett, Radio; K. Kelley, Space; L. A. Weber, (1975) (0)
Optimal Data Compression Algorithms. (1978) (0)
Method and apparatus for decrypting encrypted messages (1978) (0)
The Wisdom of Foolishness (2016) (0)
The Wisdom of Foolishness: Taking on Nuclear Deterrence (2013) (0)
STS 152: Nuclear Weapons, Risk and Hope (2010) (0)
The effects of randomization on finite memory decision schemes (1970) (0)
Some conditions not favorable to orthodontic procedure. (1947) (0)

This paper list is powered by the following services:

Other Resources About Martin Hellman

What Schools Are Affiliated With Martin Hellman?

Martin Hellman is affiliated with the following schools:

Martin Hellman's Academic­Influence.com Rankings

Martin Hellman's Degrees

Why Is Martin Hellman Influential?

Martin Hellman's Published Works

Published Works

Other Resources About Martin Hellman

What Schools Are Affiliated With Martin Hellman?

Image Attributions

Martin Hellman's AcademicInfluence.com Rankings