First Page | Document Content | |
---|---|---|
![]() Date: 2003-12-18 08:51:43Polynomial Fast Fourier transform Euclidean algorithm Primitive polynomial Multiplication Finite fields Multiplication algorithm Finite field arithmetic Mathematics Abstract algebra Algebra | Source URL: www.fi.muni.czDownload Document from Source WebsiteFile Size: 20,84 KBShare Document on Facebook |
![]() | Efficient Finite Field and Elliptic Curve Arithmetic Laurent Imbert CNRS, LIRMM, Universit´ e Montpellier 2DocID: 1tYe9 - View Document |
![]() | Efficient Finite Field and Elliptic Curve Arithmetic Laurent Imbert CNRS, LIRMM, Universit´ e Montpellier 2DocID: 1tRgZ - View Document |
![]() | Algorithms for finite field arithmetic Éric Schost (joint with Luca De Feo & Javad Doliskani) Western University → University of Waterloo July 9, 2015DocID: 1sekh - View Document |
![]() | Fast Arithmetic for Triangular Sets: from Theory to Practice Xin Li ORCCA, University of Western Ontario (UWO)DocID: 1qeh3 - View Document |
![]() | MINISTRY OF EDUCATION AND SCIENCE OF THE REPUBLIC OF KAZAKHSTAN COMMITTEE OF SCIENCE INSTITUTE OF INFORMATION AND COMPUTATIONAL TECHNOLOGIES Information Security LaboratoryDocID: 1qcOI - View Document |