Skip to main content
SpringerLink
Log in

Prime Numbers and Its Applications in Security: Case Study

  • Conference paper
  • First Online:
ICCCE 2020

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 698))

  • 1559 Accesses

Abstract

Prime Numbers are the major building blocks in integer universe. Prime numbers play an important role in number theory and cryptography. With this unique nature of prime number, it is mainly used in security. Many security algorithms have used prime numbers because of their uniqueness. In this paper, we have discussed the importance of prime numbers and their application.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Stillwell J (2010) Mathematics and its history. Undergraduate texts in mathematics 3rd edn, p 40. Springer. ISBN 978-1-4419-6052-8

    Google Scholar 

  2. Horsley RS (1772) The sieve of eratosthenes. being an account of his method of finding all the prime numbers. Philos Trans (1683–1775) 62:327–347

    Google Scholar 

  3. Kraft JS., Washington LC (2014) Elementary number theory. Textbooks in mathematics, p 7. CRC Press. ISBN 978-1-4987-0269-0

    Google Scholar 

  4. Cossins D (2019) The call of the primes pp 38–41

    Google Scholar 

  5. Rosen, KH (2011) Elementary number theory and its application, 6th edn, p 368. Pearson. ISBN 978-0321500311

    Google Scholar 

  6. Li N (2010) Research on Diffie-Hellman key exchange protocol, vol 4, p 634. IEEE

    Google Scholar 

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

    Google Scholar 

  8. Weisstein EW (2003) Totient function. Wolfram Research Inc

    Google Scholar 

  9. Zralek B (2010) A deterministic version of Pollard’s p-1 algorithm. Math Comput 79:513–533

    Google Scholar 

  10. Sridokmai T, Prakancharoen S (2015) The homomorphic other property of paillier cryptosystem. In: 2015 international conference on science and technology (TICST), Pathum Thani, pp 356–359. https://doi.org/10.1109/ticst.2015.7369385

  11. Popa, RA, Redfield, CMS, Zeldovich, N, Balakrishnan, H (2011) CryptDB: protecting confidentiality with encrypted query processing. ISBN 978-1-4503-0977-6

    Google Scholar 

  12. Anggriane SM, Nasution SM, Azmi F (2016) Advanced e-voting system using paillierhomomorphic encryption algorithm. In: 2016 international conference on informatics and computing (ICIC), Mataram, pp. 338–342. https://doi.org/10.1109/iac.2016.7905741

  13. Elgamal T (1985) A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory IT-31(4):469–472

    Google Scholar 

  14. Schneier B (1996) Applied cryptography, 2nd edn, p 644. ISBN 0-471-11709-9

    Google Scholar 

  15. Bernstein DJ (2014) How to design an elliptic-curve signature system, 23 March 2014. The cr.yp.to blog

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, National Institute of Technology Karnataka, Surathkal, India

    Anshul Kumar Namdeo, Abhay Lomga & B. R. Chandavarkar

Authors
  1. Anshul Kumar Namdeo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abhay Lomga
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. B. R. Chandavarkar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anshul Kumar Namdeo .

Editor information

Editors and Affiliations

  1. BioAxis DNA Research Centre (P) Ltd., Hyderabad, India

    Amit Kumar

  2. Dynexsys, Sydney, NSW, Australia

    Stefan Mozar

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Namdeo, A.K., Lomga, A., Chandavarkar, B.R. (2021). Prime Numbers and Its Applications in Security: Case Study. In: Kumar, A., Mozar, S. (eds) ICCCE 2020. Lecture Notes in Electrical Engineering, vol 698. Springer, Singapore. https://doi.org/10.1007/978-981-15-7961-5_17

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-7961-5_17

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-7960-8

  • Online ISBN: 978-981-15-7961-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation