Polynomial Multiplication over Finite Fields using Field Extensions and Interpolation

Date

2009-06-10

Author

Cenk, Murat
Özbudak, Ferruh

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

73
views

0
downloads

A method for polynomial multiplication over finite fields using field extensions and polynomial interpolation is introduced. The proposed method uses polynomial interpolation as Toom-Cook method together with field extensions. Furthermore, the proposed method can be used when Toom-Cook method cannot be applied directly. Explicit formulae improving the previous results in many cases are obtained.

Subject Keywords

6-Term, 5-Term

URI

https://hdl.handle.net/11511/31716

DOI

https://doi.org/10.1109/arith.2009.11

Collections

Graduate School of Applied Mathematics, Conference / Seminar

Suggestions

OpenMETU
Core

Value sets of Lattes maps over finite fields Küçüksakallı, Ömer (Elsevier BV, 2014-10-01) We give an alternative computation of the value sets of Dickson polynomials over finite fields by using a singular cubic curve. Our method is not only simpler but also it can be generalized to the non-singular elliptic case. We determine the value sets of Lattes maps over finite fields which are rational functions induced by isogenies of elliptic curves with complex multiplication.
HFE based multi-variate quadratic cryptosystems and Dembowski Ostrom polynomials Alam, Bilal; Akyıldız, Ersan; Kırlar, Barış Bülent; Department of Cryptography (2013) Harayama and Friesen proposed linearised binomial attack for multivariate quadratic cryptosystems and introduced weak Dembowski Ostrom(DO) polynomials in this framework over the finite fi eld F2. They conjecture about the existence of infi nite class of weak DO polynomials and presented the open problem of enumerating their classes. We extend linearised binomial attack to multivariate quadratic cryptosystems over Fp for any prime p and redefi ne the weak DO polynomials for general case. We identify an in fi...
Additive polynomials and primitive roots over finite fields Özbudak, Ferruh (2001-01-01) We prove existence of primitive roots with a prescribed nonzero image using the arithmetic of algebraic function fields for a class of polynomials over sufficiently large finite fields.
Differential - Operator solutions for complex partial differential equations Celebi, O; Sengul, S (1998-07-10) The solutions of complex partial differential equations of order four are obtained by using polynomial differential operators. A correspondence principle is also derived for the solutions of two different differential equations, imposing conditions on the coefficients.
Knotting of algebraic curves in CP2 Finashin, Sergey (2002-01-01) For any k⩾3, I construct infinitely many pairwise smoothly non-isotopic smooth surfaces homeomorphic to a non-singular algebraic curve of degree 2k, realizing the same homology class as such a curve and having abelian fundamental group ⧹ . This gives an answer to Problem 4.110 in the Kirby list (Kirby, Problems in low-dimensional topology, in: W. Kazez (Ed.), Geometric Topology, AMS/IP Stud. Adv. Math. vol 2.2, Amer. Math. Soc., Providence, 1997).

Citation Formats

M. Cenk and F. Özbudak, “Polynomial Multiplication over Finite Fields using Field Extensions and Interpolation,” 2009, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/31716.