We give three new systematic authentication schemes, two using Gray map, finite fields and Galois rings, and one using only Galois rings. In the first scheme, we increase the size and simplify the scheme’s source space in [9]. In the second scheme, we reduce the key space of the first scheme. Finally, by not considering Gray map, used in the previous schemes, we give a third scheme on Galois rings, which generalizes the scheme over finite fields given in [8]. The introduced schemes obtain optimal impersonation and substitution probabilities.

In this paper, we give the Galois adjunction form of the regular relation, and by using residuated mapping, we find the connection between it and order-generating set. Furthermore, we obtain the equivalent conclusion of "regular". In addition, by using the specialization order of topological space and the lower approximate operator in the rough set, we find a continuous homeomorphic mapping from a regular space to a Alexandrov topological space

In this paper we study the normal bases for Galois ring extension ${{R}} / {Z}_{p^r}$ where ${R}$ = ${GR}$(p^r, n). We present a criterion on normal basis for ${{R}} / {Z}_{p^r}$ and reduce this problem to one of finite field extension $\overline{R} / \overline{Z}_{p^r}=F_{q} / F_{p} (q=p^n)$ by Theorem 1. We determine all optimal normal bases for Galois ring extension.

Communication, compression of information, transmission of information through noisy channels, interconnecting different information systems, cryptography, gate construction –– these areas all depend on classical information theory. We show that, in classical terms, semantic aspects of communication are not at all irrelevant to the engineering problem, contrary to Shannon, and affect the message intended to be transmitted. This is revisited and captured by an analogy to trust, in that they are essential to the channel (for proper use), but cannot be transferred (under risk of flaws) through that same channel. Information is also described by, at least, a tri-state system — not by binary logic. The trust analogy semantics can be coded as the Curry-Howard relationship, connecting computer code with structural logic, by way of different categories. Two-state and Boolean logic (aka Shannon semantics) was used classically before, with Shannon theory, but without trust analogy semantics – found to be a sine qua non condition. This is now familiar in classical gate construction with physical systems with, e.g., Verilog and SystemVerilog. The applications to computation and quantum theory are further explored. The most fundamental entity in today`s theory of information is proposed to use at least three logical states, not bits, in all applications, including: cyber-physical systems, devices, in computation, and in quantum theory.

Quantum mechanics could be studied through polynomial algebra, as has been demonstrated by a work (“An approach to first-principles electronic structure calculation by symbolic-numeric computation” by A. Kikuchi). We carry forward the algebraic method of quantum mechanics through algebraic number theory; the basic equations are represented by the multivariate polynomial ideals; the symbolic computations process the ideal and disentangle the eigenstates as the algebraic variety; upon which one canbuild the Galois extension of the number field, in analogy with the univariate polynomial case, to investigate the hierarchy of solutions; the Galois extension is accompanied with the group operations, which permute the eigenstates from one to another, and furnish the quantum system with a non-apparent symmetry. Besides, this sort of algebraic quantum mechanics is an embodiment of the class field theory; some of the important consequences of the latter emerge in quantum mechanics. We shall demonstrate these points through simple models; we will see the use of computational algebra facilitates such sort of analysis, which might often be complicated if we try to solve them manually.