Martin E. Hellman - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 50 from 50

2022

New Directions in CryptographyWhitfield Diffie, Martin E. Hellman. In Rebecca Slayton, editor, Democratizing Cryptography: The Work of Whitfield Diffie and Martin Hellman. Volume 42 of ACM Books, pages 365-390, ACM, 2022. [doi]

Privacy and Authentication: An Introduction to CryptographyWhitfield Diffie, Martin E. Hellman. In Rebecca Slayton, editor, Democratizing Cryptography: The Work of Whitfield Diffie and Martin Hellman. Volume 42 of ACM Books, pages 431-514, ACM, 2022. [doi]

Exhaustive Cryptanalysis of the NBS Data Encryption StandardWhitfield Diffie, Martin E. Hellman. In Rebecca Slayton, editor, Democratizing Cryptography: The Work of Whitfield Diffie and Martin Hellman. Volume 42 of ACM Books, pages 391-414, ACM, 2022. [doi]

p) and Its Cryptographic SignificanceStephen C. Pohlig, Martin E. Hellman. In Rebecca Slayton, editor, Democratizing Cryptography: The Work of Whitfield Diffie and Martin Hellman. Volume 42 of ACM Books, pages 415-430, ACM, 2022. [doi]

2017

Cybersecurity, nuclear security, alan turing, and illogical logicMartin E. Hellman. CACM, 60(12):52-59, 2017. [doi]

2016

Cybersecurity, Nuclear Security, Alan Turing, and Illogical LogicMartin E. Hellman. ccs 2016: 1-2 [doi]

2002

An overview of public key cryptographyMartin E. Hellman. cm, 40(5):42-49, 2002. [doi]

1994

Differential-Linear CryptanalysisSusan K. Langford, Martin E. Hellman. crypto 1994: 17-25 [doi]

1992

Responses to NIST s ProposalRonald L. Rivest, Martin E. Hellman, John C. Anderson, John W. Lyons. CACM, 35(7):41-54, 1992.

1988

Time-memory-processor trade-offsHamid R. Amirazizi, Martin E. Hellman. TIT, 34(3):505-512, 1988.

1987

Commercial encryptionMartin E. Hellman. network, 1(2):6-10, 1987. [doi]

Chosen-Key Attacks on a Block CipherRobert S. Winternitz, Martin E. Hellman. cryptologia, 11(1):16-20, 1987. [doi]

1983

Time-memory-processor tradeoffsHamid R. Amirazizi, Martin E. Hellman. sigact, 15(1):18-19, 1983. [doi]

On the necessity of cryptanalytic exhaustive searchMartin E. Hellman, Ehud D. Karnin, Justin M. Reyneri. sigact, 15(1):40-44, 1983. [doi]

On secret sharing systemsEhud D. Karnin, J. W. Greene, Martin E. Hellman. TIT, 29(1):35-41, 1983.

The largest super-increasing subset of a random setEhud D. Karnin, Martin E. Hellman. TIT, 29(1):146, 1983.

1982

Fast Computation of Discrete Logarithms in GF(q)Martin E. Hellman, Justin M. Reyneri. crypto 1982: 3-13

Cryptographic Key Size IssuesMartin E. Hellman. compcon 1982: 130-132

Drainage and the DESMartin E. Hellman, Justin M. Reyneri. crypto 1982: 129-131

1981

Time-Memory-Processor TradeoffsHamid R. Amirazizi, Martin E. Hellman. crypto 1981: 7-9

On the Necessity of Exhaustive Search for System-Invariant CryptanalysisMartin E. Hellman, Ehud D. Karnin, Justin M. Reyneri. crypto 1981: 2-6

Another Cryptanalytic Attack on A Cryptosystem for Multiple Communication Martin E. Hellman. ipl, 12(4):182-183, 1981.

On the Security of Multiple EncryptionRalph C. Merkle, Martin E. Hellman. CACM, 24(7):465-467, 1981.

1980

On the Difficulty of Computing Logarithms Over GF(q::m::)Martin E. Hellman. sp 1980: 83

A cryptanalytic time-memory trade-offMartin E. Hellman. TIT, 26(4):401-406, 1980. [doi]

1979

Convolutional encoding for Wyner's wiretap channel (Corresp.)E. Verriest, Martin E. Hellman. TIT, 25(2):234-236, 1979. [doi]

1978

Security in communication networksMartin E. Hellman. afips 1978: 1131-1136

The Gaussian wire-tap channelSik K. Leung-Yan-Cheong, Martin E. Hellman. TIT, 24(4):451-456, 1978. [doi]

Hiding information and signatures in trapdoor knapsacksRalph C. Merkle, Martin E. Hellman. TIT, 24(5):525-530, 1978. [doi]

An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.)Stephen C. Pohlig, Martin E. Hellman. TIT, 24(1):106-110, 1978. [doi]

1977

A note on Wyner's wiretap channel (Corresp.)Aydano B. Carleial, Martin E. Hellman. TIT, 23(3):387-390, 1977. [doi]

Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption StandardWhitfield Diffie, Martin E. Hellman. Computer, 10(6):74-84, 1977. [doi]

An extension of the Shannon theory approach to cryptographyMartin E. Hellman. TIT, 23(3):289-294, 1977. [doi]

1976

Optimal Finite Memory Learning Algorithms for the Finite Sample ProblemThomas M. Cover, Michael A. Freedman, Martin E. Hellman. iandc, 30(1):49-85, January 1976.

New directions in cryptographyWhitfield Diffie, Martin E. Hellman. TIT, 22(6):644-654, 1976. [doi]

Multiuser cryptographic techniquesWhitfield Diffie, Martin E. Hellman. afips 1976: 109-112 [doi]

Concerning a bound on undetected error probability (Corresp.)Sik K. Leung-Yan-Cheong, Martin E. Hellman. TIT, 22(2):235-237, 1976. [doi]

1975

Bistable Behavior of ALOHA-Type SystemsAydano B. Carleial, Martin E. Hellman. tcom, 23(4):401-410, 1975. [doi]

On tree coding with a fidelity criterionCharles R. Davis, Martin E. Hellman. TIT, 21(4):373-378, 1975. [doi]

Convolutional source encodingMartin E. Hellman. TIT, 21(6):651-656, 1975. [doi]

Error Detection in the Presence of Synchronization LossMartin E. Hellman. tcom, 23(5):538-539, 1975. [doi]

1974

Finite-memory algorithms for estimating the mean of a Gaussian distribution (Corresp.)Martin E. Hellman. TIT, 20(3):382-384, 1974. [doi]

On Using Natural Redundancy for Error DetectionMartin E. Hellman. tcom, 22(10):1690-1693, 1974. [doi]

1972

Hypothesis testing with finite memory in finite time (Corresp.)Richard A. Flower, Martin E. Hellman. TIT, 18(3):429-431, 1972. [doi]

The effects of randomization on finite-memory decision schemesMartin E. Hellman. TIT, 18(4):499-502, 1972. [doi]

A confidence model for finite-memory learning systems (Corresp.)John A. Horos, Martin E. Hellman. TIT, 18(6):811-813, 1972. [doi]

1970

Finite-memory hypothesis testing-Comments on a critique (Corresp.)Thomas M. Cover, Martin E. Hellman. TIT, 16(4):496-497, 1970. [doi]

The two-armed-bandit problem with time-invariant finite memoryThomas M. Cover, Martin E. Hellman. TIT, 16(2):185-195, 1970. [doi]

Probability of error, equivocation, and the Chernoff boundMartin E. Hellman, Josef Raviv. TIT, 16(4):368-372, 1970. [doi]

The Nearest Neighbor Classification Rule with a Reject OptionMartin E. Hellman. tssc, 6(3):179-185, 1970. [doi]

Sign in or sign up to see more results.

runs on WebDSL