Related papers: Multi-Prime RSA Over Galois Approach
We study prime ideals, prime modules, and associated primes of graded modules over rings $S$ graded by a unique product monoid. We consider two situations in detail: (a) the case where $S$ is strongly group-graded and (b) the case where $S$…
This work provides a method(an algorithm) for solving the solvable unary algebraic equation $f(x)=0$ ($f(x)\in\mathbb{Q}[x]$) of arbitrary degree and obtaining the exact radical roots. This method requires that we know the Galois group as…
This study concentrates on preserving privacy in a network of agents where each agent seeks to evaluate a general polynomial function over the private values of her immediate neighbors. We provide an algorithm for the exact evaluation of…
Applying geometric methods of $2$-dimensional cell complex theory, we construct a Galois covering of a bimodule problem satisfying some structure, triangularity and finiteness conditions in order to describe the objects of finite…
The radical solution of polynomials with rational coefficients is a famous solved problem. This paper found that it is a $\mathbb{NP}$ problem. Furthermore, this paper found that arbitrary $ \mathscr{P} \in \mathbb{P}$ shall have a one-way…
We show that many known schemes of the public key exchange protocols in the algebraic cryptography, that use two-sided multiplications, are the specific cases of the general scheme of such type. In most cases, such schemes are built on…
In recent years there has been a great deal of work done on secret sharing scehemes. Secret Sharing Schemes allow for the division of keys so that an authorised set of users may access information. In this paper we wish to present a…
We propose a polynomial-time attack on the hHB protocol, showing that the protocol does not attain the claimed security. Our attack is based on the GRS attack.
ITRU cryptosystem is a public key cryptosystem and one of the known variants of NTRU cryptosystem. Instead of working in a truncated polynomial ring, ITRU cryptosystem is based on the ring of integers. The authors claimed that ITRU has…
We present here some results of applying the Cayley-Dickson process to certain alternative algebras (notably built upon Galois fields and congruence rings), in a manner which might yield new building blocks for cryptographic systems. We…
In this paper we show that two dimensional (mod p) Galois representations satisfying mild hypotheses can be lifted to p-adic Galois representations ramified at infinitely many primes such that the characteristic polynomials of Frobenius at…
Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…
We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…
The ring of dual numbers over a ring $R$ is $R[\alpha] = R[x]/(x^2)$, where $\alpha$ denotes $x+(x^2)$. For any finite commutative ring $R$, we characterize null polynomials and permutation polynomials on $R[\alpha]$ in terms of the…
The Galois hulls of linear codes are a generalization of the Euclidean and Hermitian hulls of linear codes. In this paper, we study the Galois hulls of (extended) GRS codes and present several new constructions of MDS codes with Galois…
In this paper we introduce a multistep generalization of the guess-and-determine or hybrid strategy for solving a system of multivariate polynomial equations over a finite field. In particular, we propose performing the exhaustive…
Polynomial preconditioning can improve the convergence of the Arnoldi method for computing eigenvalues. Such preconditioning significantly reduces the cost of orthogonalization; for difficult problems, it can also reduce the number of…
We propose an irregular repetition slotted ALOHA (IRSA) based random-access protocol for the binary adder channel (BAC). The BAC captures important physical-layer concepts, such as packet generation, per-slot decoding, and information rate,…
This paper studies Galois extensions over real quadratic number fields or cyclotomic number fields ramified only at one prime. In both cases, the ray class groups are computed, and they give restrictions on the finite groups that can occur…
In this study we introduce a second type of higher order generalised geometric polynomials. This we achieve by examining the generalised stirling numbers $S(n; k;\alpha;\beta;\gamma)$ [Hsu & Shiue,1998] for some negative arguments. We study…