会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • Modular reduction for a cryptographic process and corprocessor for carrying out said reduction
    • 用于进行所述减少的加密处理和合成处理器的模块化减少
    • US20070162530A1
    • 2007-07-12
    • US10570507
    • 2004-08-23
    • Jean-Francois Dhem
    • Jean-Francois Dhem
    • G06J1/00G06F7/52G06F7/38G06F7/50
    • G06F7/726H04L9/3066H04L9/3093H04L9/3252
    • 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 polynomials is carried out followed by displacement of the bits of the result of the multiplication. The operation is performed on the body of polynomials Fp[x]. The invention 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 the method.
    • 本发明涉及一种密码方法,其中为了执行类型Q(x)[U(x)/ N(x)]的完全多项式除法,其中Q(x),N(x)和U )分别是多项式,分别是结果,除数和除法器,执行两个多项式的乘法,随后是乘法结果的位的移位。 对多项式F> p [x]的主体进行操作。 本发明使得能够执行更复杂的操作,包括模块化操作。 本发明是Montgomery方法的替代方案,并且不需要任何校正。 特别地,对于在主体F 2 [x]上执行多项式操作的加密方法是有用的。 本发明还涉及一种用于执行该方法的适当的协处理器。