Asymmetric Cryptosystem Using Careful Synchronization

02/02/2023
by   Jakub Ruszil, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/15/2021

The Complexity of Checking Partial Total Positivity

We prove that checking if a partial matrix is partial totally positive i...
research
06/17/2019

A Public-Key Cryptosystem Using Cyclotomic Matrices

Confidentiality and Integrity are two paramount objectives of asymmetric...
research
11/03/2017

On Automata Recognizing Birecurrent Sets

In this note we study automata recognizing birecurrent sets. A set of wo...
research
04/19/2020

On synchronization of partial automata

A goal of this paper is to introduce the new construction of an automato...
research
02/23/2023

(Arbitrary) Partial Communication

Communication within groups of agents has been lately the focus of resea...
research
11/16/2020

Fact Checking via Path Embedding and Aggregation

Knowledge graphs (KGs) are a useful source of background knowledge to (d...

Please sign up or login with your details

Forgot password? Click here to reset