Accelerated Modular Multiplication Algorithm of Large Word Length Numbers with a Fixed Module | SpringerLink
Skip to main content
Springer Nature Link
Log in

Accelerated Modular Multiplication Algorithm of Large Word Length Numbers with a Fixed Module

  • Conference paper
Knowledge Management, Information Systems, E-Learning, and Sustainability Research (WSKS 2010)

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

Included in the following conference series:

Abstract

A new algorithm is proposed for the software implementation of modular multiplication, which uses pre-computations with a constant module. The developed modular multiplication algorithm provides high performance in comparison with the already known algorithms, and is oriented at the variable value of the module, especially with the software implementation on micro controllers and smart cards with a small number of bits.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 11439
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 14299
Price includes VAT (Japan)
  • 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  • Bosselaers, A., Govaerts, R., Vandewalle, J.: Comparison of three modular reduction functions. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 175–186. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  • Dhem, J.-F., Quisquater, J.-J.: Resent results on modular multiplications for smart cards. In: Schneier, B., Quisquater, J.-J. (eds.) CARDIS 1998. LNCS, vol. 1820, pp. 350–366. Springer, Heidelberg (2000)

    Google Scholar 

  • Hars, L.: Long Modular multiplication for Cryptographic Applications. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol. 3156, pp. 45–61. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  • Hong, S.M., Oh, S.Y., Yoon, H.: New modular multiplication algorithms for fast modular exponentiation. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 166–177. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  • Menezer, A.J., Van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)

    MATH  Google Scholar 

  • Montgommery, P.L.: Modular multiplication without trial division. Mathematics of Computation 44, 519–521 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  • Barrett, P.: Implementing the River Shamir and Adleman public key encryption algorithm on a standard digital signal processor. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 311–323. Springer, Heidelberg (1987)

    Chapter  Google Scholar 

  • Cohen, H.: A Course in Computational Algebraic Number Theory, 2nd edn. Graduate Texts in Mathematics. Springer, Heidelberg (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics &, Telecommunications - Net Media Lab, Terma Patriarchou Grigoriou & Neapoleos, National Centre for Scientific Research ”Demokritos”, 27, Ag.Paraskevi, Athens, 15310, Greece

    N. G. Bardis, A. Drigas & I. Vrettaros

  2. Department of Mathematics and Engineering Science, Hellenic Army Academy, Vari, Greece

    N. G. Bardis

  3. Department of Computer Engineering, National Technical University of Ukraine, 37, Peremohy, pr. Kiev 252056, KPI, 2003, Ukraine

    A. P. Markovskyy

Authors
  1. N. G. Bardis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Drigas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. P. Markovskyy
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. I. Vrettaros
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The American College of Greece, Aghia Paraskevi, Athens, Greece

    Miltiadis D. Lytras

  2. University of Oviedo, Spain

    Patricia Ordonez De Pablos

  3. Bar-Ilan University, Ramat Gan, Israel

    Adrian Ziderman

  4. De Montfort University, Leicester, UK

    Alan Roulstone

  5. Institute for Information Systems and Computer Media, Graz University of Technology, Inffeldgasse 16, 8010, Graz, Austria

    Hermann Maurer

  6. Wellesley College, Wellesley, MA, USA

    Jonathan B. Imber

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bardis, N.G., Drigas, A., Markovskyy, A.P., Vrettaros, I. (2010). Accelerated Modular Multiplication Algorithm of Large Word Length Numbers with a Fixed Module. In: Lytras, M.D., Ordonez De Pablos, P., Ziderman, A., Roulstone, A., Maurer, H., Imber, J.B. (eds) Knowledge Management, Information Systems, E-Learning, and Sustainability Research. WSKS 2010. Communications in Computer and Information Science, vol 111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16318-0_73

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16318-0_73

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16317-3

  • Online ISBN: 978-3-642-16318-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation