On Some Cryptographic Protocol

• Autorzy: Foryś Wit

Identyfikatory

DOI

10.4467/20838476SI.21.001.14382

• Języki publikacji: EN

Abstrakty

EN

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

EN

cryptographic protocol; key-code; semi-commutativity set

• Wydawca: Wydawnictwo Uniwersytetu Jagiellońskiego
• Czasopismo: Schedae Informaticae
• Rocznik: 2021
• Tom: Vol. 30
• Strony: 9--15
• Opis fizyczny: Bibliogr. 7 poz., rys.

Twórcy

autor

Foryś Wit

• Faculty of Applied Mathematics, AGH University of Science and Technology al. Mickiewicza 30, 30-059 Kraków, Poland

Bibliografia

• [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.

Uwagi

Opracowanie rekordu ze środków MNiSW, umowa Nr 461252 w ramach programu "Społeczna odpowiedzialność nauki" - moduł: Popularyzacja nauki i promocja sportu (2021).