This work will present the main encryption algorithm of the PASME tool, PASME allows encrypt and hide information in various types of files. The algorithm uses the fact that factoring large numbers is a difficult issue in terms of computational performing to make the main steps of the encryption. Resumo— Neste trabalho será apresentado o principal algoritmo de criptografia da ferramenta PASME, ...

We discuss the problem of factoring N = pq and survey some approaches. We then present a specialized factoring algorithm that runs in time Õ(q0.31), which is comparable to the runtime Õ(p) of the factoring algorithm for integers of the form N = pq presented in [1]. We then survey the factoring algorithm of [1] and discuss the number of advice bits needed for it to run in polynomial time. Furthe...

We provide evidence that breaking low-exponent rsa cannot be equivalent to factoring integers. We show that an algebraic reduction from factoring to breaking low-exponent rsa can be converted into an e cient factoring algorithm. Thus, in e ect an oracle for breaking rsa does not help in factoring integers. Our result suggests an explanation for the lack of progress in proving that breaking rsa ...

The elliptic curve method (ECM) for integer factorization is an algorithm that uses the algebraic structure of the set of points of an elliptic curve for factoring integers. The running time of ECM depends on the size of the smallest prime divisor of the number to be factored. One of its main applications is the co-factorization step in the number field sieve algorithm that is used for assessin...

Factoring is explicitly linked to the value of a supplier’s accounts receivable and receivables are sold, rather than collateralized, and factored receivables are not part of the estate of a bankrupt firm. Therefore, factoring may allow a high-risk supplier to transfer its credit risk to higher quality buyers. Empirical tests find that factoring is larger in countries with greater economic deve...