The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Martin E. Hellman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Martin E. Hellman
    Cryptographic Key Size Issues. [Citation Graph (0, 0)][DBLP]
    COMPCON, 1982, pp:130-132 [Conf]
  2. Hamid R. Amirazizi, Martin E. Hellman
    Time-Memory-Processor Tradeoffs. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1981, pp:7-9 [Conf]
  3. Martin E. Hellman, Ehud D. Karnin, Justin M. Reyneri
    On the Necessity of Exhaustive Search for System-Invariant Cryptanalysis. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1981, pp:2-6 [Conf]
  4. Susan K. Langford, Martin E. Hellman
    Differential-Linear Cryptanalysis. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1994, pp:17-25 [Conf]
  5. Martin E. Hellman, Justin M. Reyneri
    Fast Computation of Discrete Logarithms in GF(q). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1982, pp:3-13 [Conf]
  6. Martin E. Hellman, Justin M. Reyneri
    Drainage and the DES. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1982, pp:129-131 [Conf]
  7. Martin E. Hellman
    On the Difficulty of Computing Logarithms Over GF(qm). [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Security and Privacy, 1980, pp:83- [Conf]
  8. Ralph C. Merkle, Martin E. Hellman
    On the Security of Multiple Encryption. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1981, v:24, n:7, pp:465-467 [Journal]
  9. Ronald L. Rivest, Martin E. Hellman, John C. Anderson, John W. Lyons
    Responses to NIST's Proposal. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1992, v:35, n:7, pp:41-54 [Journal]
  10. Thomas M. Cover, Michael A. Freedman, Martin E. Hellman
    Optimal Finite Memory Learning Algorithms for the Finite Sample Problem [Citation Graph (0, 0)][DBLP]
    Information and Control, 1976, v:30, n:1, pp:49-85 [Journal]
  11. Martin E. Hellman
    Another Cryptanalytic Attack on `A Cryptosystem for Multiple Communication'. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:4, pp:182-183 [Journal]
  12. Hamid R. Amirazizi, Martin E. Hellman
    Time-memory-processor trade-offs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:3, pp:505-512 [Journal]
  13. Ehud D. Karnin, J. W. Greene, Martin E. Hellman
    On secret sharing systems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:1, pp:35-41 [Journal]
  14. Ehud D. Karnin, Martin E. Hellman
    The largest super-increasing subset of a random set. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:1, pp:146-0 [Journal]

  15. Multiuser cryptographic techniques. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002