On the power of commutativity in cryptography
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.
KeywordsCommutative Diagram Unify Idea Encryption Function Modular Exponentiation Root Problem
Unable to display preview. Download preview PDF.
- 1.B. Blakley and G. Blakely , "Security of Number Theoretic Public-Key Cryptosystems Against Random Attack," Cryptologia, October 1978.Google Scholar
- 2.W. Diffie and M. Hellman , "New Directions in Cryptography", IEEE Trans. Info. Theory, November 1976.Google Scholar
- 3.S. Even and Y. Yacobi , "Cryptocomplexity and NP-Completeness", Seventh ICALP, July 1980.Google Scholar
- 4.D. Knuth , The Art of Computer Programming, Vol 2, Addison-Wesley, 1969.Google Scholar
- 5.S. Pohlig and M. Hellman , "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 , "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems", CACM, February 1978.Google Scholar
- 7.A. Shamir , "On the Cryptocomplexity of Knapsack Systems", Proc. Eleventh ACM Symposium on the Theory of Computing, May 1979.Google Scholar
- 8.A. Shamir , "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 , "Mental Poker", MIT/LCS/TM-125, February 1979.Google Scholar
- 10.C. Shannon , "The Mathematical Theory of Communication", Bell System Technical Journal, July and October 1948.Google Scholar