Skip to main content
SpringerLink
Log in

Design of Parallel Pipelined Algorithm for Field Arithmetic Architecture Based on Cellular Array

  • Conference paper
Grid and Pervasive Computing (GPC 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7861))

Included in the following conference series:

  • 1990 Accesses

Abstract

In this study, we present an efficient finite field arithmetic algorithm for multiplication which is a core algorithm for division and exponentiation operations. In order to obtain a dedicated pipelined algorithm, we adopt Montgomery algorithm and cellular systolic array. First of all, we select an effective Montgomery factor for the design of our parallel algorithm, then we induce an efficient multiplication algorithm from the typical binary MM algorithm using the factor. In this paper, we show the detail derivation process in order to obtain the recursive equations for pipelined computation.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hariri, A., Reyhani-Masoleh, A.: Concurrent Error Detection in Montgomery Multiplication over Binary Extension Fields. IEEE Trans. Computers 60(9), 1341–1353 (2011)

    Article  MathSciNet  Google Scholar 

  2. Jeon, J.C., Yoo, K.Y.: Montgomery exponent architecture based on programmable cellular automata. Mathematics and Computers in Simulation 79, 1189–1196 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  3. Montgomery, P.: Modular Multiplication without Trial Division. Mathematics of Computation 44(170), 519–521 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  4. Koc, C., Acar, T.: Montgomery Multiplication in GF(2k). Designs, Codes and Cryptography 14(1), 57–69 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Lee, C.Y., Horng, J.S., Jou, I.C., Lu, E.H.: Low-Complexity Bit-Parallel Systolic Montgomery Multipliers for Special Classes of GF(2m). IEEE Transactions on Computers 54(9), 1061–1070 (2005)

    Article  Google Scholar 

  6. Hariri, A., Reyhani-Masoleh, A.: Concurrent Error Detection in Montgomery Multiplication over Binary Extension Fields. IEEE Trans. Computers 60(9), 1341–1353 (2011)

    Article  MathSciNet  Google Scholar 

  7. Huang, W.T., Chang, C.H., Chiou, C.W., Chou, F.H.: Concurrent error detection and correction in a polynomial basis multiplier over GF(2m). IET Information Security 4(3), 111–124 (2010)

    Article  Google Scholar 

  8. Kim, K.W., Jeon, J.C.: Finite Field Arithmetic Architecture Based on Cellular Array. Int’l Journal of Cyber-Security and Digital Forensics 1(2), 122–129 (2012)

    Google Scholar 

  9. Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications. Cambridge Univ. Press (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Software Science, Dankook University, Yongin, Korea

    Kee-Won Kim

  2. Department of Computer Engineering, Kumoh National Institute of Technology, Gumi, Korea

    Jun-Cheol Jeon

Authors
  1. Kee-Won Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jun-Cheol Jeon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Seoul University of Science and Technology (SeoulTech), 139-743, Seoul, Korea

    James J. (Jong Hyuk) Park

  2. Department of Computer Science, University of Georgia, 30602-7404, Athens, GA, USA

    Hamid R. Arabnia

  3. Department of Computer Science and Engineering, Sejong University, 143-747, Seoul, Korea

    Cheonshik Kim

  4. Department of Computer Science, Wayne State University, 48202, Detroit, MI, USA

    Weisong Shi

  5. School of Information Technology Engineering, Catholic University of Daegu, 712-702, Gyeongsan-si, Gyeongbuk, Korea

    Joon-Min Gil

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, KW., Jeon, JC. (2013). Design of Parallel Pipelined Algorithm for Field Arithmetic Architecture Based on Cellular Array. In: Park, J.J.(.H., Arabnia, H.R., Kim, C., Shi, W., Gil, JM. (eds) Grid and Pervasive Computing. GPC 2013. Lecture Notes in Computer Science, vol 7861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38027-3_107

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38027-3_107

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38026-6

  • Online ISBN: 978-3-642-38027-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation