polynomial arithmetic instructions are provided in an instruction set architecture (ISA). A multiply-add-polynomial (MADDP) instruction and a multiply-polynomial (MULTP) instruction are provided.

Patent
   7711763
Priority
Feb 21 2001
Filed
Feb 21 2001
Issued
May 04 2010
Expiry
Jul 22 2022
Extension
516 days
Assg.orig
Entity
Large
7
222
all paid
13. A method for performing polynomial arithmetic in an encryption or decryption process, comprising:
storing in a first register a first set of bits corresponding to coefficients of a binary representation of a first polynomial;
storing in a second register a second set of bits corresponding to coefficients of a binary representation of a second polynomial;
multiplying the contents of the first and second registers using a shift register to obtain an intermediate value;
adding the intermediate value to the contents of a high-order result register and a low-order result register to obtain a result, the result comprising a set of bits that corresponds to coefficients of a binary representation of a polynomial that results from the multiplying and adding; and
reading the result for use in the encryption or decryption process.
39. A method for performing polynomial arithmetic in an encryption or decryption process, comprising:
storing in a first register a first set of bits corresponding to coefficients of a binary representation of a first polynomial;
storing in a second register a second set of bits corresponding to coefficients of a binary representation of a second polynomial;
performing an arithmetic operation on the contents of the first and second registers using a shift register to obtain an intermediate value;
adding the intermediate value to the contents of a high-order result register and a low-order result register to obtain a result, the result comprising a set of bits that corresponds to coefficients of a binary representation of a polynomial that results from the multiplying and adding; and
reading the result for use in the encryption or decryption process.
30. A hardware microprocessor that executes an instruction having one or more opcodes, wherein execution of the instruction causes the microprocessor to perform a polynomial arithmetic operation-comprising:
a first register to store a first set of bits corresponding to coefficients of a binary representation of a first polynomial;
a second register to store a second set of bits corresponding to coefficients of a binary representation of a second polynomial;
a high-order result register to store coefficients corresponding to a high-order portion of a binary representation of a third polynomial and a low-order result register to store coefficients corresponding to a low-order portion of the binary representation of the third polynomial, and
logic configured to perform an arithmetic operation on the contents of the first and second registers using a shift register to obtain an intermediate value and to add the contents of the high-order result register and the low-order result register to the intermediate value to obtain a result.
1. A hardware microprocessor that executes an instruction having one or more opcodes, wherein execution of the instruction causes the microprocessor to perform a polynomial arithmetic operation, comprising:
a first register to store a first set of bits corresponding to coefficients of a binary representation of a first polynomial;
a second register to store a second set of bits corresponding to coefficients of a binary representation of a second polynomial;
a high-order result register to store a third set of bits corresponding to coefficients of a high-order portion of a binary representation of a third polynomial and a low-order result register to store a fourth set of bits corresponding to coefficients of a low-order portion of the binary representation of the third polynomial;
a shift register; and
logic configured to multiply the contents of the first and second registers using the shift register to obtain an intermediate value, and to add the contents of the high-order result register to a high-order portion of the intermediate value, and the contents of the low-order result register to a low-order portion of the intermediate value to obtain a result.
34. A method for performing polynomial arithmetic using an instruction, the method comprising:
receiving the instruction, the instruction including one or more opcodes identifying the instruction as an instruction for performing a polynomial arithmetic operation;
storing in a first register a first set of bits corresponding to coefficients of a binary representation of a first polynomial;
storing in a second register a second set of bits corresponding to coefficients of a binary representation of a second polynomial;
performing an arithmetic operation on the contents of the first and second registers using a shift register to obtain an intermediate value;
adding the contents of a high-order result register and a low-order result register to the intermediate value to obtain a result; and
writing a high-order portion of the result to the high-order result register and a low-order portion of the result to the low-order result register, wherein the high-order result register contains a set of bits corresponding to a high-order portion of a binary representation of the result and the low-order result register contains a set of bits corresponding to a low-order portion of a binary representation of the result.
7. A method for performing polynomial arithmetic using an instruction, the method comprising:
storing in a first register a first set of bits corresponding to coefficients of a binary representation of a first polynomial;
storing in a second register a second set of bits corresponding to coefficients of a binary representation of a second polynomial;
receiving the instruction, the instruction including one or more opcodes identifying the instruction as an instruction for performing a polynomial arithmetic operation on polynomials represented by respective sets of binary polynomial coefficients
multiplying the contents of the first and second registers using a shift register to obtain an intermediate value in response to receiving the instruction;
adding the contents of a high-order result register having stored therein coefficients corresponding to a high-order portion of a binary representation of a third polynomial to a high-order portion of the intermediate value to obtain a high-order portion of the result; and
adding the contents of a low-order result register having stored therein coefficients corresponding to a low-order portion of the binary representation of the third polynomial to a low-order portion of the intermediate value to obtain a low-order portion of the result.
45. A hardware microprocessor that executes one or more instructions for performing polynomial arithmetic, the microprocessor comprising:
an execution unit that processes a fetched instruction; and
a polynomial arithmetic unit used by the execution unit in processing the fetched instruction if the fetched instruction is one of the one or more instructions for performing polynomial arithmetic on polynomials represented by respective sets of binary polynomial coefficients, wherein each set of binary polynomial coefficients includes one or more bits with each bit in the set representing a different term of one of the polynomials and wherein the polynomial arithmetic unit is configured to perform a polynomial arithmetic operation using a shift register to determine an intermediate value, followed by an addition of the intermediate value to a third polynomial to produce a result polynomial, the result polynomial comprising a high-order portion having bits corresponding to coefficients of a high-order portion of a binary representation of the result polynomial and a low-order portion having bits corresponding to coefficients of a low-order portion of the binary representation of the result polynomial,
wherein the fetched instruction comprises:
an opcode identifying the fetched instruction as an instruction for performing the polynomial arithmetic operation; and
two register identifiers associated with two respective registers of a register file used in said polynomial arithmetic operation.
19. A hardware microprocessor that executes one or more instructions for performing polynomial arithmetic, the microprocessor comprising:
an execution unit that processes a fetched instruction; and
a polynomial arithmetic unit used by the execution unit in processing the fetched instruction if the fetched instruction is one of the one or more instructions for performing polynomial arithmetic on polynomials represented by respective sets of binary polynomial coefficients, wherein each set of binary polynomial coefficients includes one or more bits with each bit in the set representing a different term of one of the polynomials and wherein the polynomial arithmetic unit is configured to perform a binary polynomial multiplication-addition operation by performing a binary polynomial multiplication using a shift register to determine an intermediate result and adding the intermediate result to contents of a high-order result register and a low-order result register to generate a result polynomial represented by a result set of binary polynomial coefficients that includes one or more bits with each bit in the result set representing a different term of the result polynomial,
wherein the fetched instruction comprises:
an opcode identifying the fetched instruction as an instruction for performing the binary polynomial multiplication-addition operation, and
two register identifiers associated with two respective registers of a register file that contain two respective polynomials, represented by respective sets of binary polynomial coefficients, multiplied in said binary polynomial multiplication.
25. A computer-readable medium that comprises at least one of a semiconductor, a magnetic medium, and an optical medium, and having computer-readable program code stored thereon for enabling a computer to multiply a first and second polynomial to create an intermediate value and add the intermediate value to a third polynomial, the computer-readable program code comprising:
first computer-readable program code for causing the computer to load each of two sets of binary polynomial coefficients representing the first and second respective polynomials into two respective registers of a register file, wherein each set of binary polynomial coefficients includes one or more bits with each bit in the set representing a different term of one of the first and second polynomials;
second computer-readable program code including an instruction having:
one or more opcodes identifying the instruction as an instruction for performing a polynomial arithmetic operation on the first and second polynomials; and
two register identifiers specifying the two respective registers
wherein execution of the instruction by the computer causes the computer to multiply the first and second polynomials using a shift register to produce the intermediate value, add the intermediate value to a third polynomial to produce a result polynomial represented by a result bit set having a set of bits corresponding to coefficients of a binary representation of the result polynomial, and to write high-order portion of the result bit set to the high-order result register, and a low-order portion of the result bit set to the low-order result register.
51. A computer-readable medium that comprises at least one of a semiconductor, a magnetic medium, and an optical medium, and having computer-readable program code stored thereon for enabling a computer to perform a polynomial arithmetic operation on a first and second polynomial to create an intermediate value and add the intermediate value to a third polynomial, the computer-readable program code comprising:
first computer-readable program code for causing the computer to load each of two sets of binary polynomial coefficients representing the first and second respective polynomials into two respective registers of a register file, wherein each set of binary polynomial coefficients includes one or more bits with each bit in the set representing a different term of one of the first and second polynomials;
second computer-readable program code including an instruction having:
one or more opcodes identifying the instruction as an instruction for performing the polynomial arithmetic operation on the first and second polynomials; and
two register identifiers specifying the two respective registers that contain the sets of binary polynomial coefficients representing the first and second respective polynomials,
wherein execution of the instruction by the computer causes the computer to perform the polynomial arithmetic operation on the first and second polynomials using a shift register to produce the intermediate value, to add the intermediate value to a third polynomial to create a result polynomial represented by a result bit set having bits corresponding to coefficients of a binary representation of the result polynomial, and to write bits of the result bit set corresponding to high-order coefficients of the result polynomial to a high-order result register and bits corresponding to low-order coefficients of the result polynomial to a low-order result register.
2. The hardware microprocessor of claim 1 wherein a high-order portion of the result is stored in the high-order result register and a low-order portion of the low-order result register.
3. The hardware microprocessor of claim 1 wherein the instruction is part of a RISC instruction set.
4. The hardware microprocessor of claim 1 wherein the multiplication is performed using modulo two arithmetic.
5. The hardware microprocessor of claim 1 wherein the addition is performed using modulo two arithmetic.
6. The hardware microprocessor of claim 1 wherein the multiplication and the addition are performed using modulo two arithmetic.
8. The method of claim 7 wherein the instruction is part of an instruction set, and the instruction set comprises a RISC instruction set.
9. The method of claim 7, further comprising performing the multiplication using modulo two arithmetic.
10. The method of claim 7, further comprising performing the addition using modulo two arithmetic.
11. The method of claim 7, further comprising;
performing the multiplication using modulo two arithmetic; and
performing the addition using modulo two arithmetic.
12. The method of claim 7, further comprising:
writing a high-order portion of the result to the high-order result register; and
writing a low-order portion of the result to the low-order result register.
14. The method of claim 13, further comprising executing an instruction that identifies the first and second registers, the execution of which performs the polynomial arithmetic, wherein the instruction is part of a RISC instruction set.
15. The method of claim 13, further comprising performing the multiplication using modulo two arithmetic.
16. The method of claim 13, further comprising performing the addition using modulo two arithmetic.
17. The method of claim 13, further comprising:
performing the multiplication using modulo two arithmetic; and
performing the addition using modulo two arithmetic.
18. The method of claim 13, further comprising:
writing a high-order portion of the result to the high-order result register; and
writing a low-order portion of the result to the low-order result register.
20. The hardware microprocessor of claim 19 wherein the polynomial arithmetic unit is a component of a multiply/divide unit.
21. The hardware microprocessor of claim 19, wherein the fetched instruction is part of a RISC instruction set.
22. The hardware microprocessor of claim 19, wherein the binary polynomial multiplication is performed using modulo two arithmetic.
23. The hardware microprocessor of claim 19, wherein the addition is performed using modulo two arithmetic.
24. The hardware microprocessor of claim 19, wherein the binary polynomial multiplication and the addition are performed using modulo two arithmetic.
26. The computer-readable medium of claim 25, wherein the instruction is part of a RISC instruction set.
27. The computer-readable medium of claim 25, wherein the multiplication is performed using modulo two arithmetic.
28. The computer-readable medium of claim 25, wherein the addition is performed using modulo two arithmetic.
29. The computer-readable medium of claim 25, wherein the multiplication and the addition are performed using modulo two arithmetic.
31. The hardware microprocessor of claim 30 wherein a high-order portion of the result is stored in the high-order result register and a low-order portion of the result is stored in the low-order result register.
32. The hardware microprocessor of claim 30 wherein the instruction set is part of a RISC instruction set.
33. The hardware microprocessor of claim 30, wherein the addition is performed using modulo two arithmetic.
35. The method of claim 34 wherein the instruction is part of an instruction set, and the instruction set comprises a RISC instruction set.
36. The method of claim 34, further comprising performing the arithmetic operation on the contents of the first and second registers using modulo two arithmetic.
37. The method of claim 34, further comprising performing the addition using modulo two arithmetic.
38. The method of claim 34, further comprising:
performing the arithmetic operation on the contents of the first and second registers using modulo two arithmetic; and
performing the addition using modulo two arithmetic.
40. The method of claim 39, further comprising executing an instruction that identifies the first and second registers, the execution of which performs the polynomial arithmetic, wherein the instruction is part of an instruction set, and the instruction set comprises a RISC instruction set.
41. The method of claim 39, further comprising performing the arithmetic operation on the contents of the first and second registers using modulo two arithmetic.
42. The method of claim 39, further comprising performing the addition using modulo two arithmetic.
43. The method of claim 39, further comprising:
performing the arithmetic operation on the contents of the first and second registers using modulo two arithmetic; and
performing the addition using modulo two arithmetic.
44. The method of claim 39, further comprising:
writing a high-order portion of the result in the high-order result register; and
writing a low-order portion of the result in the low-order result register.
46. The hardware microprocessor of claim 45 wherein the polynomial arithmetic unit is a component of a multiply/divide unit.
47. The hardware microprocessor of claim 45, wherein the fetched instruction is part of a RISC instruction set.
48. The hardware microprocessor of claim 45, wherein the polynomial arithmetic operation is performed using modulo two arithmetic.
49. The hardware microprocessor of claim 45, wherein the addition is performed using modulo two arithmetic.
50. The hardware microprocessor of claim 45, wherein the polynomial arithmetic operation and the addition are performed using modulo two arithmetic.
52. The computer-readable medium of claim 51, wherein the instruction is part of a RISC instruction set.
53. The computer-readable medium of claim 51, wherein the polynomial arithmetic operation on the first and second polynomials is performed using modulo two arithmetic.
54. The computer-readable medium of claim 51, wherein the addition is performed using modulo two arithmetic.
55. The computer-readable medium of claim 51, wherein the polynomial arithmetic operation on the first and second polynomials and the addition are performed using modulo two arithmetic.

This application is related to the following applications, each of which is being filed concurrently with this application and is incorporated by reference: (1) U.S. application Ser. No. 09/788,683, now U.S. Pat. No. 7,237,097 titled “Partial Bitwise Permutations”; (2) U.S. application Ser. No. 09/788,670, titled “Binary Polynomial Multiplier”; (3) U.S. application Ser. No. 09/788,682, now U.S. Pat. No. 7,162,621 titled “Configurable Instruction Sequence Generation”; and (4) U.S. application Ser. No. 09/788,685, now U.S. Pat. No. 7,181,484, titled “Extended-Precision Accumulation of Multiplier Output”.

This invention relates to microprocessor instructions for performing polynomial arithmetic, and more particularly to microprocessor instructions for performing polynomial multiplications.

Reduced instruction set computer (RISC) architectures were developed as industry trends tended towards larger, more complex instruction sets. By simplifying instruction set designs, RISC architectures make it easier to use techniques such as pipelining and caching, thus increasing system performance.

RISC architectures usually have fixed-length instructions (e.g., 16-bit, 32-bit, or 64-bit), with few variations in instruction format. Each instruction in an instruction set architecture (ISA) may have the source registers always in the same location. For example, a 32-bit ISA may always have source registers specified by bits 16-20 and 21-25. This allows the specified registers to be fetched for every instruction without requiring any complex instruction decoding.

Cryptographic systems (“cryptosystems”) are increasingly used to secure transactions, to encrypt communications, to authenticate users, and to protect information. Many private-key cryptosystems, such as the Digital Encryption Standard (DES), are relatively simple computationally and frequently reducible to hardware solutions performing sequences of XORs, rotations, and permutations on blocks of data. Public-key cryptosystems, on the other hand, may be mathematically more subtle and computationally more difficult than private-key systems.

While different public-key cryptography schemes have different bases in mathematics, they tend to have a common need for integer computation across very large ranges of values, on the order of 1024 bits. This extended precision arithmetic is often modular (i.e., operations are performed modulo a value range), and in some cases binary polynomial instead of twos-complement. For example, RSA public-key cryptosystems use extended-precision modular exponentiation to encrypt and decrypt information and elliptic curve cryptosystems use extended-precision modular polynomial multiplication.

Public-key cryptosystems have been used extensively for user authentication and secure key exchange, while private-key cryptography has been used extensively to encrypt communication channels. As the use of public-key cryptosystems increases, it becomes desirable to increase the performance of extended-precision modular arithmetic calculations.

In one general aspect, an instruction set architecture includes an instruction for performing polynomial arithmetic. The instruction includes one or more opcodes that identify the instruction as an instruction for performing a polynomial arithmetic operation. Additionally, the instruction identifies one or more registers. The instruction may be processed by performing the polynomial arithmetic operation using the identified registers.

Implementations may provide an instruction for performing binary polynomial addition, which may be implemented using a multiplier. The result of a polynomial arithmetic operation may be stored in one or more result registers. Polynomial arithmetic operations may include multiplication, where the contents of identified registers are multiplied together. Operations also may include polynomial multiplication-addition, where the contents of identified registers are multiplied together and then added to one or more result registers. The result registers may include a high-order register and a low-order register. Polynomial arithmetic operations may be performed on polynomials stored in registers. The polynomials may be encoded as a binary representation of coefficients.

The details of one or more implementations are set forth in the accompanying drawings and the description below. Other features and advantages will be apparent from the description and drawings, and from the claims.

FIG. 1 is a block diagram of an exemplary five-stage pipeline that may be used in a RISC architecture.

FIG. 2 is a block diagram of a processor core including an execution core and a multiply/divide unit.

FIGS. 3A and 3B are instruction encodings for exemplary instructions performing polynomial multiplication and addition.

Many public-key cryptosystems use extended-precision modular arithmetic to encrypt and decrypt data. For example, many elliptic curve (EC) cryptosystems heavily use binary polynomial multiplication and addition to encrypt and decrypt data. Performance of elliptic curve cryptosystems may be enhanced by modifying a programmable CPU multiplier to be responsive to newly defined instructions dedicated to polynomial operations.

When using elliptic curves defined over GF(2163) (as recommended by the IEEE 1363-2000 standard), the main operation needed is multiplication over the field GF(2163). Each of the 2163 elements can be represented as a polynomial of degree at most 163 with coefficients equal to 0 or 1. In this representation, two elements may be added using a simple bitwise XOR and two polynomials, a(X) and b(X), may be multiplied by computing a(X)b(X) mod P(X), where the product a(X)b(X) is a 326-degree polynomial, and P(A) is an irreducible polynomial as specified by the IEEE 1363-2000 standard.

Polynomial multiplication has the same form as modular multiplication, ab mod p, over the integers, except that: (1) regular addition is replaced by an XOR; and (2) regular 32-bit multiplication is replaced by a 32-bit carry-free multiplication. Therefore, polynomial modular multiplication may be performed using shifts and XORs instead of shifts and adds.

Referring to FIG. 1, an exemplary microprocessor architecture that may be used to implement polynomial multiplication includes a five-stage pipeline in which an instruction may be issued each clock cycle and executed in a fixed amount of time, such as, for example, five clock cycles. The execution of each instruction is divided into five stages: instruction fetch (IF) stage 1001, register read (RD) stage 1002, arithmetic/logic unit (ALU) stage 1003, memory (MEM) stage 1004, and write back (WB) stage 1005. In the IF stage 1001, a specified instruction is fetched from an instruction cache. A portion of the fetched instruction is used to specify source registers that may be used in executing the instruction. In the read registers (RD) stage 1002, the system fetches the contents of the specified source registers. These fetched values may be used to perform arithmetic or logical operations in the ALU stage 1003. In the MEM stage 1004, an executing instruction may read/write memory in a data cache. Finally, in the WB stage 1005, values obtained by the execution of the instruction may be written back to a register.

Because some operations, such as floating point calculations and integer multiply/divide, cannot always be performed in a single clock cycle, some instructions merely begin execution of an instruction. After sufficient clock cycles have passed, another instruction may be used to retrieve a result. For example, when an integer multiply instruction takes five clock cycles, one instruction may initiate the multiplication calculation, and another instruction may load the results of the multiplication into a register after the multiplication has completed. If a multiplication has not completed by the time a result is requested, the pipeline may stall until the result is available.

Referring to FIG. 2, an exemplary RISC architecture is provided by way of example. The processor core 2000 (also referred to as “microprocessor core”) includes the following: an execution unit 2010, a multiply/divide unit (MDU) 2020, a system control coprocessor (CPO) 2030, a memory management unit 2040, a cache controller 2050, and a bus interface unit (BIU) 2060.

Execution unit 2010 is the primary mechanism for executing instructions within processor core 2000. Execution unit 2010 includes a register file 2011 and an arithmetic logic unit (ALU) 2012. In one implementation, the register file 2011 includes thirty-two 32-bit general-purpose registers that may be used, for example, in scalar integer operations and address calculations. The register file 2011, which includes two read ports and one write port, may be fully bypassed to minimize operation latency in the pipeline. ALU 2012 supports both logical and arithmetic operations, such as addition, subtraction, and shifting.

The MDU 2020 performs multiply and divide operations. In one implementation, the MDU 2020 includes a 32-bit by 16-bit (32×16) Booth-encoded multiplier (not shown), result-accumulation registers (HI register 2021 and LO register 2022), a divide state machine, and all multiplexers and control logic required to perform these functions. In one pipelined implementation, 32×16 multiply operations may be issued every clock cycle to MDU 2020, so that a 32-bit number may be multiplied by a 16-bit number every clock cycle. However, the result will not be available in the HI/LO registers (2021 and 2022) until the multiplication has finished. The result may be accessed with the instructions MFHI and MFLO. These instructions move results from the HI register 2021 and LO register 2022, respectively, to an indicated register. For example, “MFHI $7” moves the contents of the HI register 2021 to general purpose register $7.

Two instructions, multiply-add (MADD/MADDU) and multiply-subtract (MSUB/MSUBU), may be used to perform the multiply-add and multiply-subtract operations. The MADD instruction multiplies two numbers and then adds the product to the current contents of the HI register 2021 and the LO register 2022. The result then is stored in the HI/LO registers (2021 and 2022). Similarly, the MSUB instruction multiplies two operands and then subtracts the product from the HI register 2021 and the LO register 2022, storing the result in the HI/LO registers (2021 and 2022). The instructions MADD and MSUB perform operations on signed values. MADDU and MSUBU perform the analogous operations on unsigned values.

Referring to FIG. 3A, an exemplary instruction encoding of a multiply-polynomial (MULTP) instruction 3010 is provided. The MULTP instruction 3010 has two register fields, rs 3011 and rt 3012, that specify the source registers containing polynomials to be multiplied. After the multiplication is complete, the result is stored in the HI register 2021 and the LO register 2022. The MULTP instruction 3010 also may include one or more opcodes 3013 that identify the operation to be performed. In some implementations a portion of the instruction field, such as, for example, field 3014, may be unused.

In one implementation, the registers identified by rs 3011 and rt 3012 contain binary polynomials (i.e., the polynomial's coefficients are reduced modulo two). Thus, each coefficient is either a “1” or a “0”. The polynomials are encoded in a 32-bit register with each bit representing a polynomial coefficient. For example, the polynomial “x4+x+1” would be encoded as “10011” because the coefficients of x3 and X2 are “0” and the remaining coefficients are “1”.

The MULTP instruction 3010 permits two polynomials to be multiplied. For example, (x4+x+1)(x+1)=x5+x4+x2+2x+1. Reducing the polynomial modulo two, yields x5+x4+x2+1. If the polynomials are encoded in the binary representation above, the same multiplication may be expressed as (10011)(11)=110101.

The sizes of the instruction and the operands may be varied arbitrarily; the 32-bit design described is merely by way of example. In a 32-bit implementation, a 32-bit word value stored in rs 3011 may be polynomial-basis multiplied by a 32-bit word value stored in rt 3012, treating both operands as binary polynomial values, to produce a 64-bit result. The low-order 32-bit word may be placed in LO register 2022, and the high-order 32-bit word result may be placed in HI register 2021. In some implementations, no arithmetic exceptions may occur. If the registers specified by rs 3011 and rt 3012 do not contain 32-bit sign-extended values, the result of the operation may be unpredictable.

Referring to FIG. 3B, an exemplary instruction encoding of a multiply-add-polynomial (MADDP) instruction 3020 is provided. The MADDP instruction 3020 has two parameter fields, rs 3021 and rt 3022, that specify the source registers containing polynomials to be multiplied and polynomial-basis added (XORed) to the contents of HI 2021 and LO 2022. After the multiplication and addition are complete, the result is stored in the HI register 2021 and the LO register 2022. The MADDP instruction 3020 also may include one or more opcodes 3023 that identify the operation to be performed. In some implementations, a portion of the instruction field, such as, for example, field 3024, may be unused.

The MADDP instruction 3020 performs multiplication as discussed above. Binary polynomial addition is analogous to a bitwise XOR. For example, the binary polynomial addition (x4+x+1)+(x+1) gives x4+2x+2. Reducing the coefficients modulo 2 yields x4, which may be expressed as “10000”.

Similarly, the sizes of the instruction and the operands may be varied arbitrarily. In one implementation, a 32-bit word value stored in rs 3021 may be polynomial-basis multiplied by a 32-bit word value stored in rt 3022, treating both operands as binary polynomial values, to produce a 64-bit result. This result then may be polynomial-basis added to the contents of the HI register 2021 and the LO register 2022. The 64-bit result includes a low-order 32-bit word and a high-order 32-bit word. The low-order 32-bit word may be placed in LO register 2022, and the high-order 32-bit word result may be placed in HI register 2021. If the registers specified by rs 3021 and rt 3022 do not contain 32-bit sign-extended values, the result of the operation may be unpredictable.

In addition to polynomial arithmetic implementations using hardware (e.g., within a microprocessor or microcontroller), implementations also may be embodied in software disposed, for example, in a computer usable (e.g., readable) medium configured to store the software (i.e., a computer readable program code). The program code causes the enablement of the functions or fabrication, or both, of the systems and techniques disclosed herein. For example, this can be accomplished through the use of general programming languages (e.g., C, C++), hardware description languages (HDL) including Verilog HDL, VHDL, AHDL (Altera HDL) and so on, or other available programming and/or circuit (i.e., schematic) capture tools. The program code can be disposed in any known computer usable medium including semiconductor, magnetic disk, optical disk (e.g., CD-ROM, DVD-ROM) and as a computer data signal embodied in a computer usable (e.g., readable) transmission medium (e.g., carrier wave or any other medium including digital, optical, or analog-based medium). As such, the code can be transmitted over communication networks including the Internet and intranets.

It is understood that the functions accomplished and/or structure provided by the systems and techniques described above can be represented in a core (e.g., a microprocessor core) that is embodied in program code and may be transformed to hardware as part of the production of integrated circuits. Also, the systems and techniques may be embodied as a combination of hardware and software. Accordingly, other implementations are within the scope of the following claim.

Kissell, Kevin D., Stribaek, Morten, Paillier, Pascal

Patent Priority Assignee Title
11853424, Oct 06 2020 Ventana Micro Systems Inc.; VENTANA MICRO SYSTEMS INC Processor that mitigates side channel attacks by refraining from allocating an entry in a data TLB for a missing load address when the load address misses both in a data cache memory and in the data TLB and the load address specifies a location without a valid address translation or without permission to read from the location
11868469, Aug 27 2020 Ventana Micro Systems Inc.; VENTANA MICRO SYSTEMS INC Processor that mitigates side channel attacks by preventing all dependent instructions from consuming architectural register result produced by instruction that causes a need for an architectural exception
11907369, Aug 27 2020 Ventana Micro Systems Inc.; VENTANA MICRO SYSTEMS INC Processor that mitigates side channel attacks by preventing cache memory state from being affected by a missing load operation by inhibiting or canceling a fill request of the load operation if an older load generates a need for an architectural exception
7860911, Feb 21 2001 ARM Finance Overseas Limited Extended precision accumulator
8447958, Feb 21 2001 ARM Finance Overseas Limited Substituting portion of template instruction parameter with selected virtual instruction parameter
8577026, Dec 29 2010 Ternarylogic LLC Methods and apparatus in alternate finite field based coders and decoders
8583994, Aug 26 2008 Sony Corporation Coding apparatus and method for handling quasi-cyclical codes
Patent Priority Assignee Title
3614406,
3642744,
3654621,
3916388,
4023023, Dec 04 1973 Compagnie Internationale pour l'Informatique Field selection data operating device
4109310, Aug 06 1973 Xerox Corporation Variable field length addressing system having data byte interchange
4126896, Apr 01 1976 Tokyo Shibaura Electric Co., Ltd. Microprogrammed large-scale integration (LSI) microprocessor
4128880, Jun 30 1976 CRAY, INC Computer vector register processing
4130880, Dec 23 1975 Ferranti Limited Data storage system for addressing data stored in adjacent word locations
4173041, May 24 1976 International Business Machines Corporation Auxiliary microcontrol mechanism for increasing the number of different control actions in a microprogrammed digital data processor having microwords of fixed length
4219874, Mar 17 1978 Data processing device for variable length multibyte data fields
4302820, Aug 20 1979 Allen-Bradley Company Dual language programmable controller
4307445, Nov 17 1978 Motorola, Inc. Microprogrammed control apparatus having a two-level control store for data processor
4317170, Jan 19 1979 Hitachi, Ltd. Microinstruction controlled data processing system including micro-instructions with data align control feature
4394736, Feb 11 1980 DATA GENERAL CORPORATION, A CORP OF DE Data processing system utilizing a unique two-level microcoding technique for forming microinstructions
4396982, Nov 19 1979 Hitachi, Ltd. Microinstruction controlled data processing system including microinstructions with data align control feature
4434462, Nov 24 1980 Texas Instruments Incorporated Off-chip access for psuedo-microprogramming in microprocessor
4491910, Feb 22 1982 Texas Instruments Incorporated Microcomputer having data shift within memory
4495598, Sep 29 1982 McDonnell Douglas Corporation Computer rotate function
4507731, Nov 01 1982 Micron Technology, Inc Bidirectional data byte aligner
4511990, Oct 31 1980 Hitachi, LTD; Hitachi Denshi Kabushiki Kaisha Digital processor with floating point multiplier and adder suitable for digital signal processing
4520439, Jan 05 1981 Sperry Corporation Variable field partial write data merge
4538239, Feb 11 1982 Texas Instruments Incorporated High-speed multiplier for microcomputer used in digital signal processing system
4583199, Jul 02 1982 Honeywell Information Systems Inc. Apparatus for aligning and packing a first operand into a second operand of a different character size
4586130, Oct 03 1983 COMPAQ INFORMATION TECHNOLOGIES GROUP, L P Central processing unit for a digital computer
4771463, Dec 05 1986 SIEMENS TRANSMISSION SYSTEMS, INC , A CORP OF DE Digital scrambling without error multiplication
4773006, Dec 29 1984 Hitachi, Ltd. Vector operation designator
4809212, Jun 19 1985 GLOBALFOUNDRIES Inc High throughput extended-precision multiplier
4811215, Dec 12 1986 INTERGRAPH CORPORATION, A CORP OF DE Instruction execution accelerator for a pipelined digital machine with virtual memory
4814976, Dec 23 1986 MIPS Technologies, Inc RISC computer with unaligned reference handling and method for the same
4825363, Dec 05 1984 Honeywell Inc. Apparatus for modifying microinstructions of a microprogrammed processor
4829380, Dec 09 1987 General Motors Corporation Video processor
4847801, Oct 26 1987 Eastman Kodak Company Compact galois field multiplier
4852037, Aug 16 1986 NEC Corporation Arithmetic unit for carrying out both multiplication and addition in an interval for the multiplication
4860192, Feb 22 1985 Intergraph Hardware Technologies Company Quadword boundary cache system
4868777, Sep 12 1986 MATSUSHITA ELECTRIC INDUSTRIAL CO , LTD , 1006 OAZA-KADOMA KADOMA-SHI, OSAKA-FU, 571 JAPAN A CORP OF JAPAN High speed multiplier utilizing signed-digit and carry-save operands
4878174, Nov 03 1987 LSI Logic Corporation Flexible ASIC microcomputer permitting the modular modification of dedicated functions and macroinstructions
4879676, Feb 29 1988 MIPS Technologies, Inc Method and apparatus for precise floating point exceptions
4884197, Feb 22 1985 Intergraph Hardware Technologies Company Method and apparatus for addressing a cache memory
4891781, Mar 04 1987 SAFENET, INC Modulo arithmetic processor chip
4899275, Feb 22 1985 Intergraph Hardware Technologies Company Cache-MMU system
4924435, Aug 13 1985 Hewlett-Packard Company Circulating context addressable memory
4928223, Oct 06 1982 National Semiconductor Corporation Floating point microprocessor with directable two level microinstructions
4949250, Mar 18 1988 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Method and apparatus for executing instructions for a vector processing system
4992934, Dec 15 1986 United Technologies Corporation Reduced instruction set computing apparatus and methods
5005118, Apr 10 1987 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Method and apparatus for modifying micro-instructions using a macro-instruction pipeline
5073864, Feb 10 1987 Davin Computer Corporation Parallel string processor and method for a minicomputer
5136696, Jun 27 1988 Intel Corporation High-performance pipelined central processor for predicting the occurrence of executing single-cycle instructions and multicycle instructions
5150290, Aug 25 1988 CAMBRIDGE PARALLEL PROCESSING LIMITED Processor array system incorporating n-bit scalar processor and m x m-bit processor array
5177701, Nov 07 1990 Kabushiki Kaisha Toshiba Computer and method for performing immediate calculation by utilizing the computer
5181183, Jan 17 1990 NEC Corporation Discrete cosine transform circuit suitable for integrated circuit implementation
5185713, Sep 19 1990 NEC Electronics Corporation Product adder for perfoming multiplication of floating point data and addition of fixed point data
5193202, May 29 1990 WAVETRACER, INC , A CORP OF MA Processor array with relocated operand physical address generator capable of data transfer to distant physical processor for each virtual processor while simulating dimensionally larger array processor
5220656, Dec 26 1988 Mitsubishi Denki Kabushiki Kaisha System for selecting control parameter for microinstruction execution unit using parameters and parameter selection signal decoded from instruction
5222244, Dec 20 1990 Intel Corporation Method of modifying a microinstruction with operands specified by an instruction held in an alias register
5235686, Feb 24 1987 Texas Instruments Incorporated Computer system having mixed macrocode and microcode
5280439, May 10 1991 Weitek Corporation Apparatus for determining booth recoder input control signals
5280593, Apr 24 1991 International Business Machines Corporation Computer system permitting switching between architected and interpretation instructions in a pipeline by enabling pipeline drain
5299147, Feb 22 1993 Intergraph Hardware Technologies Company Decoder scheme for fully associative translation-lookaside buffer
5392228, Dec 06 1993 Motorola, Inc. Result normalizer and method of operation
5392408, Sep 20 1993 Apple Inc Address selective emulation routine pointer address mapping system
5396502, Jul 09 1992 COMTECH TELECOMMUNICATIONS CORP Single-stack implementation of a Reed-Solomon encoder/decoder
5418915, Aug 08 1990 Sumitomo Metal Industries, Ltd. Arithmetic unit for SIMD type parallel computer
5452241, Apr 29 1993 International Business Machines Corporation System for optimizing argument reduction
5479620, May 08 1989 Matsushita Electric Industrial Co., Ltd. Control unit modifying micro instructions for one cycle execution
5499299, Jul 02 1993 Fujitsu Limited Modular arithmetic operation system
5502829, Nov 03 1993 Intergraph Hardware Technologies Company Apparatus for obtaining data from a translation memory based on carry signal from adder
5513366, Sep 28 1994 International Business Machines Corporation Method and system for dynamically reconfiguring a register file in a vector processor
5517438, Sep 29 1993 International Business Machines, Corporation Fast multiply-add instruction sequence in a pipeline floating-point processor
5537562, Mar 31 1993 HANGER SOLUTIONS, LLC Data processing system and method thereof
5537629, Mar 01 1994 Intel Corporation Decoder for single cycle decoding of single prefixes in variable length instructions
5550768, Jan 31 1995 International Business Machines Corporation Rounding normalizer for floating point arithmetic operations
5559974, Mar 01 1994 Intel Corporation Decoder having independently loaded micro-alias and macro-alias registers accessible simultaneously by one micro-operation
5560028, Nov 05 1993 INTERGRAPH HARDWARD TECHNOLOGIES COMPANY Software scheduled superscalar computer architecture
5581773, May 12 1992 Massively parallel SIMD processor which selectively transfers individual contiguously disposed serial memory elements
5590345, Nov 13 1990 IBM Corporation Advanced parallel array processor(APAP)
5598571, Mar 31 1993 HANGER SOLUTIONS, LLC Data processor for conditionally modifying extension bits in response to data processing instruction execution
5664136, Jul 10 1995 GLOBALFOUNDRIES Inc High performance superscalar microprocessor including a dual-pathway circuit for converting cisc instructions to risc operations
5666298, Dec 01 1994 Intel Corporation Method for performing shift operations on packed data
5669010, May 18 1992 Apple Inc Cascaded two-stage computational SIMD engine having multi-port memory and multiple arithmetic units
5671401, Jan 15 1992 Microsoft Technology Licensing, LLC Apparatus for efficiently accessing graphic data for rendering on a display
5673407, Mar 08 1994 Texas Instruments Incorporated Data processor having capability to perform both floating point operations and memory access in response to a single instruction
5696937, Apr 28 1995 Unisys Corporation Cache controller utilizing a state machine for controlling invalidations in a network with dual system busses
5713035, Mar 31 1995 International Business Machines Corporation Linking program access register number with millicode operand access
5717910, Mar 29 1996 IP-FIRST, LLC A DELAWARE LIMITED LIABILITY COMPANY Operand compare/release apparatus and method for microinstrution sequences in a pipeline processor
5721892, Aug 31 1995 Intel Corporation Method and apparatus for performing multiply-subtract operations on packed data
5726927, Sep 11 1995 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Multiply pipe round adder
5729554, Oct 01 1996 SAMSUNG ELECTRONICS CO , LTD Speculative execution of test patterns in a random test generator
5729724, Dec 20 1995 Intel Corporation Adaptive 128-bit floating point load and store operations for quadruple precision compatibility
5729728, Mar 01 1994 Intel Corporation Method and apparatus for predicting, clearing and redirecting unpredicted changes in instruction flow in a microprocessor
5734600, Mar 29 1994 IBM Corporation Polynomial multiplier apparatus and method
5734874, Apr 29 1994 Sun Microsystems, Inc Central processing unit with integrated graphics functions
5740340, Aug 09 1993 LSI Logic Corporation 2-dimensional memory allowing access both as rows of data words and columns of data words
5748979, Apr 05 1995 Xilinx, Inc Reprogrammable instruction set accelerator using a plurality of programmable execution units and an instruction page table
5752071, Jul 17 1995 Intel Corporation Function coprocessor
5758176, Sep 28 1994 International Business Machines Corporation Method and system for providing a single-instruction, multiple-data execution unit for performing single-instruction, multiple-data operations within a superscalar data processing system
5761523, Nov 13 1990 International Business Machines Corporation Parallel processing system having asynchronous SIMD processing and data parallel coding
5768172, Oct 04 1995 Apple Inc Graphic software functions without branch instructions
5774709, Dec 06 1995 AVAGO TECHNOLOGIES GENERAL IP SINGAPORE PTE LTD Enhanced branch delay slot handling with single exception program counter
5778241, May 05 1994 XIAM TREA PTE, L L C Space vector data path
5781457, Mar 08 1994 SAMSUNG ELECTRONICS CO , LTD Merge/mask, rotate/shift, and boolean operations from two instruction sets executed in a vectored mux on a dual-ALU
5784602, Oct 08 1996 ARM Limited Method and apparatus for digital signal processing for integrated circuit architecture
5790827, Jun 20 1997 Sun Microsystems, Inc. Method for dependency checking using a scoreboard for a pair of register sets having different precisions
5793661, Dec 26 1995 Intel Corporation Method and apparatus for performing multiply and accumulate operations on packed data
5794003, Nov 05 1993 INTERGRAPH HARDWARD TECHNOLOGIES COMPANY Instruction cache associative crossbar switch system
5796973, Oct 29 1993 Advanced Micro Devices, Inc. Method and apparatus for decoding one or more complex instructions into concurrently dispatched simple instructions
5798923, Oct 18 1995 Intergraph Hardware Technologies Company Optimal projection design and analysis
5809294, Jul 12 1991 Mitsubishi Denki Kabushiki Kaisha Parallel processing unit which processes branch instructions without decreased performance when a branch is taken
5812147, Sep 20 1996 Hewlett Packard Enterprise Development LP Instruction methods for performing data formatting while moving data between memory and a vector register file
5812723, Mar 24 1994 Kanagawa Academy of Science and Technology Optical fiber with tapered end of core protruding from clad
5815695, Oct 28 1993 Apple Inc Method and apparatus for using condition codes to nullify instructions based on results of previously-executed instructions on a computer processor
5815723, Nov 27 1991 International Business Machines Corporation Picket autonomy on a SIMD machine
5819117, Oct 10 1995 MicroUnity Systems Engineering, Inc. Method and system for facilitating byte ordering interfacing of a computer system
5822606, Feb 16 1996 CUFER ASSET LTD L L C DSP having a plurality of like processors controlled in parallel by an instruction word, and a control processor also controlled by the instruction word
5838984, Aug 19 1996 SAMSUNG ELECTRONICS CO , LTD Single-instruction-multiple-data processing using multiple banks of vector registers
5838986, Jul 08 1991 HANGER SOLUTIONS, LLC RISC microprocessor architecture implementing multiple typed register sets
5848255, Jun 19 1996 Mitsubushi Denki Kabushiki Kaisha Method and aparatus for increasing the number of instructions capable of being used in a parallel processor by providing programmable operation decorders
5848269, Jun 14 1994 Mitsubishi Denki Kabushiki Kaisha Branch predicting mechanism for enhancing accuracy in branch prediction by reference to data
5850452, Jul 29 1994 SGS-THOMSON MICROELECTRONICS, S A Method for numerically scrambling data and its application to a programmable circuit
5852726, Dec 19 1995 Intel Corporation Method and apparatus for executing two types of instructions that specify registers of a shared logical register file in a stack and a non-stack referenced manner
5864703, Oct 09 1997 ARM Finance Overseas Limited Method for providing extended precision in SIMD vector arithmetic operations
5867682, Jul 10 1995 GLOBALFOUNDRIES Inc High performance superscalar microprocessor including a circuit for converting CISC instructions to RISC operations
5875336, Mar 31 1997 International Business Machines Corporation Method and system for translating a non-native bytecode to a set of codes native to a processor within a computer system
5875355, May 17 1995 Apple Inc Method for transposing multi-bit matrix wherein first and last sub-string remains unchanged while intermediate sub-strings are interchanged
5880984, Jan 13 1997 International Business Machines Corporation Method and apparatus for performing high-precision multiply-add calculations using independent multiply and add instruments
5881307, Feb 24 1997 Samsung Electronics Co., Ltd.; SAMSUNG ELECTRONICS CO , LTD Deferred store data read with simple anti-dependency pipeline inter-lock control in superscalar processor
5887183, Jan 04 1995 International Business Machines Corporation Method and system in a data processing system for loading and storing vectors in a plurality of modes
5892960, Mar 28 1996 U.S. Philips Corporation Method and computer system for processing a set of data elements on a sequential processor
5918031, Dec 18 1996 Intel Corporation Computer utilizing special micro-operations for encoding of multiple variant code flows
5922066, Feb 24 1997 Samsung Electronics Co., Ltd.; SAMSUNG ELECTRONICS CO , LTD Multifunction data aligner in wide data width processor
5926642, Oct 06 1995 GLOBALFOUNDRIES Inc RISC86 instruction set
5933650, Oct 09 1997 ARM Finance Overseas Limited Alignment and ordering of vector elements for single instruction multiple data processing
5936872, Sep 05 1995 Intel Corporation Method and apparatus for storing complex numbers to allow for efficient complex multiplication operations and performing such complex multiplication operations
5944776, Sep 27 1996 Oracle America, Inc Fast carry-sum form booth encoder
5953241, Aug 16 1995 Microunity Systems Engineering, Inc Multiplier array processing system with enhanced utilization at lower precision for group multiply and sum instruction
5960012, Jun 23 1997 Oracle America, Inc Checksum determination using parallel computations on multiple packed data elements
5961629, Jul 08 1991 Seiko Epson Corporation High performance, superscalar-based computer system with out-of-order instruction execution
5996056, Jun 23 1997 Oracle America, Inc Apparatus for reducing a computational result to the range boundaries of a signed 8-bit integer in case of overflow
5996062, Nov 24 1993 Intergraph Hardware Technologies Company Method and apparatus for controlling an instruction pipeline in a data processing system
5996066, Oct 10 1996 Oracle America, Inc Partitioned multiply and add/subtract instruction for CPU with integrated graphics functions
6006316, Dec 20 1996 GOOGLE LLC Performing SIMD shift and arithmetic operation in non-SIMD architecture by operation on packed data of sub-operands and carry over-correction
6009261, Dec 16 1997 International Business Machines Corporation Preprocessing of stored target routines for emulating incompatible instructions on a target processor
6009450, Dec 24 1997 MOTOROLA SOLUTIONS, INC Finite field inverse circuit
6026420, Jan 20 1998 Hewlett Packard Enterprise Development LP High-speed evaluation of polynomials
6035120, May 28 1997 Oracle America, Inc Method and apparatus for converting executable computer programs in a heterogeneous computing environment
6035316, Aug 31 1995 Intel Corporation Apparatus for performing multiply-add operations on packed data
6035317, Jan 09 1997 SGS-THOMSON MICROELECTRONICS S A Modular arithmetic coprocessor comprising two multiplication circuits working in parallel
6041403, Sep 27 1996 Intel Corporation Method and apparatus for generating a microinstruction responsive to the specification of an operand, in addition to a microinstruction based on the opcode, of a macroinstruction
6058465, Aug 19 1996 Single-instruction-multiple-data processing in a multimedia signal processor
6058500, Jan 20 1998 Hewlett Packard Enterprise Development LP High-speed syndrome calculation
6065115, Jun 28 1996 Intel Corporation Processor and method for speculatively executing instructions from multiple instruction streams indicated by a branch instruction
6066178, Apr 10 1996 Bell Semiconductor, LLC Automated design method and system for synthesizing digital multipliers
6067615, Nov 30 1993 Northrop Grumman Systems Corporation Reconfigurable processor for executing successive function sequences in a processor operation
6073154, Jun 26 1998 XILINX, Inc.; Xilinx, Inc Computing multidimensional DFTs in FPGA
6078941, Nov 18 1996 Samsung Electronics Co., Ltd. Computational structure having multiple stages wherein each stage includes a pair of adders and a multiplexing circuit capable of operating in parallel
6088783, Feb 16 1996 CUFER ASSET LTD L L C DPS having a plurality of like processors controlled in parallel by an instruction word, and a control processor also controlled by the instruction word
6122738, Jan 22 1998 Symantec Corporation Computer file integrity verification
6128726, Jun 04 1996 V-SILICON SEMICONDUCTOR HANGZHOU CO LTD Accurate high speed digital signal processor
6138229, May 29 1998 NXP, B V F K A FREESCALE SEMICONDUCTOR, INC Customizable instruction set processor with non-configurable/configurable decoding units and non-configurable/configurable execution units
6141421, Dec 10 1996 Hitachi, Ltd. Method and apparatus for generating hash value
6141786, Jun 04 1998 Intenational Business Machines Corporation Method and apparatus for performing arithmetic operations on Galois fields and their extensions
6145077, May 17 1995 Apple Inc Manipulation of data
6154834, May 27 1997 Intel Corporation Detachable processor module containing external microcode expansion memory
6172494, Feb 23 1999 FUTURE LINK SYSTEMS Circuit arrangement for delivering a supply current
6181729, Dec 19 1997 Supergold Communication Limited Spread spectrum communication
6185668, Dec 21 1995 VANTAGE POINT TECHNOLOGY, INC Method and apparatus for speculative execution of instructions
6192491, Jun 15 1998 Cisco Technology, Inc. Data processor with CRC instruction set extension
6199087, Jun 25 1998 Hewlett-Packard Company Apparatus and method for efficient arithmetic in finite fields through alternative representation
6199088, Jun 30 1998 Maxtor Corporation Circuit for determining multiplicative inverses in certain galois fields
6233597, Jul 09 1997 Matsushita Electric Industrial Co., Ltd. Computing apparatus for double-precision multiplication
6243732, Oct 16 1996 Renesas Electronics Corporation Data processor and data processing system
6263429, Sep 30 1998 Synaptics Incorporated Dynamic microcode for embedded processors
6266758, Oct 09 1997 ARM Finance Overseas Limited Alignment and ordering of vector elements for single instruction multiple data processing
6279023, Dec 29 1997 Maxtor Corporation System for computing the multiplicative inverse of an element of a Galois field without using tables
6282635, Nov 24 1993 Intergraph Hardware Technologies Company Method and apparatus for controlling an instruction pipeline in a data processing system
6292883, Oct 02 1997 U S PHILIPS CORPORATION Converting program-specific virtual machine instructions into variable instruction set
6295599, Aug 24 1998 Microunity Systems Engineering, Inc System and method for providing a wide operand architecture
6298438, Dec 02 1996 GLOBALFOUNDRIES Inc System and method for conditional moving an operand from a source register to destination register
6314445, Aug 03 1998 International Business Machines Coproration Native function calling
6336178, Oct 06 1995 GLOBALFOUNDRIES Inc RISC86 instruction set
6349318, Apr 18 1997 Certicom Corp. Arithmetic processor for finite field and module integer arithmetic operations
6349377, Oct 02 1997 U S PHILIPS CORPORATION Processing device for executing virtual machine instructions that includes instruction refeeding means
6397241, Dec 18 1998 Freescale Semiconductor, Inc Multiplier cell and method of computing
6421817, May 29 1997 XILINX, Inc.; Xilinx, Inc System and method of computation in a programmable logic device using virtual instructions
6425124, Nov 08 1993 Matsushita Electric Industrial Co. Ltd. Resource allocation device for reducing the size and run time of a machine language program
6453407, Feb 10 1999 LANTIQ BETEILIGUNGS-GMBH & CO KG Configurable long instruction word architecture and instruction set
6480605, Dec 17 1997 Telegraph and Telephone Corporation Encryption and decryption devices for public-key cryptosystems and recording medium with their processing programs recorded thereon
6480872, Jan 21 1999 AVAGO TECHNOLOGIES GENERAL IP SINGAPORE PTE LTD Floating-point and integer multiply-add and multiply-accumulate
6513054, Feb 22 2000 The United States of America as represented by the Secretary of the Army Asynchronous parallel arithmetic processor utilizing coefficient polynomial arithmetic (CPA)
6523054, Dec 04 1998 Fujitsu Limited Galois field arithmetic processor
6587939, Jan 13 1999 Kabushiki Kaisha Toshiba Information processing apparatus provided with an optimized executable instruction extracting unit for extending compressed instructions
6615366, Dec 21 1999 Intel Corporation Microprocessor with dual execution core operable in high reliability mode
6625726, Jun 02 2000 Advanced Micro Devices, Inc. Method and apparatus for fault handling in computer systems
6625737, Sep 20 2000 ARM Finance Overseas Limited System for prediction and control of power consumption in digital system
6651160, Sep 01 2000 ARM Finance Overseas Limited Register set extension for compressed instruction set
6658561, May 31 1999 GOOGLE LLC Hardware device for executing programmable instructions based upon micro-instructions
6711602, Feb 18 2000 Texas Instruments Incorporated Data processor with flexible multiply unit
6760742, Feb 18 2000 Texas Instruments Incorporated Multi-dimensional galois field multiplier
6892293, Nov 05 1993 Intergraph Hardware Technologies Company VLIW processor and method therefor
6952478, May 05 2000 Teleputers, LLC Method and system for performing permutations using permutation instructions based on modified omega and flip stages
6976178, Sep 20 2000 ARM Finance Overseas Limited Method and apparatus for disassociating power consumed within a processing system with instructions it is executing
7003715, Mar 30 2001 Cisco Technology, Inc.; Cisco Technology, Inc Galois field multiply accumulator
7142668, Apr 09 1999 Fujitsu Limited Apparatus and method for generating expression data for finite field operation
7162621, Feb 21 2001 ARM Finance Overseas Limited Virtual instruction expansion based on template and parameter selector information specifying sign-extension or concentration
7181484, Feb 21 2001 ARM Finance Overseas Limited Extended-precision accumulation of multiplier output
20010052118,
20020013691,
20020062436,
20020069402,
20020116428,
20030172254,
20060190518,
DE19644688,
EP681236,
EP757312,
JP1011289,
JP11003226,
JP11174955,
JP2000293507,
JP2000321979,
WO9707450,
WO9708608,
////////////
Executed onAssignorAssigneeConveyanceFrameReelDoc
Feb 21 2001MIPS Technologies, Inc.(assignment on the face of the patent)
Sep 25 2001PAILLIER, PASCALMIPS Technologies, IncASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0122970871 pdf
Oct 03 2001GEMPLUS INTERNATIONAL S A MIPS Technologies, IncASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0125070257 pdf
Oct 12 2001KISSELL, KEVIN D MIPS Technologies, IncASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0122970871 pdf
Oct 15 2001STRIBAEK, MORTENMIPS Technologies, IncASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0122970871 pdf
Jun 23 2003KISSELL, KEVIN D MIPS TECHNOLOGIES INC ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0142630078 pdf
Jun 27 2003MIPS TECHNOLOGIES INTERNATIONAL AGMIPS TECHNOLOGIES INC ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0142630078 pdf
Jun 27 2003PARALOGOS S A R L MIPS TECHNOLOGIES INC ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0142630078 pdf
Aug 24 2007MIPS Technologies, IncJEFFERIES FINANCE LLC, AS COLLATERAL AGENTSECURITY AGREEMENT0197440001 pdf
Dec 05 2008JEFFERIES FINANCE LLC, AS COLLATERAL AGENTMIPS Technologies, IncRELEASE BY SECURED PARTY SEE DOCUMENT FOR DETAILS 0219850015 pdf
Feb 06 2013MIPS Technologies, IncBridge Crossing, LLCASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0302020440 pdf
Jan 31 2014Bridge Crossing, LLCARM Finance Overseas LimitedASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0330740058 pdf
Date Maintenance Fee Events
Nov 04 2013M1551: Payment of Maintenance Fee, 4th Year, Large Entity.
Oct 19 2017M1552: Payment of Maintenance Fee, 8th Year, Large Entity.
Oct 20 2021M1553: Payment of Maintenance Fee, 12th Year, Large Entity.


Date Maintenance Schedule
May 04 20134 years fee payment window open
Nov 04 20136 months grace period start (w surcharge)
May 04 2014patent expiry (for year 4)
May 04 20162 years to revive unintentionally abandoned end. (for year 4)
May 04 20178 years fee payment window open
Nov 04 20176 months grace period start (w surcharge)
May 04 2018patent expiry (for year 8)
May 04 20202 years to revive unintentionally abandoned end. (for year 8)
May 04 202112 years fee payment window open
Nov 04 20216 months grace period start (w surcharge)
May 04 2022patent expiry (for year 12)
May 04 20242 years to revive unintentionally abandoned end. (for year 12)