Skip to main content
SpringerLink
Log in

Subquadratic Space-Complexity Parallel Systolic Multiplier Based on Karatsuba Algorithm and Block Recombination

  • Conference paper
  • First Online:
Genetic and Evolutionary Computing (GEC 2015)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 388))

Included in the following conference series:

  • International Conference on Genetic and Evolutionary Computing

  • 1607 Accesses

Abstract

Recently, high-performance elliptic curve cryptography has gained great attention for resource-constrained applications. In this paper, we use (a, b)-way Karatsuba algorithm to derive a new way of k-way Karatsuba algorithm and block recombination (KABR) approach. We have derived a new parallel systolic multiplication with subquadratic space complexity based on k-way KABR approach. By theoretical analysis, it is shown that the proposed structure using k-way BRKA has significantly less computation delay, less area-delay product, and less area. Moreover, the proposed structure can provide the desired tradeoff between space and time complexity.

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 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

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. Nangate standard cell library. http://www.si2.org/openeda.si2.org/projects/nangatelib/

  2. Public key cryptography for the financial services industry: The elliptic curve digital signature algorithm (ecdsa) (1999)

    Google Scholar 

  3. Digital signature standard (dss). Federal Information Processing Standards, Publication 186–2 (2000)

    Google Scholar 

  4. Cook, S.: On the minimum computation time of functions, master’s thesis, Harvard University (1966)

    Google Scholar 

  5. El Gamal, T.: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10–18. Springer, Heidelberg (1985)

    Google Scholar 

  6. Hasan, M.A., Meloni, N., Namin, A.H., Nègre, C.: Block recombination approach for subquadratic space complexity binary field multiplication based on toeplitz matrix-vector product. IEEE Trans. Computers 61, 151–163 (2012)

    Article  Google Scholar 

  7. Jain, S.K., Song, L., Parhi, K.K.: Efficient semisystolic architectures for finite-field arithmetic. IEEE Trans. VLSI Syst. 6, 101–113 (1998)

    Article  Google Scholar 

  8. Karatsuba, A.A., Ofman, Y.: Multiplication of multidigit numbers on automata. Soviet Physics Doklady 7, 595–596 (1963)

    Google Scholar 

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

    Article  Google Scholar 

  10. Lee, C.-Y., Meher, P.K.: Efficient bit-parallel multipliers over finite fields GF(2\({}^{\text{m}}\)). Computers & Electrical Engineering 36, 955–968 (2010)

    Article  MATH  Google Scholar 

  11. Lee, C.-Y., Meher, P.K.: Efficient subquadratic space complexity architectures for parallel MPB single- and double-multiplications for all trinomials using toeplitz matrix-vector product decomposition. IEEE Trans. on Circuits and Systems, 62-I (2015)

    Google Scholar 

  12. Lee, C.-Y., Meher, P.K.: Subquadratic space-complexity digit-serial multipliers over \(GF(2^m)\) using generalized (a, b)-way karatsuba algorithm. IEEE Trans. on Circuits and Systems 62-I (2015)

    Google Scholar 

  13. C.-Y. Lee, P. K. Meher, and C.-P. Chang, Efficient m-ary exponentiation over \(GF(2^m)\) using subquadratic ka-based three-operand montgomery multiplier. IEEE Trans. on Circuits and Systems 61-I, 3125–3134 (2014)

    Google Scholar 

  14. Lee, C.-Y., Meher, P. K., Lee, W.-Y.: Subquadratic space complexity digit-serial multiplier over binary extension fields using toom-cook algorithm. In: The International Symposium on Integrated Circuits (ISIC) (2014)

    Google Scholar 

  15. Lee, C.-Y., Yang, C.-S., Meher, B.K., Meher, P.K., Pan, J.-S.: Low-complexity digit-serial and scalable SPB/GPB multipliers over large binary extension fields using (b, 2)-way karatsuba decomposition. IEEE Trans. on Circuits and Systems 61-I, 3115–3124 (2014)

    Google Scholar 

  16. Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications, 2nd edn. Cambridge University Press (1997)

    Google Scholar 

  17. Montgomery, P.L.: Five, six, and seven-term karatsuba-like formulae. IEEE Trans. Computers 54, 362–369 (2005)

    Article  MATH  Google Scholar 

  18. Toom, A.L.: The complexity of a scheme of functional elements realizing the multiplication of integers. Soviet Mathematics Doklady 3, 714–716 (1963)

    Google Scholar 

  19. van der Hoeven, J., Lecerf, G.: On the complexity of multivariate blockwise polynomial multiplication. In: ISSAC 2012, pp. 211–218 (2012)

    Google Scholar 

  20. Xie, J., Meher, P.K., Mao, Z.: High-throughput finite field multipliers using redundant basis for FPGA and ASIC implementations. IEEE Trans. on Circuits and Systems 62-I, 110–119 (2015)

    Google Scholar 

  21. Xie, X.-N., Chen, G., Li, Y.: Novel bit-parallel multiplier for \(GF(2^m)\) defined by all-one polynomial using generalized karatsuba algorithm. Inf. Process. Lett. 114, 140–146 (2014)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lunghwa University of Science and Technology, Guishan, Taiwan

    Chiou-Yng Lee

  2. Chien Hsin University of Science and Technology, Taoyuan, Taiwan

    Che Wun Chiou

  3. Feng Chia University, Taichung, 40724, Taiwan

    Jim-Min Lin

Authors
  1. Chiou-Yng Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Che Wun Chiou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jim-Min Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chiou-Yng Lee .

Editor information

Editors and Affiliations

  1. Faculty of Engineering, University of Miyazaki, Miyazaki, Japan

    Thi Thi Zin

  2. School of Computer Science and Tech..., Harbin Institute of Technology, Shenzhen Graduate School , Shenzhen, China

    Jerry Chun-Wei Lin

  3. College of Information Science and Engg, Fujian University of Technology, Fuzhou, China

    Jeng-Shyang Pan

  4. Faculty of Engineering, University of Miyazaki, Miyazaki, Japan

    Pyke Tin

  5. Faculty of Engineering, University of Miyazaki, Miyazaki, Japan

    Mitsuhiro Yokota

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Lee, CY., Chiou, C.W., Lin, JM. (2016). Subquadratic Space-Complexity Parallel Systolic Multiplier Based on Karatsuba Algorithm and Block Recombination. In: Zin, T., Lin, JW., Pan, JS., Tin, P., Yokota, M. (eds) Genetic and Evolutionary Computing. GEC 2015. Advances in Intelligent Systems and Computing, vol 388. Springer, Cham. https://doi.org/10.1007/978-3-319-23207-2_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23207-2_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23206-5

  • Online ISBN: 978-3-319-23207-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation