On Some Cryptographic Protocol

Wit Foryś


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.

Słowa kluczowe: cryptographic protocol, key-code, semi-commutativity set

[1] J.A.Anderson, The intersection of retracts of A; Theoretical Computer Science, 2000, 237, pp. 312-326.

[2] J.A.Anderson,W.Forys, T.Head, Retracts and semiretracts of free monoids, AMS Meeting, San Francisco, 1991.

[3] S.Eilenberg, Automata, Languages, and Machines, Academic Press, 1974.

[4] W.Forys, K.Krawczyk, An Algorithmic Approach to the Problem of a Semiretract Base, Theoretical Computer Science, 2006, 369, pp. 314-322.

[5] G.Paun A.Salomaa, Semi-commutativity Sets a Cryptographically Grounded  Topic, Bull. Math. Soc. Sci. Math. Roumaine, 1991, 35, pp. 255-270.

[6] L.Kari, G.Paun, A.Salomaa, Semi-Commutativity Sets of Morphisms over Finitely Generated Free Monoids, Bull. Math. Soc. Sci. Math. Roumaine, 1992, 36, pp. 293-307.

[7] A.Salomaa, Public-key Cryptography, Springer V. 1990.

Czasopismo ukazuje się w sposób ciągły on-line.
Pierwotną formą czasopisma jest wersja elektroniczna.

Wersja papierowa czasopisma dostępna na www.wuj.pl