arXiv subjects
Publications and source records attributed to Jagmohan Tanti.
We give a method to compute the primitive central idempotents of a semi-simple finite group algebra associated with an irreducible character $χ$ such that for every $g\in G$, either $χ(g) = 0$ or all eigenvalues of $ρ(g)$ have the same order. We then show several consequences which highlight the significance and possible applications of our approach.
In this paper, we have proposed a public key cryptography using recursive block matrices involving generalized Fibonacci numbers over a finite field Fp. For this, we define multinacci block matrices, a type of upper triangular matrix involving multinacci matrices at diagonal places and obtained some of its algebraic properties. Moreover, we have set up a method for key element agreement at end users, which makes the cryptography more efficient. The proposed cryptography comes with a large keyspace and its security relies on the Discrete Logarithm Problem(DLP).
In this paper, we have proposed a modified cryptographic scheme based on the application of recursive matrices as key in ECC and ElGamal. For encryption, we consider mapping analogous to affine Hill cipher in which a plaintext matrix has been constructed by points corresponding to letters on elliptic curves. In the formation of key-space, the generalized Fibonacci matrices have been taken into account, which is the sequence of matrices. The beauty of considering Fibonacci matrices is their construction where we need only two parameters(integers) in place of $n^2$ elements. The use of a recursive matrix makes a large keyspace for our proposed scheme and increases its efficiency. Thus, it reduces time as well space complexity, and its security \& strength is based on EC-DLP which is a hard problem in number theory.
In this paper, we define new generalized k-Mersenne numbers and give a formula of generalized Mersenne polynomials and further we study their properties. Moreover, we define Gaussian Mersenne numbers and obtain some identities like Binet Formula, Cassini's identity, D'Ocagne's Identity, and generating functions. The generalized Gaussian Mersenne numbers are described and the relation with classical Mersenne numbers are explained. We also introduce a generalization of Gaussian Mersenne polynomials and establish some properties of these polynomials.
In this paper we compute the number of n degree representations of a group of order p^3 for p an odd prime and the dimensions of corresponding spaces of invariant bilinear forms over an algebraically closed field F. We explicitly discuss about the existence of non-degenerate invariant bilinear forms. The results are important due to their application in the studies of physical sciences.
Let G be a group of order 8 and F an algebraically closed field with char= 2. In this paper we compute the number of n degree representations of G and subsequent dimensions of the corresponding spaces of invatiant bilinear forms over the field F. We explicitly discuss about the existence of non-degenerate invariant bilinear forms.
In this paper, for n a positve integer, we compute the number of n degree representations for a dihedral group G of order 2m, m \geq 3 and the dimensions of the corresponding spaces of G invariant bilinear forms over a complex field C. We explicitly discuss about the existence of a non-degenerate invariant bilinear form. The results are important due to their applications in the studies of physical sciences.
Confidentiality and Integrity are two paramount objectives in the evaluation of information and communication technology. In this paper, we propose an arithmetic approach for designing asymmetric key cryptography. Our method is based on the formulation of cyclotomic matrices correspond to the diophantine system. The proposed cyclotomic asymmetric cryptosystem (CAC) utilizes the cyclotomic matrices, whose entries are cyclotomic numbers of order $2l^{2}$, $l$ be prime over a finite field $\mathbb{F}_{p}$ of $p$ elements. The method utilize cyclotomic matrices to design a one-way function. The outcome of a one-way function that is efficient to compute however difficult to compute its inverse unless if secret data about the trapdoor is known. We demonstrate that the encryption and decryption can be efficiently performed with asymptotic complexity of $\mathcal{O}(e^{2.373})$. Besides, we study the computational complexity of the CAC.
The congruences for Jacobi sums of some lower orders has been treated by many authors in the literature. In this paper we establish the congruences for Jacobi sums of order 2l^2 with odd prime l. These congruences are useful to obtain algebraic and arithmetic characterizations for Jacobi sums of order 2l^2 .
In this paper, we present the fast computational algorithms for the Jacobi sums of orders $l^2$ and $2l^{2}$ with odd prime $l$ by formulating them in terms of the minimum number of cyclotomic numbers of the corresponding orders. We also implement two additional algorithms to validate these formulae, which are also useful for the demonstration of the minimality of cyclotomic numbers required.
The determination of Jacobi sums, their congruences and cyclotomic numbers have been the object of attention for many years and there are large number of interesting results related to these in the literature. This survey aims at reviewing results concerning the diophantine systems for finding the cyclotomic numbers and coefficients of Jacobi sums and to indicate the current status of the problem.
Jacobi sums and cyclotomic numbers are the important objects in number theory. The determination of all the Jacobi sums and cyclotomic numbers of order $e$ are merely intricate to compute. This paper presents the lesser numbers of Jacobi sums and cyclotomic numbers which are enough for the determination of all Jacobi sums and the cyclotomic numbers of a particular order.
The problem of determining cyclotomic numbers in terms of the solutions of certain Diophantine systems has been treated by many authors since the age of Gauss. In this paper we obtain an explicit expression for cyclotomic numbers of order 2l^2 in terms of the coefficients of the Jacobi sums of lower orders. At the end, we illustrate the nature of two matrices corresponding to two types of cyclotomic numbers.
The aim of this paper is to deal with congruences for Jacobi sums of order $2l^{2}$ over a finite field $\mathbb{F}_{q}, q=p^{r}$, $p^{r}\equiv 1\ (mod \ 2l^{2})$, where $l>3$ and $p$ are primes. Further, we also calculate Jacobi sums $J_{2l^{2}}(1,n)$ of order $2l^{2}$ in terms of Dickson-Hurwitz sums.
In this paper we establish the Eulers criterion of order l (a prime) when the ring of integers in the cyclotomic extension of Q of order l is a PID. Conditions are obtained in terms of Jacobi sums of order l.