On public-key cryptosystem based on Church-Rosser string-rewriting systems

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.