<--- Back to Details
First PageDocument Content
Polynomial / Fast Fourier transform / Euclidean algorithm / Primitive polynomial / Multiplication / Finite fields / Multiplication algorithm / Finite field arithmetic / Mathematics / Abstract algebra / Algebra
Date: 2003-12-18 08:51:43
Polynomial
Fast Fourier transform
Euclidean algorithm
Primitive polynomial
Multiplication
Finite fields
Multiplication algorithm
Finite field arithmetic
Mathematics
Abstract algebra
Algebra

Add to Reading List

Source URL: www.fi.muni.cz

Download Document from Source Website

File Size: 20,84 KB

Share Document on Facebook

Similar Documents

Efficient Finite Field and Elliptic Curve Arithmetic Laurent Imbert CNRS, LIRMM, Universit´ e Montpellier 2

DocID: 1tYe9 - View Document

Efficient Finite Field and Elliptic Curve Arithmetic Laurent Imbert CNRS, LIRMM, Universit´ e Montpellier 2

DocID: 1tRgZ - View Document

Algorithms for finite field arithmetic Éric Schost (joint with Luca De Feo & Javad Doliskani) Western University → University of Waterloo July 9, 2015

DocID: 1sekh - View Document

Mathematics / Algebra / Polynomials / Computer algebra / Arithmetic / Multiplication / Multiplication algorithm / Factorization / Polynomial / Finite field arithmetic / Montgomery modular multiplication / Finite field

Fast Arithmetic for Triangular Sets: from Theory to Practice Xin Li ORCCA, University of Western Ontario (UWO)

DocID: 1qeh3 - View Document

Algebra / Mathematics / Polynomials / Computer algebra / Abstract algebra / Irreducible polynomial / Polynomial / Finite fields / Polynomial decomposition / Finite field arithmetic

MINISTRY OF EDUCATION AND SCIENCE OF THE REPUBLIC OF KAZAKHSTAN COMMITTEE OF SCIENCE INSTITUTE OF INFORMATION AND COMPUTATIONAL TECHNOLOGIES Information Security Laboratory

DocID: 1qcOI - View Document