首页>
外国专利>
PARAMETER GENERATING APPARATUS, CRYPTOGRAPHIC KEY CREATING DEVICE, AND THOSE METHODS AND PROGRAM
PARAMETER GENERATING APPARATUS, CRYPTOGRAPHIC KEY CREATING DEVICE, AND THOSE METHODS AND PROGRAM
展开▼
机译：参数生成设备，密码学密钥创建设备以及这些方法和程序
展开▼
页面导航
摘要
著录项
相似文献
摘要
PROBLEM TO BE SOLVED: To efficiently specify an integer x which is an element x of a set g in a discrete logarithm x≡ga(mod N) with a composite number N as a modulus.;SOLUTION: A prime number power creating section 111 creates a prime number power qj(j=1, ..., s) in which gcd(ϕ(qv), ϕ(qw))=2 for all v and w (1≤vw≤s). A generator creating section 112 creates for all j, an integer g which is the generator of an integer set {Zqj× (where a suffix qj stands for qj)} which is 0 or more, and less than qj in which g mod qj is mutually prime with the prime number power qj. A composite number creating section 113 calculates the composite number N (N=Πj=1sqj) which is a product of all prime number power qj created by the prime number power creating section 111.;COPYRIGHT: (C)2007,JPO&INPIT
展开▼
机译：解决的问题：为了有效地指定整数x，它是离散对数x＆g a （mod N）中的集合的元素x，其模数为N。 ;解决方案：素数幂创建部分111创建素数幂q j （j = 1，...，s）其中gcd（＆phiv;（q v ），对于所有v和w（1＆le; v w ））= 2。生成器创建部分112为所有j创建整数g，该整数g是整数集{Zqj ＆times; （其中后缀qj代表q j ）的生成器）}等于或大于0且小于q j ，其中g mod q j 与质数幂q j 互质。合成数创建部分113计算作为所有乘积的合成数N（N =＆Pi; j = 1 s q j ）质数幂创建部分111创建的质数幂q j 。版权所有：（C）2007，JPO＆INPIT
展开▼
