Martin E. Hellman

According to our database1, Martin E. Hellman authored at least 42 papers between 1970 and 2017.

Collaborative distances:

Awards

Turing Prize recipient

Turing Prize 2015, "For fundamental contributions to modern cryptography. Diffie and Hellman's groundbreaking 1976 paper, "New Directions in Cryptography," introduced the ideas of public-key cryptography and digital signatures, which are the foundation for most regularly-used security protocols on the internet today." awarded to Whitfield Diffie and Martin E. Hellman.

IEEE Fellow

IEEE Fellow 1980, "For contributions to cryptography.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Cybersecurity, nuclear security, alan turing, and illogical logic.
Commun. ACM, 2017

2002
An overview of public key cryptography.
IEEE Commun. Mag., 2002

1994
Differential-Linear Cryptanalysis.
Proceedings of the Advances in Cryptology, 1994

1992
Responses to NIST's Proposal.
Commun. ACM, 1992

1988
Time-memory-processor trade-offs.
IEEE Trans. Inf. Theory, 1988

1987
Chosen-Key Attacks on a Block Cipher.
Cryptologia, 1987

1983
The largest super-increasing subset of a random set.
IEEE Trans. Inf. Theory, 1983

On secret sharing systems.
IEEE Trans. Inf. Theory, 1983

1982
Drainage and the DES.
Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

Fast Computation of Discrete Logarithms in GF(q).
Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

Cryptographic Key Size Issues.
Proceedings of the COMPCON'82, 1982

1981
Another Cryptanalytic Attack on 'A Cryptosystem for Multiple Communication'.
Inf. Process. Lett., 1981

On the Security of Multiple Encryption.
Commun. ACM, 1981

On the Necessity of Exhaustive Search for System-Invariant Cryptanalysis.
Proceedings of the Advances in Cryptology: A Report on CRYPTO 81, 1981

Time-Memory-Processor Tradeoffs.
Proceedings of the Advances in Cryptology: A Report on CRYPTO 81, 1981

1980
A cryptanalytic time-memory trade-off.
IEEE Trans. Inf. Theory, 1980

On the Difficulty of Computing Logarithms Over GF(q<sub>m</sub>).
Proceedings of the 1980 IEEE Symposium on Security and Privacy, 1980

1979
Convolutional encoding for Wyner's wiretap channel (Corresp.).
IEEE Trans. Inf. Theory, 1979

1978
An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.).
IEEE Trans. Inf. Theory, 1978

Hiding information and signatures in trapdoor knapsacks.
IEEE Trans. Inf. Theory, 1978

The Gaussian wire-tap channel.
IEEE Trans. Inf. Theory, 1978

Security in communication networks.
Proceedings of the American Federation of Information Processing Societies: 1978 National Computer Conference, 1978

1977
An extension of the Shannon theory approach to cryptography.
IEEE Trans. Inf. Theory, 1977

A note on Wyner's wiretap channel (Corresp.).
IEEE Trans. Inf. Theory, 1977

Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard.
Computer, 1977

1976
Optimal Finite Memory Learning Algorithms for the Finite Sample Problem
Inf. Control., January, 1976

Concerning a bound on undetected error probability (Corresp.).
IEEE Trans. Inf. Theory, 1976

New directions in cryptography.
IEEE Trans. Inf. Theory, 1976

Multiuser cryptographic techniques.
Proceedings of the American Federation of Information Processing Societies: 1976 National Computer Conference, 1976

1975
Convolutional source encoding.
IEEE Trans. Inf. Theory, 1975

On tree coding with a fidelity criterion.
IEEE Trans. Inf. Theory, 1975

Error Detection in the Presence of Synchronization Loss.
IEEE Trans. Commun., 1975

Bistable Behavior of ALOHA-Type Systems.
IEEE Trans. Commun., 1975

1974
Finite-memory algorithms for estimating the mean of a Gaussian distribution (Corresp.).
IEEE Trans. Inf. Theory, 1974

On Using Natural Redundancy for Error Detection.
IEEE Trans. Commun., 1974

1972
A confidence model for finite-memory learning systems (Corresp.).
IEEE Trans. Inf. Theory, 1972

The effects of randomization on finite-memory decision schemes.
IEEE Trans. Inf. Theory, 1972

Hypothesis testing with finite memory in finite time (Corresp.).
IEEE Trans. Inf. Theory, 1972

1970
The Nearest Neighbor Classification Rule with a Reject Option.
IEEE Trans. Syst. Sci. Cybern., 1970

Probability of error, equivocation, and the Chernoff bound.
IEEE Trans. Inf. Theory, 1970

Finite-memory hypothesis testing-Comments on a critique (Corresp.).
IEEE Trans. Inf. Theory, 1970

The two-armed-bandit problem with time-invariant finite memory.
IEEE Trans. Inf. Theory, 1970


  Loading...