专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20060093137A1 Elliptic curve cryptosystem apparatus, elliptic curve cryptosystem method, elliptic curve cryptosystem program and computer readable recording medium storing the elliptic curve cryptosystem program 有权
标题翻译：椭圆曲线密码系统装置，椭圆曲线密码系统方法，椭圆曲线密码系统程序和存储椭圆曲线密码系统程序的计算机可读记录介质
公开(公告)号：US20060093137A1
公开(公告)日：2006-05-04
申请号：US11311590
申请日：2005-12-16
申请人： Tetsuya Izu , Kouichi Itoh , Masahiko Takenaka , Naoya Torii
发明人： Tetsuya Izu , Kouichi Itoh , Masahiko Takenaka , Naoya Torii
IPC分类号： H04L9/30
CPC分类号： G06F7/725 , G06F2207/7223 , G06F2207/7228 , H04L9/003 , H04L9/3066 , H04L2209/08
摘要： An elliptic curve cryptosystem apparatus performing an elliptic curve cryptosystem process has a coordinate transforming unit for transforming coordinates (X:Y:Z) on a point P on an elliptic curve over a finite field GF(pˆm) to coordinates (r1×(X−s1):r2×(Y−s2):r3×(Z−s3)) (where, p is a prime number, m is an integer not less than 1, r1, r2 and r3 are integers not less than 1 and not larger than (p−1), s1, s2 and s3 are integer not less than 0 and not larger than (p−1), and a code “ˆ” represents power), and a scalar multiplication operating unit for performing scalar multiplication on the point on the elliptic curve transformed by the coordinate transforming unit, wherein at least one of the parameters s1, s2 and s3 has a value other than 0. The apparatus can perform the scalar multiplication in the elliptic curve cryptosystem, with resistance to side channel attacks.
摘要翻译：执行椭圆曲线密码系统处理的椭圆曲线密码系统装置具有坐标变换单元，用于将有限域GF（pm）上的椭圆曲线上的点P上的坐标（X：Y：Z）变换为坐标（r1x（X-s1 ）：r2x（Y-s2）：r3x（Z-s3））（其中，p是质数，m是不小于1的整数，r1，r2和r3是不小于1且不大于 p-1），s1，s2和s3是不小于0且不大于（p-1）的整数，代码“”表示功率），以及标量乘法运算单元，用于对该点上的点进行标量乘法由坐标变换单元变换的椭圆曲线，其中，参数s1，s2和s3中的至少一个具有不同于0的值。该装置可以执行椭圆曲线密码系统中具有抗侧信道攻击的标量乘法。

2. 发明申请

US20050152541A1 Tamper-proof elliptic encryption with private key 有权
标题翻译：具有私钥的防篡改椭圆加密
公开(公告)号：US20050152541A1
公开(公告)日：2005-07-14
申请号：US11045111
申请日：2005-01-31
申请人： Masahiko Takenaka , Tetsuya Izu , Kouichi Itoh , Naoya Torii
发明人： Masahiko Takenaka , Tetsuya Izu , Kouichi Itoh , Naoya Torii
IPC分类号： G06F7/72 , G09C1/00 , H04K1/00 , H04L9/30
CPC分类号： G06F7/725 , G06F2207/7223
摘要： An encryption device (FIG. 15) performs elliptic curve encryption using a secret key. The encryption device includes: operation means (ECDBL, ECADD) for performing scalar multiplication of a point on an elliptic curve; storage (T[0]-T[2]) having a plurality of data storing areas; and means (SEL) for determining, in accordance with a bit sequence of a given value (d) and with a random value (RNG), an address of one of the plurality of data storage areas that is to be coupled to the operation means for each scalar multiplication.
摘要翻译：使用秘密密钥进行加密装置（图15

3. 发明授权

US07639808B2 Elliptic curve cryptosystem apparatus, elliptic curve cryptosystem method, elliptic curve cryptosystem program and computer readable recording medium storing the elliptic curve cryptosystem program 有权
标题翻译：椭圆曲线密码系统装置，椭圆曲线密码系统方法，椭圆曲线密码系统程序和存储椭圆曲线密码系统程序的计算机可读记录介质
公开(公告)号：US07639808B2
公开(公告)日：2009-12-29
申请号：US11311590
申请日：2005-12-16
申请人： Tetsuya Izu , Kouichi Itoh , Masahiko Takenaka , Naoya Torii
发明人： Tetsuya Izu , Kouichi Itoh , Masahiko Takenaka , Naoya Torii
IPC分类号： H04K1/00 , H04L9/32
CPC分类号： G06F7/725 , G06F2207/7223 , G06F2207/7228 , H04L9/003 , H04L9/3066 , H04L2209/08
摘要： An elliptic curve cryptosystem apparatus performing an elliptic curve cryptosystem process has a coordinate transforming unit for transforming coordinates (X:Y:Z) on a point P on an elliptic curve over a finite field GF(p^m) to coordinates (r1×(X−s1):r2×(Y−s2):r3×(Z−s3)) (where, p is a prime number, m is an integer not less than 1, r1, r2 and r3 are integers not less than 1 and not larger than (p−1), s1, s2 and s3 are integer not less than 0 and not larger than (p−1), and a code “^” represents power), and a scalar multiplication operating unit for performing scalar multiplication on the point on the elliptic curve transformed by the coordinate transforming unit, wherein at least one of the parameters s1, s2 and s3 has a value other than 0. The apparatus can perform the scalar multiplication in the elliptic curve cryptosystem, with resistance to side channel attacks.
摘要翻译：执行椭圆曲线密码系统处理的椭圆曲线密码系统装置具有坐标变换单元，用于将有限域GF（p ^ m）上的椭圆曲线上的点P上的坐标（X：Y：Z）变换为坐标（r1x（X -s1）：r2x（Y-s2）：r3x（Z-s3））（其中，p是素数，m是不小于1的整数，r1，r2和r3是不小于1且不大于（p-1），s1，s2和s3是不小于0且不大于（p-1）的整数，代码“^”表示功率），以及标量乘法运算单元，用于对指向由坐标变换单元变换的椭圆曲线，其中参数s1，s2和s3中的至少一个具有不为0的值。该装置可以执行椭圆曲线密码系统中的标量乘法，具有抗侧信道攻击。

4. 发明授权

US07536011B2 Tamper-proof elliptic encryption with private key 有权
标题翻译：具有私钥的防篡改椭圆加密
公开(公告)号：US07536011B2
公开(公告)日：2009-05-19
申请号：US11045111
申请日：2005-01-31
申请人： Masahiko Takenaka , Tetsuya Izu , Kouichi Itoh , Naoya Torii
发明人： Masahiko Takenaka , Tetsuya Izu , Kouichi Itoh , Naoya Torii
IPC分类号： H04L9/00 , H04L9/28 , H04L9/30
CPC分类号： G06F7/725 , G06F2207/7223
摘要： An encryption device performs elliptic curve encryption using a secret key. The encryption device includes an operation unit for performing scalar multiplication of a point on an elliptic curve a storage unit having a plurality of data storing areas and a determiner unit for determining, in accordance with a bit sequence of a given value (d) and with a random value (RNG), an address of one of the plurality of data storage areas that is to be coupled to the operation means for each scalar multiplication.
摘要翻译：加密装置使用密钥执行椭圆曲线加密。加密装置包括用于执行椭圆曲线上的点的标量相乘的操作单元，具有多个数据存储区域的存储单元和确定单元，用于根据给定值（d）的位序列和与随机值（RNG），用于每个标量乘法的要耦合到操作装置的多个数据存储区域之一的地址。

5. 发明申请

US20070177721A1 Tamper-proof elliptic encryption with private key 审中-公开
标题翻译：具有私钥的防篡改椭圆加密
公开(公告)号：US20070177721A1
公开(公告)日：2007-08-02
申请号：US11272916
申请日：2005-11-15
申请人： Kouichi Itoh , Tetsuya Izu , Masahiko Takenaka , Naoya Torii
发明人： Kouichi Itoh , Tetsuya Izu , Masahiko Takenaka , Naoya Torii
IPC分类号： H04L9/28
CPC分类号： G06F7/725 , G06F7/723 , G06F2207/7223 , G06F2207/7228 , G06F2207/7233 , G06F2207/7238 , G06F2207/7261 , H04L9/003 , H04L9/3066 , H04L2209/08 , H04L2209/127
摘要： An encryption device (10) for performing elliptic encryption processing with a private key, includes: randomizing means (16) for setting, into an initial elliptic point V0, an elliptic point R on an elliptic curve that is generated in accordance with a random value; operation means (20) for performing a first operation of summing the initial elliptic point V0 and a scalar multiple of a particular input elliptic point A on the elliptic curve, V1=V0+dA, in accordance with a bit sequence of a particular scalar value d for the elliptic encryption processing; de-randomizing means (22) for performing a second operation of subtracting the initial elliptic point V0 from the sum V1 determined by the first operation, V=V1−V0; and means (24) for providing, as an output, the elliptic point V determined by the de-randomization unit.
摘要翻译：一种用于利用私钥执行椭圆加密处理的加密装置（10），包括：随机化装置（16），用于将椭圆曲线R中的椭圆点R设置为椭圆曲线上的椭圆点R，根据随机值生成; 操作装置（20），用于执行将初始椭圆点V 0 0和/或椭圆曲线V 1上的特定输入椭圆点A的标量倍相加的第一操作，根据用于椭圆加密处理的特定标量值d的比特序列，V = 0＆lt; 0＆gt; + dA; 去随机化装置（22），用于执行从由第一操作确定的和V 1中减去初始椭圆点V 0 <0>的第二操作，V = V _{1 0 以及用于提供由去随机化单元确定的椭圆点V作为输出的装置（24）。}

6. 发明申请

US20060235921A1 Device and method for calculating conversion parameter of montgomery modular multiplication and program therefor 有权
标题翻译：用于计算montgomery模数乘法的转换参数的装置和方法及其程序
公开(公告)号：US20060235921A1
公开(公告)日：2006-10-19
申请号：US11230592
申请日：2005-09-21
申请人： Kouichi Itoh , Masahiko Takenaka , Naoya Torii
发明人： Kouichi Itoh , Masahiko Takenaka , Naoya Torii
IPC分类号： G06F7/00
CPC分类号： 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 =＆Sigma; 以及用于通过计算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）。

7. 发明授权

US07792893B2 Device and method for calculating conversion parameter of montgomery modular multiplication and program therefor 有权
标题翻译：用于计算montgomery模数乘法的转换参数的装置和方法及其程序
公开(公告)号：US07792893B2
公开(公告)日：2010-09-07
申请号：US11230592
申请日：2005-09-21
申请人： Kouichi Itoh , Masahiko Takenaka , Naoya Torii
发明人： Kouichi Itoh , Masahiko Takenaka , Naoya Torii
IPC分类号： G06F7/38 , G06F7/00
CPC分类号： 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. 发明授权

US07065788B2 Encryption operating apparatus and method having side-channel attack resistance 有权
标题翻译：具有侧信道攻击阻力的加密操作装置和方法
公开(公告)号：US07065788B2
公开(公告)日：2006-06-20
申请号：US10278838
申请日：2002-10-24
申请人： Jun Yajima , Kouichi Itoh , Masahiko Takenaka , Naoya Torii
发明人： Jun Yajima , Kouichi Itoh , Masahiko Takenaka , Naoya Torii
IPC分类号： G06F1/24
CPC分类号： G06F7/723 , G06F7/728 , G06F2207/7238
摘要： Ciphertext X and a constant C having relationships C>p and C>q with respect to secret keys p and q are input, and correction values C−dp and C−dq (dp=d mod (p−1), dq=d mod (q−1)) are obtained. Then, the ciphertext X is multiplied by the constant C. A remainder operation using the secret key p or q as a remainder value is conducted with respect to the multiplication result. A modular exponentiation operation based on a Chinese remainder theorem is conducted with respect to the remainder operation result, and a correction operation using a correction value C−dp or C−dq is conducted. Thereafter, plaintext Y before being encrypted is calculated.
摘要翻译：输入密文X和关于秘密密钥p和q具有关系C> p和C> q的常数C，并且校正值C SUP和D D < （dp = d mod（p-1），dq = d mod（q-1））。然后，将密文X乘以常数C.使用秘密密钥p或q作为余数值的余数运算相对于相乘结果进行。对余数运算结果进行基于中文余数定理的模幂运算，使用校正值C -dp或C-Dq 的修正运算是进行。此后，计算加密前的明文Y。

9. 发明授权

US5499299A Modular arithmetic operation system 失效
标题翻译：模块化算术运算系统
公开(公告)号：US5499299A
公开(公告)日：1996-03-12
申请号：US268435
申请日：1994-06-30
申请人： Masahiko Takenaka , Naoya Torii , Takayuki Hasebe , Ryota Akiyama
发明人： Masahiko Takenaka , Naoya Torii , Takayuki Hasebe , Ryota Akiyama
IPC分类号： G06F7/52 , G06F7/72 , G09C1/00 , H04L9/30 , G06F7/38
CPC分类号： G06F7/728 , H04L9/302 , H04L2209/12
摘要： A modular arithmetic unit comprises an input register, a multiple computing section, an adder, and a correcting section. There is provided a multiple table in which multiples of a modulo N are stored to correspond with low-order some bits of an input number T in the input register. The low-order some bits of the input number T are used to look up its corresponding multiple of the modulo N in the multiple table. The adder adds the multiple of the modulo N retrieved from the multiple table and the contents of the input register. This addition is performed n times. The contents of the input register are updated with high-order predetermined bits of the sum in the adder each time addition is performed in the adder. The correcting section makes a correction on the result t of addition by the adder after n additions have been performed.
摘要翻译：模数运算单元包括输入寄存器，多运算单元，加法器和校正单元。提供了一个多表，其中存储了模N的倍数以与输入寄存器中的输入号T的低位一些比特相对应。输入数字T的低位一些位用于查找多表中模N的对应倍数。加法器将从多表中检索出的模N的倍数和输入寄存器的内容相加。这个加法执行了n次。在加法器中每次添加时，在加法器中的和的高位预定位更新输入寄存器的内容。在执行了n次加法之后，校正部分对加法器的加法结果t进行校正。

10. 发明授权

US06330332B1 Prime number generation apparatus B-smoothness judgement apparatus and computer memory product 失效
标题翻译：主号生成装置B平滑判断装置和计算机存储器产品
公开(公告)号：US06330332B1
公开(公告)日：2001-12-11
申请号：US09037853
申请日：1998-03-10
申请人： Koichi Itoh , Kazuhiro Yokoyama , Naoya Torii , Masahiko Takenaka
发明人： Koichi Itoh , Kazuhiro Yokoyama , Naoya Torii , Masahiko Takenaka
IPC分类号： H04L900
CPC分类号： G06F7/72 , G06F17/10 , G06F2207/7204 , H04L9/002 , H04L9/3033 , H04L2209/08
摘要： One or a plurality of prime numbers pi which are generated and a generated random number are used to calculate a larger prime number candidate, and a judgment is made as to whether or not the prime number candidate is a prime number by using a provable prime number judging method, and when the judgment is made that the candidate is a prime number, the prime number p is outputted. As for at least three polynomials F(p) which are factors of ps−1 (s: arbitrary natural number) by a prime number p, a measure against prime factorization is taken. Moreover, when the prime number p is used for a secret key of RSA cryptosystem, a strong prime number p against the iterated-encryption attack on RSA cryptosystem is generated.
摘要翻译：使用生成的一个或多个素数pi和生成的随机数来计算较大的素数候选，并且通过使用可证明的素数来确定素数候选是否是素数判断方法，当判断候选者是质数时，输出质数p。对于素数p为ps-1（s：任意自然数）的因子的至少三个多项式F（p），采用针对素因子分解的度量。此外，当素数p用于RSA密码系统的秘密密钥时，产生对RSA密码系统的迭代加密攻击的强素数p。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式