Skip to main content

New Approach of Solving Congruence Equation System

  • Conference paper
  • First Online:
Multimedia Communications, Services and Security (MCSS 2020)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1284))

  • 441 Accesses

Abstract

Nowadays in public key cryptography, some special basic algorithms are used. Extended Euclidian Algorithm and Chinese Remainder Theorem are the most spread basic algorithms with major contribution. Along the century’s mathematicians made a lot to improve these algorithm’s execution speed. In the paper, new approach of solving congruence equation system is presented.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Childs, L.N.: Applications of the chinese remainder theorem. In: Childs, L.N. (ed.) A Concrete Introduction to Higher Algebra. UTM, pp. 310–322. Springer, New York (1995). https://doi.org/10.1007/978-1-4419-8702-0_21

    Chapter  MATH  Google Scholar 

  2. van Tilborg, H.: Chinese remainder theorem. In: van Tilborg, H.C.A. (ed.) Encyclopedia of Cryptography and Security. Springer, Boston (2005). https://doi.org/10.1007/0-387-23483-7_58

    Chapter  MATH  Google Scholar 

  3. Tilborg, H.C.A.: Chinese remainder theorem. In: van Tilborg, H.C.A., Jajodia, S. (eds.) Encyclopedia of Cryptography and Security. Springer, Boston (2011). https://doi.org/10.1007/978-1-4419-5906-5

    Chapter  MATH  Google Scholar 

  4. Kangsheng, S.: Historical development of the Chinese remainder theorem. Arch. Hist. Exact Sci. 38, 285–305 (1988). https://doi.org/10.1007/BF00357063

    Article  MathSciNet  MATH  Google Scholar 

  5. Childs, L.: Chinese remainder theorem. In: Childs, L. (ed.) A Concrete Introduction to Higher Algebra. UTM. Springer, New York (2011). https://doi.org/10.1007/978-1-4684-0065-6_14

    Chapter  MATH  Google Scholar 

  6. Childs, L.N.: Chinese remainder theorem. In: Childs, L.N. (ed.) A Concrete Introduction to Higher Algebra. UTM. Springer, New York (2009). https://doi.org/10.1007/978-0-387-74725-5_12

    Chapter  MATH  Google Scholar 

  7. http://homepages.math.uic.edu/~leon/mcs425-s08/handouts/chinese_remainder.pdf

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nikolai T. Stoianov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ivanov, A.G., Stoianov, N.T. (2020). New Approach of Solving Congruence Equation System. In: Dziech, A., Mees, W., Czyżewski, A. (eds) Multimedia Communications, Services and Security. MCSS 2020. Communications in Computer and Information Science, vol 1284. Springer, Cham. https://doi.org/10.1007/978-3-030-59000-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-59000-0_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-58999-8

  • Online ISBN: 978-3-030-59000-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics