PROTECTING MODULAR EXPONENTIATION IN CRYPTOGRAPHIC OPERATIONS

Number of patents in Portfolio can not be more than 2000

United States of America Patent

APP PUB NO 20130279692A1
SERIAL NO

13824599

Stats

ATTORNEY / AGENT: (SPONSORED)

Importance

Loading Importance Indicators... loading....

Abstract

See full text

The present invention proposes a method for executing a blinded modular exponentiation, based on a window method with a window size of k bits so using 2k pre-calculated variables (Yi=Xi mod N for i=0 to 2k−1), on input data X of n bits to obtain output data S of n bits, S=Xd mod N, where d is the exponent of size m bits and N is the modulus of n bits, comprising the steps of: •blinding the pre-calculated variables by a blinding value Bi being a pseudo-random variable of the size of the modulus (n bits) and lower than the modulus (Yj=Yi×B1 mod N for i=0 to 2k−1) •executing the modular exponentiation with the blinded pre-calculated variables, to obtain an intermediate result (A), •unblinding the intermediate result by a unblinding value C1=(B1g)−1 mod N where g equals the concatenation of m/k times the value “1” coded on k bits, to obtain the output data S.

Loading the Abstract Image... loading....

First Claim

See full text

Family

Loading Family data... loading....

Patent Owner(s)

Patent OwnerAddress
NAGRAVISION S AROUTE DE GENEVE 22-24 CHESEAUX-SUR-LAUSANNE 1033

International Classification(s)

  • [Classification Symbol]
  • [Patents Count]

Inventor(s)

Inventor Name Address # of filed Patents Total Citations
Bevan, Regis Paris, FR 2 22

Cited Art Landscape

Load Citation

Patent Citation Ranking

Forward Cite Landscape

Load Citation