首页> 外国专利> PUBLIC KEY CIPHERING METHOD AND PUBLIC KEY CIPHERING COMMUNICATION SYSTEM

PUBLIC KEY CIPHERING METHOD AND PUBLIC KEY CIPHERING COMMUNICATION SYSTEM

机译:公开密钥加密方法及公开密钥通信系统

摘要

PROBLEM TO BE SOLVED: To make difficulty of decoding equivalent to difficulty of factorization into prime factors, to attain definite decoding with additional information of a simple calculation and to attain high speed decoding. ;SOLUTION: A key generator 310 generates two primes p, q, to obtain n=pq, and a value (n) is registered in a public file device 110 as a ciphering key and the values p, q are stored in a decoder 320 as decoding keys. A ciphering device 210 uses the ciphering key (n) and a plain text M, a point C=(cx, cy) obtained doubling the plain text N=(mx, my) on an ellipse by2=x3+x(mad n) is used for a ciphered text and additional information (e) and the ciphered text are sent. A decoder 320 uses decoding keys p, q to apply a multiple of 1/2 to the ciphered text C on the ellipse by2=x3+x(mod p, q) to obtain objects M1(i=1-4). In this case, a formula of a solution of a quartic equation is used. The plain text M is selected by using the additional information (e) from the objects M1.;COPYRIGHT: (C)1997,JPO
机译:解决的问题:使解码的难度与分解为素因的难度相等,以简单的计算和附加信息实现确定的解码,并实现高速解码。 ;解决方案:密钥产生器310产生两个素数p,q,以获得n = pq,并且值(n)作为加密密钥被注册在公共文件设备110中,并且值p,q被存储在解码器320中作为解码键。加密装置210使用加密密钥(n)和明文M,将明文N =(2)加倍得到的点C =(c x ,c y )。使用 2 = x 3 + x(mad n)的椭圆上的m x ,m y )对于密文,则发送附加信息(e)和密文。解码器320使用解码键p,q将1/2乘以 2 = x 3 + x(mod p, q)获得对象M 1 (i = 1-4)。在这种情况下,使用四次方程的解的公式。通过使用附加信息(e)从对象M 1 中选择纯文本M。版权所有:(C)1997,JPO

著录项

  • 公开/公告号JPH09214482A

    专利类型

  • 公开/公告日1997-08-15

    原文格式PDF

  • 申请/专利权人 NIPPON TELEGR & TELEPH CORP NTT;

    申请/专利号JP19960016707

  • 发明设计人 KOYAMA KENJI;KUWAKADO SHUSUKE;

    申请日1996-02-01

  • 分类号H04L9/30;G09C1/00;

  • 国家 JP

  • 入库时间 2022-08-22 03:37:14

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号