We report on prime number decomposition by use of the Talbot effect, a well-known
phenomenon in classical near field optics whose description is closely related to Gauss …

We construct an analog computer based on light interference to encode the hyperbolic
function f (ζ)≡ 1/ζ into a sequence of skewed curlicue functions. The resulting interferogram …

Factorization of numbers with Gauss sums: I. Mathematical background Page 1 OPEN ACCESS
Factorization of numbers with Gauss sums: I. Mathematical background To cite this article: S …

Abstract Truncated Fourier, Gauss, Kummer and exponential sums can be used to factorize
numbers: for a factor these sums equal unity in absolute value, whereas they nearly vanish …

We report on a new implementation of the factorisation of numbers using Gauss sums which
improves tremendously the efficiency to eliminate all" ghost" factors. We show that by …

We report a detailed analysis of the optical realization of the analogue algorithm described
in the first paper of this series (Tamma in Quantum Inf Process 11128: 1190, 2015) for the …

We describe a novel analogue algorithm that allows the simultaneous factorization of an
exponential number of large integers with a polynomial number of experimental runs. It is …

Finding the factors of an integer can be achieved by various experimental techniques, based
on an algorithm developed by Schleich et al.(Fortschr. Phys., 54 (2006) 856), which uses …

In this paper, we will describe a new factorization algorithm based on the continuous
representation of Gauss sums, generalizable to orders j> 2. Such an algorithm allows one …

The phase φ of any wave is determined by the ratio x/λ consisting of the distance x
propagated by the wave and its wavelength λ. Hence, the dependence of φ on λ constitutes …