On public-key cryptosystem based on Church-Rosser string-rewriting systems
We propose an approach toward public-key cryptosystems based on finite string-rewriting systems with Church-Rosser property. The approach utilizes an existence of unique normal form for any congruence class modulo such a system and possibility to find it in linear time. Such cryptosystems can be used in the case we are dealing with a large network of communicating parties when it is impractical to use a distinct secret method signing for every pair users and we would like to have a unified secret method for all senders sending to a receiver.
Unable to display preview. Download preview PDF.
- 3.Book, R.: Thue systems as rewriting systems. J. Symb. Comput. 3 (1987) 39–68Google Scholar
- 4.Book, R., Otto, F.: String-Rewriting Systems. Springer: New-York, 1993Google Scholar
- 6.Garey, M., Johnson, D.: Computer and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.Google Scholar
- 12.Rivest, R.: Cryptography. Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen, ed., (1990) 717–755Google Scholar
- 13.Salomaa, A.: Jewels of formal language theory. Comp. Sci. Press, Rockville, 1981Google Scholar
- 16.Salomaa, A.: Public-Key Cryptography. EATCS Monographs on Theoretical Computer Science 23, Springer-Verlag, 1993Google Scholar
- 17.Sardinas, A., Patterson, G.: A necessary and sufficient condition for the unique decomposition of coded messages, I.R.E. Int. Conv. Rec. 8 (1953) 104–108Google Scholar
- 18.Wagner, N. R., Magyarik, M. R.: A public-key cryptosystem based on the word problem. Lecture Notes in Computer Science 196 (1985) 19–37Google Scholar