Sigma Identification Protocol Construction Based on MPF

A new sigma identification protocol (SIP) based on matrix power function (MPF) defined over the modified medial platform semigroup and power near-semiring is proposed. It is proved that MPF SIP is resistant against direct and eavesdropping attacks. Our security proof relies on the assumption that MPF defined in the paper is a candidate for one-way function (OWF). Therefore, the corresponding MPF problem is reckoned to be a difficult one. This conjecture is based on the results demonstrated in our previous studies, where a certain kind of MPF problem was proven to be NP-complete.

Syntactic semigroup problem for the semigroup reducts of affine near-semirings over Brandt semigroups

The syntactic semigroup problem is to decide whether a given finite semigroup is syntactic or not. This work investigates the syntactic semigroup problem for both the semigroup reducts of [Formula: see text], the affine near-semiring over a Brandt semigroup [Formula: see text]. It is ascertained that both the semigroup reducts of [Formula: see text] are syntactic semigroups.