首页>
外国专利>
METHOD AND SYSTEM FOR SELECTING A SECURE PRIME FOR FINITE FIELD DIFFIE-HELLMAN
METHOD AND SYSTEM FOR SELECTING A SECURE PRIME FOR FINITE FIELD DIFFIE-HELLMAN
展开▼
机译:有限域Diffie-Hellman的安全素数选择方法和系统
展开▼
页面导航
摘要
著录项
相似文献
摘要
A method for a Diffie Hellman key exchange, the method including selecting a field size p in the form p=hq+1, where q is a prime number that is one plus a factorial number b, such that q=(b!+1), and h is a cofactor, such that p=hq+1 is prime; selecting a generator integer g whose order modulo p is the prime q or is divisible by q; choosing a private key x; computing a public key gx mod p by raising said generator g to the power of said private key x, using arithmetic modulo said prime field size p; sending said public key gx mod p to a correspondent; receiving, from the correspondent, a second public key B comprising g raised to a second private key y selected by the correspondent, in the form gy; and creating a key Bx from the received second public key B, by raising said second public key B to the power of said private key x, using arithmetic modulo said prime field size p.
展开▼
机译:一种用于Diffie Hellman密钥交换的方法,该方法包括选择形式为p = hq + 1的字段大小p,其中q是一个质数,该质数是1加上阶乘数b,使得q =(b!+1 ),h是一个辅因子,因此p = hq + 1是质数;选择一个生成器整数g,其阶数模p为质数q或可被q整除;选择私钥x;通过使用所述素数场大小p的算术模,通过将所述生成器g提高到所述私钥x的幂来计算公钥gx mod p;将所述公钥gx mod p发送给代理;从通讯者接收第二公钥B,该第二公钥B包括g,该g升至由通讯者选择的形式为gy的第二私钥y;通过使用所述素数字段大小p对所述第二公钥B提高到所述私钥x的幂,从接收到的第二公钥B创建密钥Bx。
展开▼