default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin E. Hellman
Person information
- award (2015): Turing Award
- affiliation: Stanford University, USA
- award (2010): IEEE Richard W. Hamming Medal
- award (2000): Marconi Prize
- award (1996): Paris Kanellakis Award
- award (1994): EFF Pioneer Award
- award: National Inventors Hall of Fame
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[p4]Whitfield Diffie, Martin E. Hellman:
New Directions in Cryptography. Democratizing Cryptography 2022: 365-390- [p3]Whitfield Diffie, Martin E. Hellman:
Exhaustive Cryptanalysis of the NBS Data Encryption Standard. Democratizing Cryptography 2022: 391-414 - [p2]Stephen C. Pohlig, Martin E. Hellman:
An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance. Democratizing Cryptography 2022: 415-430 - [p1]Whitfield Diffie, Martin E. Hellman:
Privacy and Authentication: An Introduction to Cryptography. Democratizing Cryptography 2022: 431-514
2010 – 2019
- 2017
- [j36]Martin E. Hellman:
Cybersecurity, nuclear security, alan turing, and illogical logic. Commun. ACM 60(12): 52-59 (2017) - 2016
- [c10]Martin E. Hellman:
Cybersecurity, Nuclear Security, Alan Turing, and Illogical Logic. CCS 2016: 1-2
2000 – 2009
- 2002
- [j35]Martin E. Hellman:
An overview of public key cryptography. IEEE Commun. Mag. 40(5): 42-49 (2002)
1990 – 1999
- 1994
- [c9]Susan K. Langford, Martin E. Hellman:
Differential-Linear Cryptanalysis. CRYPTO 1994: 17-25 - 1992
- [j34]Ronald L. Rivest, Martin E. Hellman, John C. Anderson, John W. Lyons:
Responses to NIST's Proposal. Commun. ACM 35(7): 41-54 (1992)
1980 – 1989
- 1988
- [j33]Hamid R. Amirazizi, Martin E. Hellman:
Time-memory-processor trade-offs. IEEE Trans. Inf. Theory 34(3): 505-512 (1988) - 1987
- [j32]Robert S. Winternitz, Martin E. Hellman:
Chosen-Key Attacks on a Block Cipher. Cryptologia 11(1): 16-20 (1987) - [j31]Martin E. Hellman:
Commercial encryption. IEEE Netw. 1(2): 6-10 (1987) - 1983
- [j30]Hamid R. Amirazizi, Martin E. Hellman:
Time-memory-processor tradeoffs. SIGACT News 15(1): 18-19 (1983) - [j29]Martin E. Hellman, Ehud D. Karnin, Justin M. Reyneri:
On the necessity of cryptanalytic exhaustive search. SIGACT News 15(1): 40-44 (1983) - [j28]Ehud D. Karnin, J. W. Greene, Martin E. Hellman:
On secret sharing systems. IEEE Trans. Inf. Theory 29(1): 35-41 (1983) - [j27]Ehud D. Karnin, Martin E. Hellman:
The largest super-increasing subset of a random set. IEEE Trans. Inf. Theory 29(1): 146-148 (1983) - 1982
- [c8]Martin E. Hellman:
Cryptographic Key Size Issues. COMPCON 1982: 130-132 - [c7]Martin E. Hellman, Justin M. Reyneri:
Fast Computation of Discrete Logarithms in GF(q). CRYPTO 1982: 3-13 - [c6]Martin E. Hellman, Justin M. Reyneri:
Drainage and the DES. CRYPTO 1982: 129-131 - 1981
- [j26]Ralph C. Merkle, Martin E. Hellman:
On the Security of Multiple Encryption. Commun. ACM 24(7): 465-467 (1981) - [j25]Martin E. Hellman:
Another Cryptanalytic Attack on 'A Cryptosystem for Multiple Communication'. Inf. Process. Lett. 12(4): 182-183 (1981) - [c5]Martin E. Hellman, Ehud D. Karnin, Justin M. Reyneri:
On the Necessity of Exhaustive Search for System-Invariant Cryptanalysis. CRYPTO 1981: 2-6 - [c4]Hamid R. Amirazizi, Martin E. Hellman:
Time-Memory-Processor Tradeoffs. CRYPTO 1981: 7-9 - 1980
- [j24]Martin E. Hellman:
A cryptanalytic time-memory trade-off. IEEE Trans. Inf. Theory 26(4): 401-406 (1980) - [c3]Martin E. Hellman:
On the Difficulty of Computing Logarithms Over GF(qm). S&P 1980: 83
1970 – 1979
- 1979
- [j23]Erik I. Verriest, Martin E. Hellman:
Convolutional encoding for Wyner's wiretap channel (Corresp.). IEEE Trans. Inf. Theory 25(2): 234-236 (1979) - 1978
- [j22]Stephen C. Pohlig, Martin E. Hellman:
An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.). IEEE Trans. Inf. Theory 24(1): 106-110 (1978) - [j21]Sik K. Leung-Yan-Cheong, Martin E. Hellman:
The Gaussian wire-tap channel. IEEE Trans. Inf. Theory 24(4): 451-456 (1978) - [j20]Ralph C. Merkle, Martin E. Hellman:
Hiding information and signatures in trapdoor knapsacks. IEEE Trans. Inf. Theory 24(5): 525-530 (1978) - [c2]Martin E. Hellman:
Security in communication networks. AFIPS National Computer Conference 1978: 1131-1136 - 1977
- [j19]Whitfield Diffie, Martin E. Hellman:
Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard. Computer 10(6): 74-84 (1977) - [j18]Martin E. Hellman:
An extension of the Shannon theory approach to cryptography. IEEE Trans. Inf. Theory 23(3): 289-294 (1977) - [j17]Aydano B. Carleial, Martin E. Hellman:
A note on Wyner's wiretap channel (Corresp.). IEEE Trans. Inf. Theory 23(3): 387-390 (1977) - 1976
- [j16]Thomas M. Cover, Michael A. Freedman, Martin E. Hellman:
Optimal Finite Memory Learning Algorithms for the Finite Sample Problem. Inf. Control. 30(1): 49-85 (1976) - [j15]Sik K. Leung-Yan-Cheong, Martin E. Hellman:
Concerning a bound on undetected error probability (Corresp.). IEEE Trans. Inf. Theory 22(2): 235-237 (1976) - [j14]Whitfield Diffie, Martin E. Hellman:
New directions in cryptography. IEEE Trans. Inf. Theory 22(6): 644-654 (1976) - [c1]Whitfield Diffie, Martin E. Hellman:
Multiuser cryptographic techniques. AFIPS National Computer Conference 1976: 109-112 - 1975
- [j13]Aydano B. Carleial, Martin E. Hellman:
Bistable Behavior of ALOHA-Type Systems. IEEE Trans. Commun. 23(4): 401-410 (1975) - [j12]Martin E. Hellman:
Error Detection in the Presence of Synchronization Loss. IEEE Trans. Commun. 23(5): 538-539 (1975) - [j11]Charles R. Davis, Martin E. Hellman:
On tree coding with a fidelity criterion. IEEE Trans. Inf. Theory 21(4): 373-378 (1975) - [j10]Martin E. Hellman:
Convolutional source encoding. IEEE Trans. Inf. Theory 21(6): 651-656 (1975) - 1974
- [j9]Martin E. Hellman:
On Using Natural Redundancy for Error Detection. IEEE Trans. Commun. 22(10): 1690-1693 (1974) - [j8]Martin E. Hellman:
Finite-memory algorithms for estimating the mean of a Gaussian distribution (Corresp.). IEEE Trans. Inf. Theory 20(3): 382-384 (1974) - 1972
- [j7]Richard A. Flower, Martin E. Hellman:
Hypothesis testing with finite memory in finite time (Corresp.). IEEE Trans. Inf. Theory 18(3): 429-431 (1972) - [j6]Martin E. Hellman:
The effects of randomization on finite-memory decision schemes. IEEE Trans. Inf. Theory 18(4): 499-502 (1972) - [j5]John A. Horos, Martin E. Hellman:
A confidence model for finite-memory learning systems (Corresp.). IEEE Trans. Inf. Theory 18(6): 811-813 (1972) - 1970
- [j4]Thomas M. Cover, Martin E. Hellman:
The two-armed-bandit problem with time-invariant finite memory. IEEE Trans. Inf. Theory 16(2): 185-195 (1970) - [j3]Martin E. Hellman, Josef Raviv:
Probability of error, equivocation, and the Chernoff bound. IEEE Trans. Inf. Theory 16(4): 368-372 (1970) - [j2]Thomas M. Cover, Martin E. Hellman:
Finite-memory hypothesis testing-Comments on a critique (Corresp.). IEEE Trans. Inf. Theory 16(4): 496-497 (1970) - [j1]Martin E. Hellman:
The Nearest Neighbor Classification Rule with a Reject Option. IEEE Trans. Syst. Sci. Cybern. 6(3): 179-185 (1970)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
