Skip to main content

7. More Algebra: Polynomials and Fields

  • Chapter
Primality Testing in Polynomial Time

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3000))

  • 1152 Accesses

Abstract

In preparation for the correctness proof of the deterministic primality test in Chap. 8, in this chapter we develop a part of the theory of polynomials over rings and fields, and study how fields arise from polynomial rings by calculating modulo an irreducible polynomial.

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.

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Dietzfelbinger, M. (2004). 7. More Algebra: Polynomials and Fields. In: Primality Testing in Polynomial Time. Lecture Notes in Computer Science, vol 3000. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25933-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25933-6_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40344-9

  • Online ISBN: 978-3-540-25933-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics