Skip to main content
SpringerLink
Log in

On the power of commutativity in cryptography

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1980)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 85))

Included in the following conference series:

Abstract

Every field needs some unifying ideas which are applicable to a wide variety of situations. In cryptography, the notion of commutativity seems to play such a role. This paper surveys its potential applications, such as the generation of common keys, challenge-and-response identification, signature generation and verification, key-less communication and remote game playing.

This research was supported by the Office of Naval Research under contract no. N00014-76-C-0366.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. B. Blakley and G. Blakely [1978], "Security of Number Theoretic Public-Key Cryptosystems Against Random Attack," Cryptologia, October 1978.

    Google Scholar 

  2. W. Diffie and M. Hellman [1976], "New Directions in Cryptography", IEEE Trans. Info. Theory, November 1976.

    Google Scholar 

  3. S. Even and Y. Yacobi [1980], "Cryptocomplexity and NP-Completeness", Seventh ICALP, July 1980.

    Google Scholar 

  4. D. Knuth [1969], The Art of Computer Programming, Vol 2, Addison-Wesley, 1969.

    Google Scholar 

  5. S. Pohlig and M. Hellman [1978], "An Improved Algorithm for Computing Logarithms Over GF(P) and Its Cryptographic Significance", IEEE Trans. Info. Theory, January 1978.

    Google Scholar 

  6. R. Rivest, A. Shamir and L. Adleman [1978], "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems", CACM, February 1978.

    Google Scholar 

  7. A. Shamir [1979], "On the Cryptocomplexity of Knapsack Systems", Proc. Eleventh ACM Symposium on the Theory of Computing, May 1979.

    Google Scholar 

  8. A. Shamir [1980], "A Pseudo-Random Sequence Generator Whose Cryptocomplexity is Provably Equivalent to that of the RSA", in preparation.

    Google Scholar 

  9. A. Shamir, R. Rivest and L. Adleman [1979], "Mental Poker", MIT/LCS/TM-125, February 1979.

    Google Scholar 

  10. C. Shannon [1948], "The Mathematical Theory of Communication", Bell System Technical Journal, July and October 1948.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Massachusetts Institute of Technology, 02139, Cambridge, Massachusetts, U.S.A.

    Adi Shamir

  2. Department of Mathematics, The Weizmann Institute of Science, Rehovot, Israel

    Adi Shamir

Authors
  1. Adi Shamir
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jaco de Bakker Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shamir, A. (1980). On the power of commutativity in cryptography. In: de Bakker, J., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 1980. Lecture Notes in Computer Science, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10003-2_100

Download citation

  • DOI: https://doi.org/10.1007/3-540-10003-2_100

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10003-4

  • Online ISBN: 978-3-540-39346-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation