PROBLEM TO BE SOLVED: To provide a method for increasing the ratio of computational complexity of discrete logarithm to computational complexity of prime factorization.;SOLUTION: A parameter setting device includes a condition setting unit, a prime number generation unit, and an integer generation unit. The condition setting unit determines the size of an integer N and the number R (R is ≥2) of prime factors so that the computational complexity for factorizing the integer N into prime factors may be smaller in the number field sieve method than in the elliptic curve method. The prime number generation unit generates, from the size of the integer N and the number R of prime factors, R prime numbers pr(r is an integer from 1 to R). The integer generation unit obtains the integer N from the prime number pr. The discrete logarithm-computing device receives the integer N, the prime numbers p1, ..., pR, an element g, and an element y as inputs, and finds out an integer x which satisfies y=gx. The discrete logarithm computing device includes a factor base computing unit and a group element computing unit.;COPYRIGHT: (C)2011,JPO&INPIT
展开▼
机译：解决的问题：提供一种增加离散对数的计算复杂度与素数分解的计算复杂度之比的方法。解决方案：参数设置设备包括条件设置单元，素数生成单元和整数生成单元。条件设置单元确定整数N的大小和素数的数量R（R为＆ge; 2），使得在数域筛选方法中将整数N分解为素数的计算复杂度可能比在数域筛选方法中小。椭圆曲线法。素数生成单元根据整数N的大小和素因数R生成R素数p r （r是1到R的整数）。整数生成单元从素数p r 获得整数N。离散对数计算设备接收整数N，质数p 1 ，...，p R ，元素g和元素y作为输入，并且找出满足y = g x 的整数x。离散对数计算设备包括一个基于因子的计算单元和一个组元素计算单元。版权所有：（C）2011，JPO＆INPIT
展开▼
