首页>
外国专利>
DISCRETE LOGARITHM PROCESSING DEVICE, CENTER DEVICE IN PUBLIC KEY CRYPTOSYSTEM, AND PROGRAM FOR DISCRETE LOGARITHM PROCESSING
DISCRETE LOGARITHM PROCESSING DEVICE, CENTER DEVICE IN PUBLIC KEY CRYPTOSYSTEM, AND PROGRAM FOR DISCRETE LOGARITHM PROCESSING
展开▼
机译:离散对数处理设备,公开密钥加密系统中的中心设备以及离散对数处理程序
展开▼
页面导航
摘要
著录项
相似文献
摘要
PROBLEM TO BE SOLVED: To make a scale of a table small when solving a discrete logarithm problem by Baby step/Giant step methods, and to reduce a frequency of referring to the table.;SOLUTION: The table describing candidates for values of (i) satisfying y g-i=Gi is created when defining (a) bit string of lower rank 2 bits of y g-1 as (a), and using (a) as an address. The table is made to describe two or more candidates for the values of (i) to each address, and the candidates for the values of (i) are described in the blank spaces on and after the address (a) when creating the table. When referring to the table, the candidates for the values of (i) until a blank arises starting with the address (a) are read out, and Gi is calculated, and what is coincident with y g-i is output as a value of (i).;COPYRIGHT: (C)2007,JPO&INPIT
展开▼
机译:解决的问题:用婴儿步/巨步方法求解离散对数问题时,使表的比例变小,并减少引用该表的频率。;解决方案:该表描述了(i )定义yg -1 Sup>的低位2位的(a)位字符串为(a)时,创建满足yg -i Sup> = G i Sup> ),并使用(a)作为地址。该表用于描述每个地址的(i)值的两个或多个候选项,创建表时,(i)值的候选项在地址(a)之上和之后的空格中描述。当参考该表时,读出直到从地址(a)开始出现空白为止的(i)值的候选项,并计算G i Sup>,并且与yg < Sup> -i Sup>作为(i)的值输出。;版权:(C)2007,JPO&INPIT
展开▼