Skip to main content

Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation

  • Conference paper
Book cover Arithmetic of Finite Fields (WAIFI 2008)

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

Included in the following conference series:

Abstract

We study Dickson bases for binary field representation. Such a representation seems interesting when no optimal normal basis exists for the field. We express the product of two elements as Toeplitz or Hankel matrix vector product. This provides a parallel multiplier which is subquadratic in space and logarithmic in time.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ansari, B., Anwar Hasan, M.: Revisiting finite field multiplication using dickson bases. Technical report, University of Waterloo, Ontario, Canada (2007)

    Google Scholar 

  2. Dickson, L.E.: The analytic representation of substitutions on a power of a prime number of letters with a discussion of the linear group. Ann. of Math. 11, 161–183 (1883)

    Article  Google Scholar 

  3. Fan, H., Hasan, M.A.: A new approach to sub-quadratic space complexity parallel multipliers for extended binary fields. IEEE Trans. Computers 56(2), 224–233 (2007)

    Article  MathSciNet  Google Scholar 

  4. Fan, H., Hasan, M.A.: Subquadratic computational complexity schemes for extended binary field multiplication using optimal normal bases. In: IEEE Trans. Computers (2008)

    Google Scholar 

  5. Giorgi, P., Negre, C., Plantard, T.: Subquadratic binary field multiplier in double polynomial system. In: SECRYPT 2007, Barcelona, Spain (2007)

    Google Scholar 

  6. Lild, R., Mullen, G.L., Turnwald, G.: Dickson Polynomials. Pitman Monograpah and Survey n Pure and Applied Mathematic, vol. 65 (1993)

    Google Scholar 

  7. Mullin, R.C., Mahalanobis, A.: Dickson bases and finite fields. Technical report, Universite of Waterloo, Ontario (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Joachim von zur Gathen José Luis Imaña Çetin Kaya Koç

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hasan, M.A., Negre, C. (2008). Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation. In: von zur Gathen, J., Imaña, J.L., Koç, Ç.K. (eds) Arithmetic of Finite Fields. WAIFI 2008. Lecture Notes in Computer Science, vol 5130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69499-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69499-1_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69498-4

  • Online ISBN: 978-3-540-69499-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics