首页> 外国专利> Algorithm of module exponentiation for protecting against decoding public key by producing variable i from 0 to k-1, which is the binary representation of lower weight Y(O) toward of larger weight bit Y(k-1)

Algorithm of module exponentiation for protecting against decoding public key by producing variable i from 0 to k-1, which is the binary representation of lower weight Y(O) toward of larger weight bit Y(k-1)

机译:通过产生从0到k-1的变量i来防止公钥解码的模块幂运算算法,这是权重较低的Y(O)向权重较大的Y(k-1)的二进制表示

摘要

For every Y(i) bit of a binary representation of Y, it is produced a variable i from 0 to k-1, which is the binary representation of a lower weight Y(O) toward the bit of weight strong Y(k-1). Z=Z2 operation is calculated and if I=0 it is performed R2=R1 asterisk Z or if I=1, it is calculated R1=R2 asterisk Z. Then Y(i)=O, then I remains unchanged and if Y(i)=1, then I is complemented. An Independent claim is included for: (a) an electronic terminal
机译:对于Y的二进制表示形式的每个Y(i)位,都会产生一个从0到k-1的变量i,它是权重强的Y(k- 1)。计算Z = Z <2>操作,如果I = 0,则执行R2 = R1星号Z;如果I = 1,则计算R1 = R2星号Z。然后Y(i)= O,则I保持不变,并且如果Y(i)= 1,则对I进行补码。独立索赔包括:(a)电子终端

著录项

  • 公开/公告号FR2804225A1

    专利类型

  • 公开/公告日2001-07-27

    原文格式PDF

  • 申请/专利权人 GEMPLUS;

    申请/专利号FR20000001333

  • 发明设计人 BENOIT OLIVIER;

    申请日2000-01-26

  • 分类号G06F12/14;G06K19/073;G09C5/00;

  • 国家 FR

  • 入库时间 2022-08-22 01:07:41

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号