tlooto
Sign up
Computer ScienceMathematics

On Some Cryptographic Protocol

W. Forys

2021Schedae Informaticae

DOI: 10.4467/20838476si.21.001.14382

tlooto Summary

It is proved that non-emptiness of a semi-commutative set defined by mappings involved in the protocol is a decidable problem.

Abstract

In this paper we present a cryptographic protocol for a seller - buyer problem and in particular we prove that non-emptiness of a semi-commutative set defined by mappings involved in the protocol is a decidable problem.

Citation format

FORYS, W. On some cryptographic protocol. Schedae Informaticae, 2021.