Advertisement

Cryptosystems based on an analog of heat flow

  • G. R. Blakley
  • William Rundell
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 293)

Abstract

It is commonplace to base computer security and information security on hard problems. Recent cryptosystems have been based on the knapsack problem [DE83, pp. 118-126; BRS5] and the problem of factoring an integer [DE83, pp. 104-1091. The former problem is N P complete [GA79, p. 2471. The place of the latter problem in complexity theory is not well understood, but it has been around in number theory for a long time.

Keywords

Maximum Principle Heat Equation Linear Case Finite Difference Scheme Finiteness Assumption 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. BL85.
    G. R. Blakley, Information theory without the finiteness assumption, I: Cryptosystems as group-theoretic objects. in G. R. Blakley and D. Chaum (editors), Advances in Cryptology, Proceedings of Crypto’ 84, Springer-Verlag, Berlin (1985), 314–338.Google Scholar
  2. BL86.
    G. R. Blaldey, Information theory without the finiteness assumption, II: Unfolding the DES. in H. Williams (editor), Advances in Cryptology, Proceedings of Crypto’ 85, Springer-Verlag, Berlin (1986), to appear.Google Scholar
  3. BL87.
    G. R. Blakley and C Meadows, Information theory without the finiteness assumption, III: Data compression and codes whose rates exceed unity. Proceedings of the 1986 Cirencester Conference on Cryptography and Coding, IMA, (1987) to appear.Google Scholar
  4. BR85.
    E. Brickell, Breaking iterated knapsacks, in G. R. Blakley and D. Chaum (editors), Advances in Cryptology, Proceedings of Crypto’ 84, Springer-Verlag, Berlin (1985), 342–358.Google Scholar
  5. DA86.
    G. I. Davida, C. Gilbertson and G. Walter, Analog cryptosystems, in Proceedings of Eurocrypt’ 85, Springer-Verlag, Berlin (1986), to appear, also Technical Report TRCS-84-1. Department of Electrical Engineering and Computer Science, University of Wisconsin, Milwaukee, (1984).Google Scholar
  6. DE83.
    D. E. R. Denning, Cryptography and Data Security, Addison-Wesley, Reading, Massachusetts (1983).Google Scholar
  7. FR64.
    Partial Differential Equations of Parabolic type. Prentice Hall, Englewood Cliffs, New Jersey, (1964).Google Scholar
  8. GA79.
    M. R. Garey and D. S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness, Freeman, San Francisco (1979).zbMATHGoogle Scholar
  9. HA23.
    J. Hadamard, Lectures on the Cauchy Problem in Linear Partial Differential Equations, Yale Univ. Press. New Haven, 1923.Google Scholar
  10. HO73.
    H. Hochstadt, The inverse Sturm-Liouville problem, Comm. Pure Applied Math., 16, 715–729, (1973).MathSciNetCrossRefGoogle Scholar
  11. PA74.
    L. E. Payne, Improperly Posed Problems in Partial Differential Equations, Springer Lecture Notes, (1974).Google Scholar
  12. PE 86.
    D. M. Pepper, Applications of optical phase conjugation, Scientific American, 254, No 1, 74–83, (1996).CrossRefGoogle Scholar
  13. PR67.
    M. H. Protter and H. Weinberger, Maximum Principles in Differential Equations, Prentice Hall, Englewood Cliffs, New Jersey (1967).Google Scholar
  14. PU 74.
    G. B. Purdy, A high security log-in procedure, Comm. ACM, 17 442–445 (1974).MathSciNetCrossRefGoogle Scholar
  15. RU76.
    W. Rundell and M. S. Stecher, Maximum principles for pseudoparabolic partial differential equations, SIAM J. Math. Analysis, 7 (1976), 898–912.MathSciNetzbMATHCrossRefGoogle Scholar
  16. RU79.
    W. Rundell and M. S. Stecher, The nonpositivity of solutions to pseudoparabolic equations, Proc. Amer. Math. SOC., 75, No. 2 (1979), 251–254.MathSciNetzbMATHCrossRefGoogle Scholar
  17. SH70.
    R. E. Showalter and T. W. Ting, Pseudoparabolic partial differential equations, SIAM J. Math. Analysis, 1 (1970), 1–25.MathSciNetzbMATHCrossRefGoogle Scholar
  18. SH70b.
    R. E. Showalter, Well-posed problems for a partial differential equation of order 2m + 1. SIAM J. Math. Anal. 1 (1970) 214–231.MathSciNetzbMATHCrossRefGoogle Scholar
  19. WE65.
    H. Weinberger, A First Course in Partial Differential Equations, Xerox College Publishing, Lexington, Massachusetts, (1965).zbMATHGoogle Scholar
  20. YO73.
    D. M. Young and R. T. Gregory, A Survey of Numerical Mathematics, Volume 2, Addison-Wesley, Reading, Massachusetts (1973).zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • G. R. Blakley
    • 1
  • William Rundell
    • 1
  1. 1.Department of MathematicsTexas A&M UniversityCollege Station

Personalised recommendations