We introduce a new factorization algorithm based on the optical computation by multi-path interference of the periodicity of a "factoring" function given by exponential sums at continuous arguments. We demonstrate that this algorithm allows, in principle, the prime number decomposition of several large numbers by exploiting a remarking rescaling property of this periodic function. Such a function is recorded by measuring optical interferograms with a multi-path Michelson interferometer, a polychromatic light source and a spectrometer. The information about factors is encoded in the location of the inteferogram maxima
In this research we propose a new method of integer factorization. Prime numbers are the building bl...
In this paper is demonstrated a method for reduction of integer factorization problem to an analysis...
Includes bibliographical references (page 35)The search for factoring algorithms has been ongoing fo...
We construct an analog computer based on light interference to encode the hyperbolic function f(ζ)≡1...
We take advantage of the interesting connection between truncated exponential sums with continuous a...
We introduce a new factorization algorithm based on the measurement of the periodicity of a determin...
The security of codes, for example in credit card and government information, relies on the fact tha...
In this paper, we will describe a new factorization algorithm based on the continuous representation...
In the present thesis we approach the factorization problem with a combination of quantum physics an...
What I call Diophantine optics is the exploitation in optics of some remarkable algebraic relations ...
In this paper, we intend to present a new algorithm to factorize large numbers. According to the alg...
Abstract. Integer factoring is a curious number theory problem with wide applications in complexity ...
Suppose that we want to factorize an integer N. We can use Lenstra's method, which is based on ellip...
The article describes the algorithm for factorization of large numbers. If there is the result of th...
We report on a new implementation of the factorisation of numbers using Gauss sums which improves t...
In this research we propose a new method of integer factorization. Prime numbers are the building bl...
In this paper is demonstrated a method for reduction of integer factorization problem to an analysis...
Includes bibliographical references (page 35)The search for factoring algorithms has been ongoing fo...
We construct an analog computer based on light interference to encode the hyperbolic function f(ζ)≡1...
We take advantage of the interesting connection between truncated exponential sums with continuous a...
We introduce a new factorization algorithm based on the measurement of the periodicity of a determin...
The security of codes, for example in credit card and government information, relies on the fact tha...
In this paper, we will describe a new factorization algorithm based on the continuous representation...
In the present thesis we approach the factorization problem with a combination of quantum physics an...
What I call Diophantine optics is the exploitation in optics of some remarkable algebraic relations ...
In this paper, we intend to present a new algorithm to factorize large numbers. According to the alg...
Abstract. Integer factoring is a curious number theory problem with wide applications in complexity ...
Suppose that we want to factorize an integer N. We can use Lenstra's method, which is based on ellip...
The article describes the algorithm for factorization of large numbers. If there is the result of th...
We report on a new implementation of the factorisation of numbers using Gauss sums which improves t...
In this research we propose a new method of integer factorization. Prime numbers are the building bl...
In this paper is demonstrated a method for reduction of integer factorization problem to an analysis...
Includes bibliographical references (page 35)The search for factoring algorithms has been ongoing fo...