Abstract: A computer is connected to a memory. The computer operates to execute an encryption program in the memory. The encryption program includes a carry bucket portion to convert notation of a first factor, a second factor and a third factor; an incremental modular multiplication portion operates to calculate a first product between the first converted factor and the second converted factor; a graphical multiplication portion operates to calculate a second product of the first converted factor and the second converted factor and a flexible modular reduction (FMR) portion to reduce a third product between the first converted factor and the second converted factor modulus the third converted factor to generate encryption keys.

Abstract: The present invention provides a computer-implemented method for multiplying two large multiplicands. The method includes generating a plurality of partial products by multiplying each digit of the first multiplicand with each digit of the second multiplicand. The resulting partial products have a least significant digit and a most significant digit. The method further includes adding each of the most significant digits to a first array and adding each of the least significant digits to a second array. The method then includes adding the first array to the second array, wherein the result is the product of the two original multiplicands.

Abstract: A computer-implemented method analyzes a source code segment which is to be compiled for execution by any one of several different processor types. The method determines whether a performance advantage would be achieved by generating a customized version of object code that can be executed by one of the processor types compared with generating a non-customized version. If a performance advantage would be achieved, the method generates at least one customized object code version and a non-customized version for the source code segment, and it generates a control section that causes one of the object code versions to be called during execution of the object code in accordance with an executing processor's processor type. If no performance advantage would be achieved, the method generates a non-customized version of the object code that can be executed by any of the different processor types.

Abstract: A computer-implemented method analyzes a source code segment which is to be compiled for execution by any one of several different processor types. The method determines whether a performance advantage would be achieved by generating a customized version of object code that can be executed by one of the processor types compared with generating a non-customized version. If a performance advantage would be achieved, the method generates at least one customized object code version and a non-customized version for the source code segment, and it generates a control section that causes one of the object code versions to be called during execution of the object code in accordance with an executing processor's processor type. If no performance advantage would be achieved, the method generates a non-customized version of the object code that can be executed by any of the different processor types.

Abstract: A computer-implemented method identifies a code segment which is to be customized to a plurality of different processor types. The method generates object code for the code segment, including generating a plurality of sections for the code segment, each of the plurality of sections being object code for the code segment customized for one of the plurality of different processor types, and generating a control section that causes a selected one of the plurality of sections to be called during execution of the object code in accordance with an executing processor's processor type.

Abstract: A computer program product and method for efficiently selecting one action from among alternative actions are disclosed. The computer program product includes a computer readable medium for storing instructions, which, when executed by a computer, cause the computer to efficiently select one action, from among alternative actions. The selection is based on the value of a selection key, and includes comparing the selection key to values corresponding to alternative actions, and obtaining for each comparison a match or no match indication, and making a number of such comparisons in parallel. The computer then is made to logically AND those indications with an equal quantity of corresponding values, in parallel, to create index indications. The computer then is made to reduce the multiple index indications and to produce in a register a single value corresponding to the selected action or to a default action. The computer is then made to branch to the selected action identified by the value in the register.