相关论文: Cayley Integers (long version)
Recently, Dor\"oz et al. (2017) proposed a new hard problem, called the finite field isomorphism problem, and constructed a fully homomorphic encryption scheme based on this problem. In this paper, we generalize the problem to the case of…
Cayley hash functions are based on a simple idea of using a pair of semigroup elements, A and B, to hash the 0 and 1 bit, respectively, and then to hash an arbitrary bit string in the natural way, by using multiplication of elements in the…
We use the Cayley transform to provide an explicit isomorphism at the level of cycles from van Daele $K$-theory to $KK$-theory for graded $C^*$-algebras with a real structure. Isomorphisms between $KK$-theory and complex or real $K$-theory…
In this paper, we give some properties of the levels and sublevels of algebras obtained by the Cayley-Dickson process. We will emphasize how isotropy of some quadratic forms can influence the levels and sublevels of algebras obtained by the…
An algebraic technique is presented that does not use results of model theory and makes it possible to construct a general Galois theory of arbitrary nonlinear systems of partial differential equations. The algebraic technique is based on…
Additive cyclic codes over Galois rings were investigated in previous works. In this paper, we investigate the same problem but over a more general ring family, finite commutative chain rings. When we focus on non-Galois finite commutative…
Line integration of generalized functions is studied. Second order partial differential equations with piecewise continuous and generalized variable coefficients over Cayley-Dickson algebras are investigated. Formulas for integrations of…
We introduce the Brackets package for the computer algebra system Macaulay2, which provides convenient syntax for computations involving the classical invariants of the special linear group. We describe our implementation of bracket rings…
We employ techniques of machine-learning, exemplified by support vector machines and neural classifiers, to initiate the study of whether AI can "learn" algebraic structures. Using finite groups and finite rings as a concrete playground, we…
We develop a public key cryptosystem based on invariants of diagonalizable groups and investigate properties of such cryptosystem first over finite fields, then over number fields and finally over finite rings. We consider the security of…
Although the Cayley-Dickson algebras are twisted group algebras, little attention has been paid to the nature of the Cayley-Dickson twist. One reason is that the twist appears to be highly chaotic and there are other interesting things…
In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has…
We conservatively extend classical elementary differential calculus to the Cartesian closed category of convergence spaces. By specializing results about the convergence space representation of directed graphs, we use Cayley graphs to…
This paper contains the results collected so far on polynomial composites in terms of many basic algebraic properties. Since it is a polynomial structure, results for monoid domains come in here and there. The second part of the paper…
The associative Cayley-Dickson algebras over the field of real numbers are also Clifford algebras. The alternative but nonassociative real Cayley-Dickson algebras, notably the octonions and split octonions, share with Clifford algebras an…
We work to find a basis of graded identities for the octonion algebra. We do so for the $\mathbb{Z}_2^2$ and $\mathbb{Z}_2^3$ gradings, both of them derived of the Cayley-Dickson process, the later grading being possible only when the…
This PhD deals with the notion of pseudo algebraically closed (PAC) extensions of fields. It develops a group-theoretic machinery, based on a generalization of embedding problems, to study these extensions. Perhaps the main result is that…
Cayley hash functions are based on a simple idea of using a pair of semigroup elements, A and B, to hash the 0 and 1 bit, respectively, and then to hash an arbitrary bit string in the natural way, by using multiplication of elements in the…
We show how eigentheory clarifies many algebraic properties of Cayley-Dickson algebras. These notes are intended as background material for those who are studying this eigentheory more closely.
Intended for mathematical physicists interested in applications of the division algebras to physics, this article highlights some of their more elegant properties with connections to the theories of Galois fields and quadratic residues.