A new algorithm to find prime numbers with less memory requirements
Daniele BufaloDepartment of InformaticsVia Orabona 4Università degli Studi di Bari Aldo MoroBari, I-70125, ItalyView full profile → , Michele Bufalomichele.bufalo@uniroma1.itDepartment of Methods and Models for EconomicsTerritory and Finance, Via del Castro Laurenziano 9Università degli Studi di Roma “La Sapienza”Roma, I-00185, ItalyView full profile → , *Giuseppe OrlandoCorresponding authorgiuseppe.orlando@uniba.itAffiliation 1Department of Economics and FinanceLargo Abbazia S. ScolasticaUniversità degli Studi di Bari Aldo MoroBari, I-70124, ItalyAffiliation 2Departamento de MatemáticasUniversitad de Jaén, Campus Las Lagunillas, s/nJaén, S-23071, SpainAffiliation 3Department of EconomicsSoyuza Pechatnikov Street 16HSE UniversitySaint Petersburg, R-190121, RussiaView full profile → , Raffaele TettaDepartment of InformaticsVia Orabona 4Università degli Studi di Bari Aldo MoroBari, I-70125, ItalyView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 02 Sep 2021
- Accepted:
- 02 Mar 2022
- Published Online:
- 21 Aug 2023
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-1629
- Pages:
- 1213–1236
Abstract
Keywords
Subject Classifications
References
[1] Abdullah, D., Rahim, R., Apdilah, D., Efendi, S., Tulus, T., and Suwilo, S. (2018). Prime numbers comparison using sieve of Eratosthenes and Sieve of Sundaram algorithm. In Journal of Physics: Conference Series, volume 978, page 012123. IOP Publishing.
[2] Agrawal, M., Kayal, N., and Saxena, N. (2004). PRIMES is in P. Annals of mathematics, pages 781–793.
[3] Atkin, A. and Bernstein, D. (2004). Prime sieves using binary quadratic forms. Mathematics of Computation, 73(246):1023–1030.
[4] Bombieri, E. (2000). Problems of the millennium: The Riemann hypothesis. Clay Mathematics Institute.
[5] Boujnouni, M. E. (2021). A study of prime numbers distribution based on support vector domain description. Journal of Information and Optimization Sciences, 42(4):865–882.
[6] Bufalo, M., Bufalo, D., and Orlando, G. (2021). A note on the computation of the modular inverse for cryptography. Axioms, 10(2):116.
[7] Hill, L. S. (1929). Cryptography in an algebraic alphabet. The American Mathematical Monthly, 36(6):306–312.
[8] Kahn, D. (1996). The Codebreakers: The comprehensive history of secret communication from ancient times to the internet. Simon and Schuster.
[9] Lehmer, D. H. (1930). An extended theory of Lucas’ functions. Annals of Mathematics, pages 419–448.
[10] Rivest, R. L., Shamir, A., and Adleman, L. (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120–126.
[11] Sergeev, I. S. (2016). On the complexity of computing prime tables on a Turing machine. arXiv preprint arXiv:1604.01154.
[12] Silverman, J. H. (2014). A friendly introduction to number theory. Pearson.
[13] Sundarayya, P. and Vara Prasad, G. (2019). A public key cryptosystem using affine Hill cipher under modulation of prime number. Journal of Information and Optimization Sciences, 40(4):919–930.
[14] Trigiante, G. and Trigiante, D. (2002). A discrete approach to the prime number theorem. The Journal of Difference Equations and Applications, 8(1):93–100.
[15] Viswanath, M. and Kumar, M. R. (2015). A public key cryptosystem using Hill’s cipher. Journal of Discrete Mathematical Sciences and Cryptography, 18(1-2):129–138.
[16] Wirian, D. J. (2009). Parallel prime sieve: Finding prime numbers. Institute of Information & Mathematical Sciences Massey University at Albany, Auckland, New Zealand.
[17] Zhang, Y. (2014). Bounded gaps between primes. Annals of Mathematics, pages 1121–1174.
