Cart (Loading....) | Create Account
Close category search window
 

Improved Polynomial Multiplication Formulas over $IF₂$ Using Chinese Remainder Theorem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Cenk, M. ; Dept. of Math. & Comput. Sci., Cankaya Univ., Ankara ; Ozbudak, F.

Let n and lscr be positive integers and f(x) be an irreducible polynomial over IF2 such that lscrdeg(f(x)) < 2n -1. We obtain an effective upper bound for the multiplication complexity of n-term polynomials modulo f(x)lscr. This upper bound allows a better selection of the moduli when Chinese Remainder Theorem is used for polynomial multiplication over IF2. We give improved formulae to multiply polynomials of small degree over IF2. In particular we improve the best known multiplication complexities over IF2 in the literature in some cases.

Published in:

Computers, IEEE Transactions on  (Volume:58 ,  Issue: 4 )

Date of Publication:

April 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.