Open Access Open Access  Restricted Access Subscription or Fee Access

On enumerating solutions of certain equations over Z_m and an effective algorithm for factoring integers

Guangkui Xu, Xiwang Cao

Abstract


Factoring a large integer is a hard work in number theory. The security of the RSA public-key cryptosystem is based on the difficulty of factoring the product of two large prime numbers. This paper presents an efficient algorithm of factoring of integers, which is based on Berlekamp algorithm. By analysing the time complexity, our algorithm can be estimated to be much faster than the known algorithms. Meanwhile, We study the links between the number of solutions of certain equations over Z_m and the number of primitive idempotents in Z_m. We then apply the links to give the number of solutions of certain equations over Z_m.

Keywords


Factorization of integers, algorithm, Primitive idempotents, Solutions of equation.

Full Text:

PDF


Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information. Also: DOI is paid service which provided by a third party. We never mentioned that we go for this for our any journal. However, journal have no objection if author go directly for this paid DOI service.