Martin Hellman | Academic Influence

Why Is Martin Hellman Influential?

According to Wikipedia, Martin Edward Hellman is an American cryptologist, best known for his involvement with 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.

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 Papers

New directions in cryptography (1976) (14382)
The Gaussian wire-tap channel (1978) (1789)
An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) (1978) (1079)
Hiding information and signatures in trapdoor knapsacks (1978) (800)
A cryptanalytic time-memory trade-off (1980) (678)
On secret sharing systems (1983) (644)
Privacy and authentication: An introduction to cryptography (1979) (491)
Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard (1977) (445)
Probability of error, equivocation, and the Chernoff bound (1970) (331)
Bistable Behavior of ALOHA-Type Systems (1975) (260)
Multiuser cryptographic techniques (1976) (254)
On the security of multiple encryption (1981) (236)
Differential-Linear Cryptanalysis (1994) (232)
The Mathematics of Public-Key Cryptography (1979) (212)
The Nearest Neighbor Classification Rule with a Reject Option (1970) (180)
An overview of public key cryptography (2002) (166)
Responses to NIST's proposal (1992) (163)
An extension of the Shannon theory approach to cryptography (1977) (119)
Learning with Finite Memory (1970) (111)
The two-armed-bandit problem with time-invariant finite memory (1970) (89)
A note on Wyner's wiretap channel (Corresp.) (1977) (61)
Fast Computation of Discrete Logarithms in GF(q) (1982) (47)
Concerning a bound on undetected error probability (Corresp.) (1976) (47)
I. `DES will be totally insecure within ten years¿ (1979) (37)
On Memory Saved by Randomization (1971) (35)
Convolutional source encoding (1975) (33)
Concerning a Bound on Undetected Error Probability (1970) (32)
Time-memory-processor trade-offs (1988) (31)
Chosen-Key Attacks on a Block Cipher (1987) (28)
The effects of randomization on finite-memory decision schemes (1972) (25)
On tree coding with a fidelity criterion (1975) (25)
Optimal Finite Memory Learning Algorithms for the Finite Sample Problem (1976) (19)
Hypothesis testing with finite memory in finite time (Corresp.) (1972) (12)
Finite-memory hypothesis testing-Comments on a critique (Corresp.) (1970) (12)
On Using Natural Redundancy for Error Detection (1974) (11)
Finite-memory algorithms for estimating the mean of a Gaussian distribution (Corresp.) (1974) (11)
The Effect of Neighboring Conductors on the Currents and Fields in Plane Parallel Transmission Lines (1969) (10)
INFORMATION SYSTEMS LABORATORY (1976) (8)
Drainage and the DES (1982) (8)
How risky is nuclear optimism? (2011) (7)
An introduction to cryptography (1979) (6)
Time-memory-processor tradeoffs (1983) (6)
Security in communication networks (1899) (6)
Convolutional encoding for Wyner's wiretap channel (Corresp.) (1979) (5)
Another Cryptanalytic Attack on 'A Cryptosystem for Multiple Communication' (1981) (5)
An overview of public key cryptography (1978) (5)
Commercial encryption (1987) (5)
On the necessity of cryptanalytic exhaustive search (1983) (3)
Cybersecurity, nuclear security, alan turing, and illogical logic (2017) (3)
On the Necessity of Exhaustive Search for System-Invariant Cryptanalysis (1981) (3)
The largest super-increasing subset of a random set (1983) (3)
Cybersecurity, Nuclear Security, Alan Turing, and Illogical Logic (2016) (2)
Oral history interview with Martin Hellman (2004) (2)
Computer Encryption: Key Size (1977) (2)
A confidence model for finite-memory learning systems (Corresp.) (1972) (2)
Error Detection in the Presence of Synchronization Loss (1975) (2)
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)
Cryptographic Key Size Issues (1982) (1)
Beyond war: implications for computer security and encryption (1984) (1)
On the Difficulty of Computing Logarithms Over GF (q^m) (1980) (1)
Technical correspondence: On multiple encryption security. author's response (1981) (1)
Differential-Linear Crypt analysis (1994) (1)
STS 152: Nuclear Weapons, Risk and Hope (2010) (0)
Optimal Data Compression Algorithms. (1978) (0)
Cryptographic Protection Of Information In Communication Networks (1977) (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)
Method and apparatus for decrypting encrypted messages (1978) (0)
The Coefficient Matrix Reduces by (3.5) To (1972) (0)
The Wisdom of Foolishness: Taking on Nuclear Deterrence (2013) (0)
Computational Complexity, Efficiency and Accountability in Large Scale Teleprocessing Systems (1979) (0)
The effects of randomization on finite memory decision schemes (1970) (0)
Computer Encryption: Key Size (1977) (0)
Low complexity finite memory decision rules (1973) (0)
Computer Encryption: Key Size (1977) (0)
Multiuser cryptographic techniques (1976) (0)
Low Cost Data Compression (1976) (0)
The Wisdom of Foolishness (2016) (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 AcademicInfluence.com Rankings

Computer Science