Faster polynomial multiplication over finite fields using cyclotomic coefficient rings

Published 2019 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
Authors
Keywords
Polynomial multiplication, Finite field, Algorithm, Complexity bound, FFT
Journal
JOURNAL OF COMPLEXITY
Volume -, Issue -, Pages -
Publisher
Elsevier BV
Online
2019-04-05
DOI
10.1016/j.jco.2019.03.004

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.