会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Encryption secured against DPA
    • 针对DPA的加密
    • US07386130B2
    • 2008-06-10
    • US10028265
    • 2001-12-28
    • Koichi ItoMasahiko TakenakaNaoya Torii
    • Koichi ItoMasahiko TakenakaNaoya Torii
    • H04L9/00H04K1/00
    • H04L9/003H04L2209/04H04L2209/12
    • The encryption device includes a random number generator for generating a random number; and a first selector for selecting one of q fixed values in response to the random number, a second selector for selecting one set of q sets of fixed S-box tables in response to the random number. An XOR XORs an input with an XOR of a key with the fixed value. A nonlinear transform transforms an input nonlinearly in accordance with the selected set of fixed S-box tables. Another encryption device includes a plurality of encrypting units coupled in parallel, and a selector for selecting one of the plurality of encrypting units in response to the random number. The masking with the fixed values improves the processing speed and reduces the required RAM area.
    • 加密装置包括用于产生随机数的随机数发生器; 以及第一选择器,用于响应于所述随机数来选择q个固定值之一;第二选择器,用于响应于所述随机数来选择一组q个固定S盒表。 异或运算具有固定值的键的XOR的输入。 非线性变换根据所选择的固定S盒表组非线性地变换输入。 另一个加密装置包括并行耦合的多个加密单元和用于响应于该随机数来选择多个加密单元之一的选择器。 具有固定值的屏蔽可提高处理速度,并减少所需的RAM区域。
    • 6. 发明授权
    • 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)。