**Patent Number** |
**Title Of Patent** |
**Date Issued** |

8233614 |
Integer division method secure against covert channel attacks |
July 31, 2012 |

The invention relates to a cryptographic method involving an integer division of type q=a div b and r=a mod b, wherein a is a number of m bits, b is a number of n bits, with n being less than or equal to m, and b.sub.n-1 being non-null and the most significant bit of b. In addition, |

8065735 |
Method of securing a calculation of an exponentiation or a multiplication by a scalar in an elec |
November 22, 2011 |

A cryptographic operation includes calculating a multiplication of an element of an additively denoted group by a scalar. After two registers R.sub.0+R.sub.1, are initialized, iterations are carried out over the components K.sub.i of the scalar K. If K.sub.i of the scalar equals 0, t |

7860242 |
Method of securely implementing a cryptography algorithm of the RSA type, and a corresponding co |
December 28, 2010 |

A method for the secure application of a cryptographic algorithm of the RSA type in an electronic component obtains the value of a public exponent e from a given set of probable values, without a priori knowledge of that value. Having determined the value for the public exponent e, t |

7742595 |
Cryptographic method protected against covert channel type attacks |
June 22, 2010 |

The invention relates to a cryptographic method secured against a covert channel attack. According to the invention, in order to carry out a selected block of instructions as a function of an input variable amongst N predefined instruction blocks, a common block is carried out on the |

7639796 |
Method for secure integer division or modular reduction against hidden channel attacks |
December 29, 2009 |

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 b.sub.n-1 being the most |

7433905 |
Device and method for processing digital values in particular in non-adjacent form |
October 7, 2008 |

A table establishes correspondence between first sets of at least one number, expressed in accordance with a signed code where each number may have the value of 0, 1 or -1, and second sets of at least one number, expressed according to a simple form where each number may have the value |

7424114 |
Method for enhancing security of public key encryption schemas |
September 9, 2008 |

There exist numerous public key probabilistic encryption algorithms. Most of these algorithms do not have a maximum security level against someone capable of chosen ciphertext attacks. The disclosed method provides a construct to enhance the security of any public key probabilistic or |

7386123 |
Method of implementing in an electronic component a cryptographic algorithm for finding the publ |
June 10, 2008 |

The invention concerns a method for implementing in an electronic component a cryptographic algorithm using calculating means. The invention is characterized in that it consists in carrying out the following steps: a) selecting a value e among a specific number of values e.sub.I, e.s |

7359508 |
Method of securely implementing a cryptography algorithm of the RSA type, and a corresponding co |
April 15, 2008 |

A method for the secure application of a cryptographic algorithm of the RSA type in an electronic component obtains the value of a public exponent e from a given set of probable values, without a priori knowledge of that value. Having determined the value for the public exponent e, t |

7149763 |
Method for generating a random prime number within a predetermined interval |
December 12, 2006 |

A random prime number is generated within a predetermined interval by precalculating and storing a single value that functions as a universal parameter for generating prime numbers of any desired size. The value, .pi., is chosen as a product of k prime numbers. A number a is also cho |

7113595 |
Generation of a random number that is non-divisible by a set of prime numbers |
September 26, 2006 |

A random number that is co-prime with a set of prime numbers is generated, without having to calculate the greatest common denominator of the numbers. The value of 1-x.sup..lamda.(mod .pi.), where x is a randomly generated value and .lamda. is the Carmichael function, is tested to de |

6903663 |
Method for converting the binary representation of a number in a signed binary representation |
June 7, 2005 |

A method for converting in a binary representation of a number based on a left-to-right processing of bits of the binary representation, to obtain a signed representation equivalent to the so-called Reitwiesner representation. The use of such a conversion method with left-to-right ar |