首页> 外国专利> REMAINDER ARITHMETIC UNIT USING DEFINING POLYNOMIAL IN FINITE FIELD

REMAINDER ARITHMETIC UNIT USING DEFINING POLYNOMIAL IN FINITE FIELD

机译:有限域中定义多项式的余数算术单元

摘要

PROBLEM TO BE SOLVED: To execute a remainder calculation by a polynomial of a wider range by expandedly combining an efficient remainder calculation by means of a nondense polynomial such as a trinomial, a pentanomial, etc., and a method with respect to AOP. ;SOLUTION: A defining polynomial is selected by a selection means 1. For this purpose, when the degree of the defining polynomial is given, such a combination of (G, g) is sought (1) as satisfying G=gh concerning a nondense polynomial G (a polynomial in which the number of terms with coefficient of 1 is few) of a degree higher than (m) by at least 1. Using the combination (G, g), an arithmetic means 2 performs remainder calculation. A remainder (r) of a polynominal (f) by (g) can be obtained by r=(f mod G) mod g (2), when g is a factor of a nondense polynominal. In the formula, R=f mod G is efficiently obtainable by utilizing the fact that the polynomial G is of, and also, if (h) in G=gh has a low degree, the remainder (r) can easily be calculated.;COPYRIGHT: (C)2000,JPO
机译:解决的问题:通过利用诸如三项式,五项式等非密集多项式的有效余数计算以及关于AOP的方法,将有效的余数计算扩展组合,从而通过更宽范围的多项式执行余数计算。 ;解决方案:通过选择装置1选择一个定义多项式。为此,当给定定义多项式的次数时,寻求(G,g)的这种组合(1)满足G = gh关于无理多项式G(系数为1的项数少的多项式)的度数比(m)高至少1。使用组合(G,g),算术装置2进行余数计算。当g是非密集多项式的因数时,可以通过r =(f mod G)mod g(2)获得多项式(f)除以(g)的余数(r)。式中,通过利用多项式G为的事实可有效地获得R = f mod G,并且,如果G = gh中的(h)的度数较低,则可以容易地计算余数(r)。版权:(C)2000,日本特许厅

著录项

  • 公开/公告号JP2000148013A

    专利类型

  • 公开/公告日2000-05-26

    原文格式PDF

  • 申请/专利权人 FUJITSU LTD;

    申请/专利号JP19980325016

  • 申请日1998-11-16

  • 分类号G09C1/00;G06F7/72;

  • 国家 JP

  • 入库时间 2022-08-22 01:59:36

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号