首页>
外国专利>
Quasi- similar type one side the signature manner which uses tropistic function, the device and signature verification manner,
Quasi- similar type one side the signature manner which uses tropistic function, the device and signature verification manner,
展开▼
机译:准相似类型的一方使用回归函数的签名方式,设备和签名验证方式,
展开▼
页面导航
摘要
著录项
相似文献
摘要
PROBLEM TO BE SOLVED: To provide an electronic signature method which is not broken even when a quantum computer is realized by constituting electronic signature by using a homomorphic unidirectional function which is not based on number theory problems such as a problem of factorization into prime factors and a problem of discrete logarithms.;SOLUTION: When it s defined that f:A→B is a homomorphic unidirectional function (f(a×b)=f(a)×f(b) is satisfied, the function f can be easily calculated but the calculation of a function f-1 is difficult) and H:{0,1}*→{0,1}k (k is a security parameter) is a hash function, the electronic signature method is provided with a means for selecting xi element of A (i=1,..., k) at random, secretly storing the selected value as a secret key and disclosing Xi=f(xi) element of B (i=1,..., k) as a public key and a means for selecting ri element of A (i=1,..., k) at random for a message m, calculating (e1,..., ek)=H(f(r1),..., f(rk), m), calculating yi=ri×xiei, and outputting signature (f(r1),..., f(rk), y1,..., yk) for the message m.;COPYRIGHT: (C)2004,JPO
展开▼
机译:解决的问题:提供一种即使使用不基于数论问题(例如因数分解为质因数的问题)的同态单向函数构成电子签名来实现量子计算机的电子签名方法,也不会被破坏。解决方案:定义f:A→ B是同构单向函数(满足f(a× b)= f(a)× f(b)时,函数f可以为很容易计算,但是很难计算函数f -1 Sup>)和H:{0,1} *→ {0,1} k Sup>(k是安全性参数)是散列函数,该电子签名方法具有用于随机选择A(i = 1,...,k)的x i Sub>元素,并将所选择的值秘密存储为一个秘密密钥,并公开B(i = 1,...,k)的X i Sub> = f(x i Sub>)元素作为公共密钥,以及一种选择方法A(i = 1,...,k)的r i Sub>元素随机对于消息m,计算(e 1 Sub>,...,e k Sub>)= H(f(r 1 Sub>),... ,f(r k Sub>),m),计算y i Sub> = r i Sub>× x i Sub> ei Sup>,并输出签名(f(r 1 Sub>),...,f(r k Sub>),y 1 Sub> ,...,y k Sub>)表示消息m .;版权:(C)2004,JPO
展开▼