simple search
On Some Cryptographic Protocol
Wit Foryś
Schedae Informaticae, Volume 30, 2021, pp. 9 - 15
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.