首页> 外文会议>Information Security Practice and Experience; Lecture Notes in Computer Science; 4464 >Secure Signed Radix-r Recoding Methods for Constrained-Embedded Devices
【24h】

Secure Signed Radix-r Recoding Methods for Constrained-Embedded Devices

机译:受限嵌入式设备的安全签名Radix-r编码方法

获取原文
获取原文并翻译 | 示例

摘要

This paper presents two recoding methods for a radix-r representation of a secret scalar which are resistant to SPA. These recoding methods are left-to-right so they can be interleaved with a left-to-right scalar multiplication, removing the need to store both a scalar and its recoding. Next, we show the ideas of left-to-right recoding for a radix-r representation lead to simplified recoding methods for a binary representation. In general our proposed algorithms asymptotically require additional (w + l)-digit and w-bit of RAM in the case of width-w radix-r representation and a special case when r = 2, respectively, which is independent from the digit (bit) size n of the scalar and considerably reduces the required space comparing with previous methods which require n-digit (bit) of RAM additional memory to store the recoded scalar. Consequently, thanks to its left-to-right nature, the scalar multiplication based on it is by far more convenient with respect to memory consumption.
机译:本文提出了两种对SPA具有抵抗力的秘密标量的基数表示形式的重新编码方法。这些重新编码方法是从左到右的,因此它们可以与从左到右的标量乘法相交织,从而无需存储标量及其重新编码。接下来,我们展示了从基数到r的从左到右重新编码的思想,从而简化了二进制表示的重新编码方法。通常,我们提出的算法在宽度为w的基数为r的情况下以及在r = 2的情况下(分别与数字无关)渐近地需要RAM的附加(w + l)位和w位。与以前的方法相比,前一种方法需要n位(位)的RAM额外的内存来存储重新编码后的标量,而标量的大小为n位,并且大大减少了所需的空间。因此,由于其从左到右的性质,基于它的标量乘法在内存消耗方面要方便得多。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号