会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明授权
    • Device and method for calculating conversion parameter of montgomery modular multiplication and program therefor
    • 用于计算montgomery模数乘法的转换参数的装置和方法及其程序
    • US07792893B2
    • 2010-09-07
    • US11230592
    • 2005-09-21
    • Kouichi ItohMasahiko TakenakaNaoya Torii
    • Kouichi ItohMasahiko TakenakaNaoya Torii
    • G06F7/38G06F7/00
    • G06F7/728
    • A method for calculating a conversion parameter of the Montgomery modular multiplication to improve the efficiency of software installation, comprising a first step for calculating H0=2v×R (mod n) (where v is an integer, v≧1, and (m×k)/v is an integer), a second step for calculating Hp=2v×2^p×R (mod n) from H0=2v×R (mod n) by repeating Hi=REDC(Hi−1, Hi−1)n with respect to i=1, 2, . . . , p (where p represents an integer satisfying the condition 2p≧(m×k)/v>2p−1, REDC represents the Montgomery modular multiplication REDC(a, b)n=a×b×R−1 (mod n), and x^i represents exponential computation xi); and a third step for calculating Hp=R2 (mod n) by calculating Hp=REDC(Hp, g)n with respect to Hp obtained in the second step when 2p>(m×k)/v (where g=2k×E(p,m,k), E(p, m, k)=2×m−(v×2p)/k) and finally outputting Hp as R2 (mod n).
    • 一种用于计算蒙哥马利乘积的转换参数以提高软件安装效率的方法,包括计算H0 = 2v×R(mod n)的第一步骤(其中v是整数,v≥1,(m× k)/ v是整数),通过重复Hi = REDC(Hi-1,Hi-1)从H0 = 2v×R(mod n)计算Hp = 2v×2 ^ p×R(mod n) )n相对于i = 1,2。 。 。 ,p(其中p表示满足条件2p≥(m×k)/ v> 2p-1的整数,REDC表示蒙哥马利模乘REDC(a,b)n = a×b×R-1(mod n) ,x ^ i表示指数计算xi); 以及第三步骤,当2p>(m×k)/ v(其中g = 2k×E)时,通过计算相对于在第二步骤中获得的Hp的Hp = REDC(Hp,g)n来计算Hp = R2(mod n) (p,m,k),E(p,m,k)= 2×m-(v×2p)/ k),最后输出Hp为R2(mod n)。
    • 8. 发明申请
    • Device and method for calculating conversion parameter of montgomery modular multiplication and program therefor
    • 用于计算montgomery模数乘法的转换参数的装置和方法及其程序
    • US20060235921A1
    • 2006-10-19
    • US11230592
    • 2005-09-21
    • Kouichi ItohMasahiko TakenakaNaoya Torii
    • Kouichi ItohMasahiko TakenakaNaoya Torii
    • G06F7/00
    • G06F7/728
    • A method for calculating a conversion parameter of the Montgomery modular multiplication to improve the efficiency of software installation, comprising a first step for calculating H0=2v×R (mod n) (where v is an integer, v≧1, and (m×k)/v is an integer), a second step for calculating Hp=2v×2p×R (mod n) from H0=2v×R (mod n) by repeating Hi=REDC(Hi-1, Hi-1)n with respect to i=1, 2, . . . , p (where p represents an integer satisfying the condition 2p≧(m×k)/v>2p−1, REDC represents the Montgomery modular multiplication REDC(a, b)n=a×b×R−1 (mod n), and xˆi represents exponential computation xi); and a third step for calculating Hp=R2 (mod n) by calculating Hp=REDC(Hp, g)n with respect to Hp obtained in the second step when 2p>(m×k)/v (where g=2k×E(p,m,k), E(p, m, k)=2×m−(v×2p)/k) and finally outputting Hp as R2 (mod n).
    • 一种用于计算蒙哥马利模乘的转换参数以提高软件安装效率的方法,包括:计算第一步骤,用于计算H0 / (其中v是整数,v> = 1,并且(mxk)/ v是整数),用于计算H 2 p 2 = 2的第二步骤 -character-00001“he =”3.13mm“wi =”2.12mm“file =”US20060235921A1-20061019-P00900.TIF“alt =”custom character“img-content =”character“img-format =”tif“?> 通过重复H 1 = H(H(H)),H H 2(R 2) 相对于i = 1,2,...,i-1,H i-1,...,n)。 。 。 ,p(其中p表示满足条件2的整数p > =(mxk)/ v> 2 p-1,REDC表示蒙哥马利模乘乘法REDC(a, (mod n),xi表示指数计算,x i =Σ 以及用于通过计算H H p = H 2 H(H p p)来计算H H p P 2 / R 2(mod n)的第三步骤, (mxk)/ v(其中g = 0),其中g = (p,m,k),E(p,m,k)= 2xm-(vx2

      )/ k),最后输出H p 作为R 2(mod n)。