首页> 外国专利> Multiplication of two very large numbers for cryptographic purposes, whereby a brackets multiplication method is used based on reduction to a prime element and use of a successive look ahead mechanism

Multiplication of two very large numbers for cryptographic purposes, whereby a brackets multiplication method is used based on reduction to a prime element and use of a successive look ahead mechanism

机译:将两个非常大的数字相乘以用于加密目的,其中基于对素数的归约和使用连续的超前机制来使用方括号相乘方法

摘要

Method for modular multiplication of long numbers of fixed bit-length spread across several bytes, whereby calculation of mixed terms is undertaken using bracket multiplication based on reduction to a prime element and use of a successive look ahead mechanism so that the bytes for the calculation are available at the correct time and with sufficient accuracy. The invention also relates to a corresponding device for method implementation.
机译:固定数目的位的长整数在几个字节上进行模乘的方法,从而使用基于基于素数的归约的方括号乘法和连续先行机制进行混合项的计算,从而使计算的字节为在正确的时间和足够的准确性可用。本发明还涉及用于方法实施的相应装置。

著录项

  • 公开/公告号DE102004016412A1

    专利类型

  • 公开/公告日2005-10-27

    原文格式PDF

  • 申请/专利权人 CV CRYPTOVISION GMBH;

    申请/专利号DE20041016412

  • 发明设计人 BLUEMEL RAINER;

    申请日2004-03-30

  • 分类号G06F7/52;

  • 国家 DE

  • 入库时间 2022-08-21 22:00:48

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号