Martin E. Hellman

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	1994
c8		Susan K. Langford, Martin E. Hellman: Differential-Linear Cryptanalysis. CRYPTO 1994: 17-25
	1992
j11		Ronald L. Rivest, Martin E. Hellman, John C. Anderson, John W. Lyons: Responses to NIST's Proposal. Commun. ACM 35(7): 41-54 (1992)
	1988
j10		Hamid R. Amirazizi, Martin E. Hellman: Time-memory-processor trade-offs. IEEE Transactions on Information Theory 34(3): 505-512 (1988)
	1983
j9		Ehud D. Karnin, J. W. Greene, Martin E. Hellman: On secret sharing systems. IEEE Transactions on Information Theory 29(1): 35-41 (1983)
j8		Ehud D. Karnin, Martin E. Hellman: The largest super-increasing subset of a random set. IEEE Transactions on Information Theory 29(1): 146-148 (1983)
	1982
c7		Martin E. Hellman: Cryptographic Key Size Issues. COMPCON 1982: 130-132
c6		Martin E. Hellman, Justin M. Reyneri: Fast Computation of Discrete Logarithms in GF(q). CRYPTO 1982: 3-13
c5		Martin E. Hellman, Justin M. Reyneri: Drainage and the DES. CRYPTO 1982: 129-131
	1981
j7		Ralph C. Merkle, Martin E. Hellman: On the Security of Multiple Encryption. Commun. ACM 24(7): 465-467 (1981)
j6		Martin E. Hellman: Another Cryptanalytic Attack on `A Cryptosystem for Multiple Communication'. Inf. Process. Lett. 12(4): 182-183 (1981)
c4		Martin E. Hellman, Ehud D. Karnin, Justin M. Reyneri: On the Necessity of Exhaustive Search for System-Invariant Cryptanalysis. CRYPTO 1981: 2-6
c3		Hamid R. Amirazizi, Martin E. Hellman: Time-Memory-Processor Tradeoffs. CRYPTO 1981: 7-9
	1980
j5		Martin E. Hellman: A cryptanalytic time-memory trade-off. IEEE Transactions on Information Theory 26(4): 401-406 (1980)
c2		Martin E. Hellman: On the Difficulty of Computing Logarithms Over GF(q_m). IEEE Symposium on Security and Privacy 1980: 83
	1976
j4		Thomas M. Cover, Michael A. Freedman, Martin E. Hellman: Optimal Finite Memory Learning Algorithms for the Finite Sample Problem. Information and Control 30(1): 49-85 (1976)
j3		S. Leung-Yan-Cheong, Martin E. Hellman: Concerning a bound on undetected error probability (Corresp.). IEEE Transactions on Information Theory 22(2): 235-237 (1976)
j2		Whitfield Diffie, Martin E. Hellman: New directions in cryptography. IEEE Transactions on Information Theory 22(6): 644-654 (1976)
c1		Whitfield Diffie, Martin E. Hellman: Multiuser cryptographic techniques. AFIPS National Computer Conference 1976: 109-112
	1970
j1		Martin E. Hellman: The Nearest Neighbor Classification Rule with a Reject Option. IEEE Trans. Systems Science and Cybernetics 6(3): 179-185 (1970)

Coauthor Index

1	Hamid R. Amirazizi	[j10] [c3]
2	John C. Anderson	[j11]
3	Thomas M. Cover	[j4]
4	Whitfield Diffie	[j2] [c1]
5	Michael A. Freedman	[j4]
6	J. W. Greene	[j9]
7	Ehud D. Karnin	[j9] [j8] [c4]
8	Susan K. Langford	[c8]
9	S. Leung-Yan-Cheong	[j3]
10	John W. Lyons	[j11]
11	Ralph C. Merkle	[j7]
12	Justin M. Reyneri	[c6] [c5] [c4]
13	Ronald L. Rivest	[j11]

Colors in the list of coauthors

Last update Sat May 25 10:11:41 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page