The two-armed-bandit problem with time-invariant finite memory. - Thomas M. Cover; Martin E. Hellman (IEEE Trans. Inf. Theory, 1970)

Finite-memory hypothesis testing-Comments on a critique (Corresp.). - Thomas M. Cover; Martin E. Hellman (IEEE Trans. Inf. Theory, 1970)

Probability of error, equivocation, and the Chernoff bound. - Martin E. Hellman; Josef Raviv (IEEE Trans. Inf. Theory, 1970)

The Nearest Neighbor Classification Rule with a Reject Option. - Martin E. Hellman (IEEE Trans. Syst. Sci. Cybern., 1970)

Hypothesis testing with finite memory in finite time (Corresp.). - Richard A. Flower; Martin E. Hellman (IEEE Trans. Inf. Theory, 1972)

The effects of randomization on finite-memory decision schemes. - Martin E. Hellman (IEEE Trans. Inf. Theory, 1972)

A confidence model for finite-memory learning systems (Corresp.). - John A. Horos; Martin E. Hellman (IEEE Trans. Inf. Theory, 1972)

On Using Natural Redundancy for Error Detection. - Martin E. Hellman (IEEE Trans. Commun., 1974)

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

Bistable Behavior of ALOHA-Type Systems. - Aydano B. Carleial; Martin E. Hellman (IEEE Trans. Commun., 1975)

Error Detection in the Presence of Synchronization Loss. - Martin E. Hellman (IEEE Trans. Commun., 1975)

On tree coding with a fidelity criterion. - Charles R. Davis; Martin E. Hellman (IEEE Trans. Inf. Theory, 1975)

Convolutional source encoding. - Martin E. Hellman (IEEE Trans. Inf. Theory, 1975)

Multiuser cryptographic techniques. - Whitfield Diffie; Martin E. Hellman (AFIPS National Computer Conference, 1976)

New directions in cryptography. - Whitfield Diffie; Martin E. Hellman (IEEE Trans. Inf. Theory, 1976)

Concerning a bound on undetected error probability (Corresp.). - Sik K. Leung-Yan-Cheong; Martin E. Hellman (IEEE Trans. Inf. Theory, 1976)

Optimal Finite Memory Learning Algorithms for the Finite Sample Problem - Thomas M. Cover; Michael A. Freedman; Martin E. Hellman (Inf. Control., 1976)

Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard. - Whitfield Diffie; Martin E. Hellman (Computer, 1977)

A note on Wyner's wiretap channel (Corresp.). - Aydano B. Carleial; Martin E. Hellman (IEEE Trans. Inf. Theory, 1977)

An extension of the Shannon theory approach to cryptography. - Martin E. Hellman (IEEE Trans. Inf. Theory, 1977)

Security in communication networks. - Martin E. Hellman (AFIPS National Computer Conference, 1978)

The Gaussian wire-tap channel. - Sik K. Leung-Yan-Cheong; Martin E. Hellman (IEEE Trans. Inf. Theory, 1978)

Hiding information and signatures in trapdoor knapsacks. - Ralph C. Merkle; Martin E. Hellman (IEEE Trans. Inf. Theory, 1978)

An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.). - Stephen C. Pohlig; Martin E. Hellman (IEEE Trans. Inf. Theory, 1978)

Convolutional encoding for Wyner's wiretap channel (Corresp.). - Erik I. Verriest; Martin E. Hellman (IEEE Trans. Inf. Theory, 1979)

On the Difficulty of Computing Logarithms Over GF(qm). - Martin E. Hellman (S&P, 1980)

A cryptanalytic time-memory trade-off. - Martin E. Hellman (IEEE Trans. Inf. Theory, 1980)

On the Necessity of Exhaustive Search for System-Invariant Cryptanalysis. - Martin E. Hellman; Ehud D. Karnin; Justin M. Reyneri (CRYPTO, 1981)

On the Security of Multiple Encryption. - Ralph C. Merkle; Martin E. Hellman (Commun. ACM, 1981)

Another Cryptanalytic Attack on 'A Cryptosystem for Multiple Communication'. - Martin E. Hellman (Inf. Process. Lett., 1981)

Cryptographic Key Size Issues. - Martin E. Hellman (COMPCON, 1982)

Fast Computation of Discrete Logarithms in GF(q). - Martin E. Hellman; Justin M. Reyneri (CRYPTO, 1982)

Drainage and the DES. - Martin E. Hellman; Justin M. Reyneri (CRYPTO, 1982)

Time-memory-processor tradeoffs. - Hamid R. Amirazizi; Martin E. Hellman (SIGACT News, 1983)

On the necessity of cryptanalytic exhaustive search. - Martin E. Hellman; Ehud D. Karnin; Justin M. Reyneri (SIGACT News, 1983)

On secret sharing systems. - Ehud D. Karnin; J. W. Greene; Martin E. Hellman (IEEE Trans. Inf. Theory, 1983)

The largest super-increasing subset of a random set. - Ehud D. Karnin; Martin E. Hellman (IEEE Trans. Inf. Theory, 1983)

Chosen-Key Attacks on a Block Cipher. - Robert S. Winternitz; Martin E. Hellman (Cryptologia, 1987)

Commercial encryption. - Martin E. Hellman (IEEE Netw., 1987)

Time-memory-processor trade-offs. - Hamid R. Amirazizi; Martin E. Hellman (IEEE Trans. Inf. Theory, 1988)

Responses to NIST's Proposal. - Ronald L. Rivest; Martin E. Hellman; John C. Anderson; John W. Lyons (Commun. ACM, 1992)

Differential-Linear Cryptanalysis. - Susan K. Langford; Martin E. Hellman (CRYPTO, 1994)

An overview of public key cryptography. - Martin E. Hellman (IEEE Commun. Mag., 2002)

Cybersecurity, nuclear security, alan turing, and illogical logic. - Martin E. Hellman (Commun. ACM, 2017)

New Directions in Cryptography. - Whitfield Diffie; Martin E. Hellman (Democratizing Cryptography, 2022)

Exhaustive Cryptanalysis of the NBS Data Encryption Standard. - Whitfield Diffie; Martin E. Hellman (Democratizing Cryptography, 2022)

Privacy and Authentication: An Introduction to Cryptography. - Whitfield Diffie; Martin E. Hellman (Democratizing Cryptography, 2022)

An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance. - Stephen C. Pohlig; Martin E. Hellman (Democratizing Cryptography, 2022)