| Patent Number |
Title Of Patent |
Date Issued |
| 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 |
| 7225212 |
Extended precision accumulator |
May 29, 2007 |
| A multiply unit includes an extended precision accumulator. Microprocessor instructions are provided for manipulating portions of the extended precision accumulator including an instruction to move the contents of a portion of the extended accumulator to a general-purpose register (" |
| 7181484 |
Extended-precision accumulation of multiplier output |
February 20, 2007 |
| A multiply unit includes an extended precision accumulator. Microprocessor instructions are provided for manipulating portions of the extended precision accumulator including an instruction to move the contents of a portion of the extended accumulator to a general-purpose register (" |
| 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 |
| 7123717 |
Countermeasure method in an electronic component which uses an RSA-type public key cryptographic |
October 17, 2006 |
| A countermeasure method in an electronic component which uses an RSA-type public key cryptographic algorithm. A first countermeasure method uses a random calculation for each new execution of the decryption algorithm with CRT. The calculations are made modulo p*r and q*t, r and t being |
| 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 |
| 7054444 |
Public and private key cryptographic method |
May 30, 2006 |
| The invention concerns a cryptographic method for generating public keys and private keys. Two distinct first numbers p and q, of neighboring value are selected, and the number n equal to the product of pq is calculated. The lowest common multiple of the numbers (p-1) and (q-1).lamda |
