公开(公告)号：WO2013085487A1

公开(公告)日：2013-06-13

申请号：PCT/US2011/063328

申请日：2011-12-05

Applicant: INTEL CORPORATION ,  OZTURK, Erdinc ,  GOPAL, Vinodh ,  WOLRICH, Gilbert M. ,  FEGHALI, Wajda K. ,  GUILFORD, James D. ,  KARAKOYUNLU, Deniz ,  DIXON, Martin G. ,  AKDEMIR, Kahraman D.

Inventor： OZTURK, Erdinc ,  GOPAL, Vinodh ,  WOLRICH, Gilbert M. ,  FEGHALI, Wajda K. ,  GUILFORD, James D. ,  KARAKOYUNLU, Deniz ,  DIXON, Martin G. ,  AKDEMIR, Kahraman D.

IPC: H04K1/00

CPC classification number: G06F21/71 ,  G06F7/723 ,  H04L9/3006 ,  H04L2209/12

Abstract: In one embodiment, the present disclosure provides a method that includes segmenting an n-bit exponent e into a first segment e t and a number t of k-bit segments e i in response to a request to determine a modular exponentiation result R, wherein R is a modular exponentiation of a generator base g for the exponent e and a q-bit modulus m, wherein the generator base g equals two and k is based at least in part on a processor configured to determine the result R; iteratively determining a respective intermediate modular exponentiation result for each segment e i , wherein the determining comprises multiplication, exponentiation and a modular reduction of at least one of a multiplication result and an exponentiation result; and generating the modular exponentiation result R = g e mod m based on, at least in part, at least one respective intermediate modular exponentiation result.

Abstract translation: 在一个实施例中，本公开提供了一种方法，其包括响应于确定模幂运算结果R的请求，将n位指数e分割成第一段et和数目t的k比特段ei，其中R是 指数e的发生器基数g和q位模数m的模幂运算，其中发生器基g等于2，k至少部分地基于被配置为确定结果R的处理器; 迭代地确定每个段ei的相应的中间模幂运算结果，其中所述确定包括相乘结果和求幂结果中的至少一个的乘法，乘法和模块化减少; 并且至少部分地基于至少一个相应的中间模幂运算结果来产生模幂运算结果R = ge mod m。