PRESENTATION OF NEW METHOD TO OBTAIN HUGEPRIME NUMBERS TO INCREASERSA CRYPTOGRAPHY ALGORITHM SECURITY

Mahnaz Mozafari¹ Mehdi Zamani² Mohammad Mehdi Shirmohammadi³ Mostafa Chahardoli⁴ Sara Taheri⁵

1) Department of Computer Engineering, Hamedan Branch, Islamic Azad University, Hamedan, Iran
2) Department of Computer Engineering, Hamedan Branch, Islamic Azad University, Hamedan, Iran
3) Department of Computer Engineering, Hamedan Branch, Islamic Azad University, Hamedan, Iran
4) Department of Computer Engineering, Hamedan Branch, Islamic Azad University, Hamedan, Iran
5) Department of Computer Engineering, Hamedan Branch, Islamic Azad University, Hamedan, Iran

Publication : 4th International Conference On Research Science And Technology(4rstconf.com)
Abstract :
Calculation of prime number has always been important for researchers and mathematicians. Although there exists a lot of prime numbers, no relationship showing the distribution of prime numbers has been found yet. Existing methods show that prime numbers distribute between other numbers randomly. In this paper, Mersenne and Sophie Germain methods for calculating prime numbers will be analyzed. Also we will present a new method PLMT with the aim of producing large prime numbers for increasing security of encryption. PLMT predicts next prime number faster using previous prime numbers. New prime numbers have great importance in encryption. Using this method, we reduce production time prime numbers.
Keywords : Prime numbers method Mersenne method Sophie Germain internet cryptography least common multiple