Method for secure integer division or modular reduction...

Details Method for secure integer division or modular reduction... Method for secure integer division or modular reduction...

2003-12-11

2009-12-29

Chai, Longbit (Department: 2431)

Cryptography

Particular algorithmic function encoding

C380S029000, C380S030000, C713S193000, C713S194000

Reexamination Certificate

active

07639796

ABSTRACT:
The invention concerns a cryptographic method which includes integer division of the type q=a div b and/or a modular reduction of the type r=a mod b, with q being a quotient, a being a number of m bits, b being a number of n bits, n being not more than m and bn−1being the most significant bit of the number b. The number a is masked by a random number p before performing the integer division and/or the modular reduction. The invention also concerns an electronic component for implementing the method. The invention is applicable for making smart cards secure against hidden channel attacks, and in particular differential attacks.

REFERENCES:
patent: 5077793 (1991-12-01), Falk et al.
patent: 2003/0079139 (2003-04-01), Drexler et al.
patent: 199 63 407 (2001-07-01), None
patent: 0 682 327 (1995-11-01), None

Affiliated with

Also associated with

Rating

Method for secure integer division or modular reduction... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method for secure integer division or modular reduction..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for secure integer division or modular reduction... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4140551