we prove that each normal automorphism of the $n$-periodic product of cyclic groups of odd order $rge1003$ is inner, whenever $r$ divides $n$.

we introduce and  study  fuzzy (co-)inner product and fuzzy(co-)norm of hyperspaces. in this regard by considering  the notionof hyperspaces, as a generalization of vector spaces, first we willintroduce the notion of fuzzy (co-)inner product in hyperspaces and will apply it to formulate the notions offuzzy (co-)norm and fuzzy (co-)orthogonality  in hyperspaces. inparticular, we will prove that ...

We study divisibilities between bounded holomorphic quasi-inner functions in H∞ and operator-valued bounded holomorphic quasi-inner functions in H∞(Ω, L(K)) where Ω is a bounded finitely connected region. Furthermore, we characterize these divisibilities by using rationally-invariant subspaces.

A mapping f : M → N between Hilbert C∗-modules approximately preserves the inner product if ‖〈f(x), f(y)〉 − 〈x, y〉‖ ≤ φ(x, y), for an appropriate control function φ(x, y) and all x, y ∈ M. In this paper, we extend some results concerning the stability of the orthogonality equation to the framework of Hilbert C∗modules on more general restricted domains. In particular, we investigate some asympt...

Masking is a popular countermeasure against side channel attacks. Many practical works use Boolean masking because of its simplicity, ease of implementation and comparably low performance overhead. Some recent works have explored masking schemes with higher algebraic complexity and have shown that they provide more security than Boolean masking at the cost of higher overheads. In particular, ma...

Masking schemes are a prominent countermeasure to defeat power analysis attacks. One of their core ingredients is the encoding function. Due to its simplicity and comparably low complexity overheads, many masking schemes are based on a Boolean encoding. Yet, several recent works have proposed masking schemes that are based on alternative encoding functions. One such example is the inner product...