A String-Based Public Key Cryptosystem

TL;DR

This paper introduces a novel string-based public key cryptosystem that avoids large number computations, using recursive encoding and quasi-commutative functions to enhance security.

Contribution

It presents a new cryptosystem based solely on strings, utilizing recursive encoding and quasi-commutative functions, differing from traditional number theory-based methods.

Findings

Security mechanism relies on recursive encoding and quasi-commutative functions.

The eavesdropper's problem is solvable, indicating potential vulnerabilities.

The paper details the cryptosystem's structure and security considerations.

Abstract

Traditional methods in public key cryptography are based on number theory, and suffer from problems such as dealing with very large numbers, making key creation cumbersome. Here, we propose a new public key cryptosystem based on strings only, which avoids the difficulties of the traditional number theory approach. The security mechanism for public and secret keys generation is ensured by a recursive encoding mechanism embedded in a quasi-commutative-random function, resulted from the composition of a quasi-commutative function with a pseudo-random function. In this revised version of the paper we show that the eavesdropper's problem of the proposed cryptosystem has a solution, and we give the details of the solution.