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.
Keywords
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.
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.
Preview
Unable to display preview. Download preview PDF.
Bibliography
B. Blakley and G. Blakely [1978], "Security of Number Theoretic Public-Key Cryptosystems Against Random Attack," Cryptologia, October 1978.
W. Diffie and M. Hellman [1976], "New Directions in Cryptography", IEEE Trans. Info. Theory, November 1976.
S. Even and Y. Yacobi [1980], "Cryptocomplexity and NP-Completeness", Seventh ICALP, July 1980.
D. Knuth [1969], The Art of Computer Programming, Vol 2, Addison-Wesley, 1969.
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.
R. Rivest, A. Shamir and L. Adleman [1978], "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems", CACM, February 1978.
A. Shamir [1979], "On the Cryptocomplexity of Knapsack Systems", Proc. Eleventh ACM Symposium on the Theory of Computing, May 1979.
A. Shamir [1980], "A Pseudo-Random Sequence Generator Whose Cryptocomplexity is Provably Equivalent to that of the RSA", in preparation.
A. Shamir, R. Rivest and L. Adleman [1979], "Mental Poker", MIT/LCS/TM-125, February 1979.
C. Shannon [1948], "The Mathematical Theory of Communication", Bell System Technical Journal, July and October 1948.
Author information
Authors and Affiliations
Editor information
Rights 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