1994 |
15 | EE | Susan K. Langford,
Martin E. Hellman:
Differential-Linear Cryptanalysis.
CRYPTO 1994: 17-25 |
1992 |
14 | | 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 |
13 | | Hamid R. Amirazizi,
Martin E. Hellman:
Time-memory-processor trade-offs.
IEEE Transactions on Information Theory 34(3): 505-512 (1988) |
1983 |
12 | | Ehud D. Karnin,
Martin E. Hellman:
The largest super-increasing subset of a random set.
IEEE Transactions on Information Theory 29(1): 146- (1983) |
11 | | Ehud D. Karnin,
J. W. Greene,
Martin E. Hellman:
On secret sharing systems.
IEEE Transactions on Information Theory 29(1): 35-41 (1983) |
1982 |
10 | | Martin E. Hellman:
Cryptographic Key Size Issues.
COMPCON 1982: 130-132 |
9 | | Martin E. Hellman,
Justin M. Reyneri:
Drainage and the DES.
CRYPTO 1982: 129-131 |
8 | | Martin E. Hellman,
Justin M. Reyneri:
Fast Computation of Discrete Logarithms in GF(q).
CRYPTO 1982: 3-13 |
1981 |
7 | | Martin E. Hellman,
Ehud D. Karnin,
Justin M. Reyneri:
On the Necessity of Exhaustive Search for System-Invariant Cryptanalysis.
CRYPTO 1981: 2-6 |
6 | | Hamid R. Amirazizi,
Martin E. Hellman:
Time-Memory-Processor Tradeoffs.
CRYPTO 1981: 7-9 |
5 | | Ralph C. Merkle,
Martin E. Hellman:
On the Security of Multiple Encryption.
Commun. ACM 24(7): 465-467 (1981) |
4 | | Martin E. Hellman:
Another Cryptanalytic Attack on `A Cryptosystem for Multiple Communication'.
Inf. Process. Lett. 12(4): 182-183 (1981) |
1980 |
3 | | Martin E. Hellman:
On the Difficulty of Computing Logarithms Over GF(qm).
IEEE Symposium on Security and Privacy 1980: 83 |
1976 |
2 | EE | Whitfield Diffie,
Martin E. Hellman:
Multiuser cryptographic techniques.
AFIPS National Computer Conference 1976: 109-112 |
1 | | 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) |