مواقع التدريسيينجامعة الكوفة
0Publications
0Lectures
0Interests

About

I received B.Sc. degree in Mathematics from University of Baghdad, Iraq, in 2005, and M.Sc. degree in Mathematics with a specialty in Number Theory/Cryptography from University of Babylon, Iraq, in 2010, and Ph.D. degree in Mathematics with a specialty in Number Theory from University of Reading, UK, in 2020.
I am currently working as an assistant professor at Department of Computer Science, Faculty of Computer Science and Mathematics, University of Kufa. My research interests include Number Theory, Analytic Number Theory, Cryptography, Cryptoanalysis, and Applied Mathematics.

Research Interests

8

Publications

3
2020

Completely multiplicative functions with sum zero over generalised prime systems

AuthorsAmmar Ali Neamah
JournalResearch in Number Theory
Abstract

CMO functions multiplicative functions f for which ∑∞n=1f(n)=0. Such functions were first defined and studied by Kahane and Saïas [14]. We generalised these to Beurling prime systems with the aim to investigate the theory of the extended functions and we shall call them CMOP functions. We give some properties and find examples of CMOP functions. In particular, we explore how quickly the partial sum of these classes of functions tends to zero with different generalised prime systems. The findings of this paper may suggest that for all CMOP functions f over N with abscissa 1, we have ∑n≤xn∈Nf(n)=Ω(1x−−√).

2020

The average order of the Möbius function for Beurling primes

AuthorsAmmar Ali Neamah , Titus W. Hilberdink
JournalInternational Journal of Number Theory
Abstract

In this paper, we study the counting functions ψP(x), NP(x) and MP(x) of a generalized prime system N. Here, MP(x) is the partial sum of the Möbius function over N not exceeding x. In particular, we study these when they are asymptotically well-behaved, in the sense that ψP(x)=x+O(xα+ϵ), NP(x)=ρx+O(xβ+ϵ) and MP(x)=O(xγ+ϵ), for some ρ>0 and α,β,γ<1. We show that the two largest of α,β,γ must be equal and at least 12.

2015

New Collisions to Improve Pollard’s Rho Method of Solving the Discrete Logarithm Problem on Elliptic Curves

AuthorsAmmar Ali Neamah
JournalJournal of Computer Science
Abstract

It is true that different approaches have been utilised to accelerate the computation of discrete logarithm problem on elliptic curves with Pollard's Rho method. However, trapping in cycles fruitless will be obtained by using the random walks with Pollard's Rho. An efficient alternative approach that is based on new collisions which are reliant on the values ai , bi to solve this problem is proposed. This may requires less iterations than Pollard's Rho original in reaching collision. Thus, the performance of Pollard's Rho method is more efficiently because the improved method not only reduces the number of mathematical operations but these collisions can also applied on previous improvements which reported in the literature.

Lectures

3
View details