会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 43. 发明公开
    • BERECHNUNG EINES ERGEBNISSES EINER MODULAREN MULTIPLIKATION
    • 计算模乘的结果
    • EP1499954A2
    • 2005-01-26
    • EP03727389.3
    • 2003-04-28
    • Infineon Technologies AG
    • FISCHER, WielandSEDLAK, HolgerSEIFERT, Jean-Pierre
    • G06F7/72
    • G06F7/722
    • The aim of the invention is to calculate a result of a modular multiplication of a first operand (A) and of a second operand (B) with regard to a modulus (N), said operands having a length of 2 n bits. To this end, the operands and the modulus are reduced into suboperands of half the length and are fed to a control device (14). Said control device controls an MMD device for performing a MultModDiv operation according to a predetermined step sequence with corresponding input operands (12a, 12b) and MMD moduli (12c) in order to obtain integral quotient values (Q(i)) and residual values (R(i)) with regard to the MMD modulus at an output (12d). A combining device (16) serves to combine integral quotient values and residual values from predetermined steps of the step sequence in order to obtain the result. Reducing a modular multiplication of operands e.g. the length of 2 n bits into a number of MMD operations with operands having a length of n bits, therefore half the length, enables cryptographic algorithms having long operands to be efficiently performed on an arithmetic-logic unit developed for shorter operands whereby increasing security demands in accordance with longer codes are efficiently fulfilled with the use of existing circuits.
    • 47. 发明授权
    • BERECHNUNG EINES ERGEBNISSES EINER MODULAREN MULTIPLIKATION
    • 计算模乘的结果
    • EP1499954B1
    • 2007-01-17
    • EP03727389.3
    • 2003-04-28
    • Infineon Technologies AG
    • FISCHER, WielandSEDLAK, HolgerSEIFERT, Jean-Pierre
    • G06F7/72
    • G06F7/722
    • The aim of the invention is to calculate a result of a modular multiplication of a first operand (A) and of a second operand (B) with regard to a modulus (N), said operands having a length of 2 n bits. To this end, the operands and the modulus are reduced into suboperands of half the length and are fed to a control device (14). Said control device controls an MMD device for performing a MultModDiv operation according to a predetermined step sequence with corresponding input operands (12a, 12b) and MMD moduli (12c) in order to obtain integral quotient values (Q ) and residual values (R ) with regard to the MMD modulus at an output (12d). A combining device (16) serves to combine integral quotient values and residual values from predetermined steps of the step sequence in order to obtain the result. Reducing a modular multiplication of operands e.g. the length of 2 n bits into a number of MMD operations with operands having a length of n bits, therefore half the length, enables cryptographic algorithms having long operands to be efficiently performed on an arithmetic-logic unit developed for shorter operands whereby increasing security demands in accordance with longer codes are efficiently fulfilled with the use of existing circuits.