Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bauer, G., Otto, F.: Finite complete rewriting systems and the complexity of the word problem. Acta Informatica 21 (1984) 521–540
Book, R.: Confluent and other types of Thue systems. J. ACM 29 (1982) 171–183
Book, R.: Thue systems as rewriting systems. J. Symb. Comput. 3 (1987) 39–68
Book, R., Otto, F.: String-Rewriting Systems. Springer: New-York, 1993
Book, R., Squier, C.: Almost all one-rule Thue systems have decidable word problem. Discrete Mathematics 49 (1984) 237–240.
Garey, M., Johnson, D.: Computer and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
Kapur, D., Krishnamoorthy, M., McNaughton, R., Narendran, P.: An O(¦T¦3) algorithm for testing the Church-Rosser property of Thue systems. Theor. Comp. Sci. 35 (1985) 109–114
Kari, J.: Observations concerning a public-key cryptosystem based on iterated morphisms. Theoretical Computer Science 66 (1989) 45–53
Narendran, P., O'Dunlaing, C., Rolletschek, H.: Complexity of certain decision problems about congruential languages. J. Comp. Syst. Sci. 30 (1985) 343–358
Nurmi, H., Salomaa, A.: Conducting secret ballot elections in computer networks: problems and solutions, Annals of Operations Research 5 (1994) 185–190
O'Dunlaing, C.: Undecidable questions related to Church-Rosser Thue systems. Theoretical Computer Science 23 (1983) 339–345
Rivest, R.: Cryptography. Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen, ed., (1990) 717–755
Salomaa, A.: Jewels of formal language theory. Comp. Sci. Press, Rockville, 1981
Salomaa, A.: A public-key cryptosystem based on language theory. Computer and Security 7 (1988) 83–87
Salomaa, A., Yu, S.: On a public-key cryptosystem based on iterated morphisms and substitutions. Theoretical Computer Science 48 (1989) 283–246
Salomaa, A.: Public-Key Cryptography. EATCS Monographs on Theoretical Computer Science 23, Springer-Verlag, 1993
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–108
Wagner, N. R., Magyarik, M. R.: A public-key cryptosystem based on the word problem. Lecture Notes in Computer Science 196 (1985) 19–37
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oleshchuk, V.A. (1995). On public-key cryptosystem based on Church-Rosser string-rewriting systems. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030841
Download citation
DOI: https://doi.org/10.1007/BFb0030841
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60216-3
Online ISBN: 978-3-540-44733-7
eBook Packages: Springer Book Archive