发明名称 MODULAR REDUCTION FOR A CRYPTOGRAPHIC PROCESS AND COPROCESSOR FOR CARRYING OUT SAID REDUCTION
摘要 The invention relates to a cryptographic method wherein, in order to carry out a fully polynomial division of type Q (x) = [U (x) / N (x)], wherein Q (x), N (x) and U(x) are polynomials, respectively a result, dividend and a divider, multiplication of the two polynomial is carried out followed by displacement of the bits of the result of the multiplication. The following operation is performed on the body of the polynomials Fp[x]: formula (I). The invention also enables more complex operations to be carried out, including modular operations. The invention is an alternative to the Montgomery method and does not need any correction. It is useful, in particular, for cryptographic methods wherein polynomial operations are carried out on the body F2[x]. The invention also relates to an appropriate coprocessor for carrying out said method. Preferred application: chip cards.
申请公布号 WO2005024627(A2) 申请公布日期 2005.03.17
申请号 WO2004FR50390 申请日期 2004.08.23
申请人 GEMPLUS;DHEM, JEAN-FRANCOIS 发明人 DHEM, JEAN-FRANCOIS
分类号 G06F7/72 主分类号 G06F7/72
代理机构 代理人
主权项
地址