5 papers
Integer Factorization: Another perspective
Gilda Rech Bansimba, Regis Freguin Babindamana
Integer factorization is a fundamental problem in algorithmic number theory and computer science. It is considered as a one way or trapdoor function in the (RSA) cryptosystem. To d…
Approximating Euler Totient Function using Linear Regression on RSA moduli
Gilda Rech Bansimba, Regis F. Babindamana, Beni Blaug N. Ibara
The security of the RSA cryptosystem is based on the intractability of computing Euler's totient function phi(n) for large integers n. Although deriving phi(n) deterministically re…
A Continued Fraction-Hyperbola based Attack on RSA cryptosystem
Gilda Rech Bansimba, Regis Freguin Babindamana, Basile Guy R. Bossoto
In this paper we present new arithmetical and algebraic results following the work of Babindamana and al. on hyperbolas and describe in the new results an approach to attacking a R…
A New Hyperbola based Approach to factoring Integers
Gilda Rech Bansimba, Regis Freguin Babindamana, Basile Guy R. Bossoto
From the results in the literature, the algebraic set of the hyperbola with parameter defined by $\mathcal{B}_{n}(X, Y, Z)_{\mid_{x\geq 4n}}= \displaystyle \lbrace \left(X: Y:…
Rational Points of some genus curves from the rank quotient strategy
Tony Ezome, Brice Miayoka Moussolo, Régis Freguin Babindamana
In 1922, Mordell conjectured that the set of rational points on a smooth curve over with genus is finite. This has been proved by Faltings in 1983. Howev…