Skip to main content
SpringerLink
Log in

Fast prime number generation algorithms on smart mobile devices

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

As smart mobile devices are widely used, mobile threats are more serious, so security in mobile becomes more and more important. However, the performance of these devices are not powerful enough to use the same security algorithms as PCs. Public key cryptosystems such as RSA need big primes to enhance the security, however, generating a big prime takes substantial time even on a PC. In this paper, we study two prime generation algorithms for smart mobile devices. First, we analyze a previous prime generation algorithm using a GCD test, named PGCD-MR, and show it sometimes performs inferior to the traditional TD-MR test. Second, we propose a new GCD test, named m-bit GCD-MR, for fast prime generation in both PCs and smart mobile devices. We compare the running times of PGCD-MR, m-bit GCD-MR, and TD-MR combinations on PCs and Samsung Galaxy Tab 10.1. The experimental results show our running time analysis is accurate (only 2% error) and m-bit GCD-MR test is the fastest among three prime generation algorithms. More exactly, m-bit GCD-MR test is about 20% faster than the TD-MR combination.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures an public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  2. Liu, C.: A study of relationship among goldbach conjecture, twin prime and fibonacci number. Int. J. Netw. Secur. 19(3), 406–412 (2015)

    MathSciNet  Google Scholar 

  3. ElGmal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469–472 (1985)

    Article  MathSciNet  Google Scholar 

  4. National Institute for Standards and Technology, Digital Signature Standard (DSS), Fedral Register, vol. 169 (1991)

  5. Rhee, K., Jeon, W., Won, D.: Security requirements of a mobile device management system. Int. J. Secur. Appl. 6(2), 353–358 (2012)

    Google Scholar 

  6. Rhee, K., Kim, H., Na, H.Y.: Security test methodology for an agent of a mobile device. Int. J. Secur. Appl. 6(2), 137–142 (2012)

    Google Scholar 

  7. Salazar, J.L., Tornos, J.L., Piles, J.J.: Efficient ways of prime number generation for ring signatures. IET Inf. Secur. 10(1), 33–36 (2016)

    Article  Google Scholar 

  8. Lee, W., Leung, C.K.S., Lee, J.J.: Mobile web navigation in digital ecosystems using rooted directed trees. IEEE Trans. Industr. Electron. 58(6), 2154–2162 (2011)

    Article  Google Scholar 

  9. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press (1991)

  10. Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press (1997)

  11. Atkin, A.O.L., Morain, F.: Elliptic curves and primality proving. Math. Comput. 61, 29–63 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  12. Edoh, K : Elliptic Curve Cryptography on PocketPCs. Int. J. Secur. Appl. 3(3) 23–34 (2009)

  13. Maurer, U.M.: Fast generation of prime numbers and secure public-key cryptographic parameters. J. Cryptol. 8(3), 123–155 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  14. Miller, G.L.: Riemann’s hypothesis and tests for primality. J. Comput. Syst. Sci. (1976)

  15. Rabin, M.O.: Probabilistic algorithm for primality testing. J. Number Theory 12, 128–138 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  16. Solovay, R., Strassen, V.: A fast Monte-Carlo test for primality. SIAM J. Comput. 6, 84–85 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  17. Jo, Hosung, Park, Heejin: Probabilistic analysis on JPV algorithm and improving it using GCD function. Appl. Math. Comput. Sci. 9(2L), 535–542 (2015)

  18. Scott, M.: Miraclmultiprecision Integer and Rational Arithmetic c/c++ Library. Shamus Software Ltd, Dublin, Ireland. http://www.shamus.ie/ (2003)

  19. Enck, W., et al.: A Study of Android Application Security. USENIX Security Symposium, vol. 2 (2011)

Download references

Acknowledgements

This work was supported by the research fund of Signal Intelligence Research Center supervised by the Defense Acquisition Program Administration and the Agency for Defense Development of Korea.

Author information

Authors and Affiliations

  1. Institution of Software Convergence, Hanyang University, Seoul, Korea

    Hosung Jo

  2. Division of Computer Science and Engineering, Hanyang University, Seoul, Korea

    Heejin Park

Authors
  1. Hosung Jo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Heejin Park
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Heejin Park.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jo, H., Park, H. Fast prime number generation algorithms on smart mobile devices. Cluster Comput 20, 2167–2175 (2017). https://doi.org/10.1007/s10586-017-0992-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-017-0992-3

Keywords

Search

Navigation