Asymmetric Cryptosystem Using Careful Synchronization

TL;DR

This paper introduces a new public-private key cryptosystem based on the computational complexity of verifying careful synchronization in partial automata, leveraging PSPACE-completeness for security.

Contribution

It proposes a novel cryptosystem utilizing the PSPACE-complete problem of careful synchronization checking in partial automata, which is a new approach in cryptography.

Findings

Checking careful synchronization is PSPACE-complete even for binary alphabets.

The cryptosystem's security is based on the complexity of this problem.

The approach offers a new direction for cryptographic schemes based on automata theory.

Abstract

We present public-private key cryptosystem which utilizes the fact that checking whether a partial automaton is carefully synchronizing is $PSPACE$-complete, even in the case of a binary alphabet.