Factoring polynomials over finite fields

Enver Ozdemir*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

In this paper, we describe a new polynomial factorization algorithm over finite fields with odd characteristics. The main ingredient of the algorithm is special singular curves. The algorithm relies on the extension of the Mumford representation and Cantor's algorithm to these special singular curves.

Original languageEnglish
Pages (from-to)1517-1536
Number of pages20
JournalInternational Journal of Number Theory
Volume17
Issue number7
DOIs
Publication statusPublished - Aug 2021

Bibliographical note

Publisher Copyright:
© 2021 World Scientific Publishing Company.

Keywords

  • finite fields
  • Hyperelliptic curves
  • Jacobian
  • Picard group
  • polynomial factorization

Fingerprint

Dive into the research topics of 'Factoring polynomials over finite fields'. Together they form a unique fingerprint.

Cite this