True random number generators are essential components for communications to be conconfidentially secured. In this paper a new method is proposed to generate random sequences of numbers based on the difference of the arrival times of photons detected in a coincidence window between two single-photon counting modules

Two- dimensional numerical simulations are carried out to study the elements of observing a Dirac point source and a Dirac binary system. The essential features of this simulation are demonstrated in terms of the point spread function and the modulation transfer function. Two mathematical equations have been extracted to present, firstly the relationship between the radius of optical telescope and the distance between the central frequency and cut-off frequency of the optical telescope, secondly the relationship between the radius of the optical telescope and the average frequency components of the modulation transfer function.

          The aim of this paper is to present a new methodology to find the private key of RSA. A new initial value which is generated from a new equation is selected to speed up the process. In fact, after this value is found, brute force attack is chosen to discover the private key. In addition, for a proposed equation, the multiplier of Euler totient function to find both of the public key and the private key is assigned as 1. Then, it implies that an equation that estimates a new initial value is suitable for the small multiplier. The experimental results show that if all prime factors of the modulus are assigned larger than 3 and the multiplier is 1, the distance between an initial value and the private key