会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • 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)。

    • 4. 发明授权
    • Modular arithmetic operation system
    • 模块化算术运算系统
    • US5499299A
    • 1996-03-12
    • US268435
    • 1994-06-30
    • Masahiko TakenakaNaoya ToriiTakayuki HasebeRyota Akiyama
    • Masahiko TakenakaNaoya ToriiTakayuki HasebeRyota Akiyama
    • G06F7/52G06F7/72G09C1/00H04L9/30G06F7/38
    • G06F7/728H04L9/302H04L2209/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进行校正。
    • 5. 发明授权
    • Encryption circuit
    • 加密电路
    • US07158638B2
    • 2007-01-02
    • US10034321
    • 2002-01-03
    • Souichi OkadaNaoya ToriiTomohiro HayashiChikahiro DeguchiYumi Fujiwara
    • Souichi OkadaNaoya ToriiTomohiro HayashiChikahiro DeguchiYumi Fujiwara
    • H04K1/04
    • H04L9/0631H04L2209/122H04L2209/24
    • An encryption circuit that reduces a scale of circuit and can achieve a certain level of high-speed processing in the implementation of the AES block cipher. A round processing unit comprises: a first Round Key Addition circuit that adds a round key value to input data; an intermediate register/Shift Row transformation circuit that temporarily stores the output of the first Round Key Addition circuit and executes Shift Row transformation; a Byte Sub transformation circuit into which the values of the intermediate register/Shift Row transformation circuit are inputted and which executes Byte Sub transformation; a second Round Key Addition circuit into which the values of the intermediate register/Shift Row transformation circuit are inputted and which adds round key values; a Mix Column transformation circuit that executes Mix Column transformation upon the outputs of the second Round Key Addition circuit; and a second selector that outputs to the second Round Key Addition circuit one of the outputs of a first selector, the intermediate register/Shift Row transformation circuit, the Byte Sub transformation circuit, and the Mix Column transformation circuit.
    • 一种减少电路规模的加密电路,可在实现AES块密码时实现一定程度的高速处理。 圆处理单元包括:向输入数据添加循环密钥值的第一循环密钥加法电路; 中间寄存器/移位行变换电路,暂时存储第一循环密钥加法电路的输出,并执行移位行变换; 输入中间寄存器/移位行变换电路的值并执行Byte Sub变换的字节子变换电路; 第二循环密钥加法电路,其中输入中间寄存器/移位行变换电路的值,并加上循环键值; 混合列变换电路,对第二循环密钥加法电路的输出执行混合列变换; 以及第二选择器,其向第二圆形加法电路输出第一选择器,中间寄存器/移位行变换电路,字节子变换电路和混合列变换电路的输出之一。
    • 9. 发明授权
    • Encryption communication system
    • 加密通信系统
    • US5325433A
    • 1994-06-28
    • US41453
    • 1993-04-02
    • Naoya ToriiTakayuki HasebeRyota Akiyama
    • Naoya ToriiTakayuki HasebeRyota Akiyama
    • G09C1/00H04L9/08H04L9/30H04L9/00
    • H04L9/083H04L9/0863
    • An encryption communication system including: a communication center having at least a key information generating unit for generating key generating information used for encryption communication; and a plurality of user computers, each interconnected by a plurality of paths through the communication center, and each having at least an encryption key generating unit and an encryption processing unit. The communication center generates the key generating information Z based on predetermined modulo arithmetic formula. The user computer sends a password PW to the communication center, receives the key generating information therefrom, and generates an encryption key K used between the user computer and another party's computer based on predetermined modulo arithmetic formula. Further, the communication center provides a plurality of modulus numbers to share prime numbers assigned to at least two paths between the user computer and the other party's computer, and between the user computer and another party's computer, so that is possible to reduce the number of prime numbers.
    • 一种加密通信系统,包括:至少具有用于生成用于加密通信的密钥生成信息的密钥信息生成单元的通信中心; 以及多个用户计算机,每个用户计算机通过通信中心的多个路径互连,并且每个用户计算机至少具有加密密钥生成单元和加密处理单元。 通信中心基于预定的模运算公式生成密钥生成信息Z。 用户计算机向通信中心发送密码PW,从其接收密钥生成信息,并且基于预定的模运算公式生成在用户计算机与另一方的计算机之间使用的加密密钥K. 此外,通信中心提供多个模数,以共享分配给用户计算机和另一方的计算机之间的至少两条路径的质数,以及用户计算机与另一方的计算机之间的素数,使得可以减少 质数。