Searcharxiv⌕ Search

arXiv subjects

Md. Helal Ahmed

Publications and source records attributed to Md. Helal Ahmed.

5 recordsLinked to original sources

A Public-Key Cryptosystem Using Cyclotomic Matrices

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.

cs.CR↗

Computation of Jacobi sums of order l^2 and 2l^2 with prime l

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.

math.NT↗

Jacobi sums and cyclotomic numbers: A survey report

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.

math.NT↗

Cyoclotomic Numbers Of Order 2l^2 With Prime L

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.

math.NT↗

Jacobi sums of order $2l^2$

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.

math.NT↗