This is a reissue application of U.S. patent application Ser. No. 10/383,416 that was filed on Mar. 6, 2003 (which issued as U.S. Pat. No. 7,558,969 that issued on Jul. 7, 2009).
The present invention relates to semiconductor integrated circuits and, in particular, to circuitry that combats the theft of intellectual property contained within integrated circuits.
The anti-pirate circuitry disclosed herein is intended to combat the theft of intellectual property contained within integrated circuits (IC), such as patent protected circuits, copyrighted works, mask works and computer software.
Unfortunately, the theft of integrated circuit technology is not always prevented by the existence of legal barriers to its use. While a new circuit design may have significant commercial value, it may not be possible or practical to obtain or enforce patent rights in all countries of the world in which the circuit will be made, sold or used. While mask work and copyright protection may be available even if patent protection is not, the pirating and unauthorized copying of integrated circuit designs continues to cause serious economic harm to the original developers and owners of IC intellectual property.
It would, therefore, be highly desirable to have available a low cost, but effective technique for combating IC pirates.
An anti-pirate circuit in accordance with the present invention includes unique number generator circuitry, one time programmable (OTP) EPROM circuitry and ID comparator circuitry. The unique number generator circuitry provides a multi-bit die ID data string that is unique to the integrated circuit associated with the anti-pirate circuit. The OTP EPROM circuitry reads the die ID data string from the unique number generator at wafer sort and stores the die ID data string in a nonvolatile memory. During a subsequent verification cycle, the ID comparator circuitry compares the die ID data string provided by the unique number generator to the data content stored by the OTP EPROM. If the comparison results in a mismatch between more than a predefined number of bits, then the IC associated with the anti-pirate circuit is not enabled for operation.
The disclosed anti-pirate circuit does not make the pirating or copying of the IC mask set any more difficult. Rather, it forces the pirate to not only duplicate the IC mask set, but also duplicate a large portion of the product manufacturing flow, including hardware (fabrication and test equipment) and software (wafer sort test software). Although there is no perfect hardware/software anti-piracy circuit, the circuit of the present invention forces the pirate to invest so much time and money to “crack” the product that it renders the theft economically non-viable. The protection provided by this circuit is nearly absolute for most commercial IC pirates.
The features and advantages of the present invention will be more fully understood and appreciated upon consideration of the following detailed description and the accompanying drawings which set forth an illustrative embodiment in which the principles of the invention are utilized.
An anti-pirate circuit in accordance with the present invention, when added to an integrated circuit chip, requires that the manufacturer add steps to the product development and test flow. These extra steps are not expensive to the manufacturer because the circuitry itself is small and, in most cases, the manufacturer must already test the chip before packaging (i.e., wafer sort tests).
As discussed in greater detail below, the anti-pirate circuit is interrogated at wafer sort to determine the chip's die ID and then the die ID is programmed into the anti-pirate circuit's nonvolatile memory. Not until this Read/Program cycle is completed, and a subsequent verification cycle is also successfully completed, is the chip's original operational circuitry allowed to function correctly. In other words, the anti-pirate circuit is a type of “chip enabler” that is activated at wafer sort.
These extra steps require the IC pirate to not only duplicate the IC mask set, but the pirate must also duplicate the wafer sort equipment and at least a portion of the wafer sort test program before the pirated mask set can be used to produce activated (working) chips.
An embodiment of an anti-pirate circuit in accordance with the present invention will now be described twice: first at the block level so that the concepts employed will be understood, and second, at the gate level.
As shown in
The unique number generator circuitry 102 provides a 256-bit data string referred to herein as the “die ID.” The die ID is unique to each and every IC die, i.e., no two IC dice have the same die ID. Those skilled in the art will appreciate that the die ID data string is not required to be 256 bits, but may be longer or shorter depending upon the desired level of security.
The 256 bit OTP EPROM circuitry 104 is a non-volatile memory that is only programmable at wafer sort. The OTP EPROM 104 contains all the logic necessary to read the data contents, i.e., the die ID, provided by the unique number generator 102 and to transfer this data to the non-volatile memory (i.e., READ/WRITE logic.) If the general logic of the chip already includes a non-volatile memory, then the OTP EPROM 104 can be instantiated as a portion of that memory; as stated above, the OTP EPROM portion of the non-volatile memory is, preferably, only programmable at wafer sort. Note that “imbedding” the OTP EPROM 104 within the general logic of the chip serves to “hide” it's location and purpose, making it more difficult to reverse engineer and defeat.
During the verification cycle, described in greater detail below, the ID comparator 106 compares the die ID data string from the unique number generator 102 to the stored data contents of the OTP EPROM 104. Note that, in the disclosed embodiment of the invention, the stored data can vary by as much as 31 bits and still be considered a “match” with the die ID data string; if the stored data vary by more than 31 bits, then a “mismatch” is declared. As with the OTP EPROM 104, preferably, the ID comparator 106 is “imbedded” within the general logic of the chip, thereby “hiding” its location and purpose, making it more difficult to reverse engineer and defeat. Furthermore, for maximum protection, portions of the ID comparator 106 circuitry can be made to have a dual purpose (i.e., part of the anti-pirate circuit 100 and also a fundamental part of the general logic of the chip). If this is the case, then disabling the anti-pirate function of the ID comparator 106 also disables the general logic of the chip.
At wafer sort, the die ID data string is read from the unique number generator 102 and programmed into the OTP EPROM 104. Since the OTP EPROM 104 can only be programmed at wafer sort, this operation must be performed and verified before packaging of the IC chip. Before correct operation of the chip can begin, the ID comparator 106 must compare the die ID contents of the unique number generator 102 to the stored data content of the OTP EPROM 104. If the ID's are declared a “match”, then the output 108 of the ID comparator 106 is driven “active”, shown in
In the disclosed embodiment of the invention, the unique number generator 102 is a serial 256-bit read only memory. The data contents of the memory is unique to each and every die and is determined by the electrical “mismatch” of MOS transistors. As stated above, the 256-bit data string is referred to as the die ID. The die ID is very stable, but statistically as many 24 bits can change from one read cycle to another. In the disclosed embodiment of the invention, a die ID “match” is declared when the number of mismatched bits is less than 32.
Referring to the
The OTP EPROM 104 is a 256-bit serial access non-volatile memory. In the well known manner, it contains all the circuitry required to write a data pattern into the memory and to read the pattern from the memory. Referring to the programming waveforms of
Referring to
As stated above, the ID comparator 106 compares and counts the number of mismatched bits presented by the unique number generator 102 and the OTP EPROM 104. As shown in
Another feature of the ID comparator 106 is the requirement that the ID comparator circuit 106 count a minimum of two mismatched bits. This is achieved by using an RS Latch 112, which is reset when ENABLE_N is “high” and set when Counter Output Q1, is toggled “high”. Therefore, counter output Q1 must toggle to a “1” in order for the ID_Match output to go “high”. This feature is added to the logic of the ID comparator 106 in order to make defeating the circuit more difficult. The pirate cannot simply defeat the circuit by forcing both data streams to all “0” or all “1”, nor can the pirate force the comparator output “low”, nor can the pirate disable the clock. The manufacturer will choose the last nibble of data (ID bits 251-255) to purposely invert before copying into the OTP EPROM 104.
The level of security can be increased by utilizing conventional encryption circuitry to encrypt the die ID pattern generated by the unique number generator 102 before programming it into the OTP-EPROM 104. This action will force the IC pirate to decipher the encoding algorithm before the pirate can properly program the OTP EPROM 104 at wafer sort. The downside is that the manufacturer must also include the decryption hardware/software “on chip” to decipher the data pattern produced by the OTP EPROM 104 and reconstruct the original die ID pattern 102 before presenting it to the ID comparator 106. As shown in
As shown in
It should be understood that various alternatives to the embodiments of the invention described herein may be employed in practicing the invention. It is intended that the following claims define the scope of the invention and that circuits and methods within the scope of these claims and their equivalents be covered thereby.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5034980 | Kubota | Jul 1991 | A |
| 5208447 | Kruse | May 1993 | A |
| 5467396 | Schossow et al. | Nov 1995 | A |
| 6240517 | Nishioka | May 2001 | B1 |
| 6384713 | Yu | May 2002 | B1 |
| 6802447 | Horng | Oct 2004 | B2 |
| 6941536 | Muranaka | Sep 2005 | B2 |
| 6973570 | Hamlin | Dec 2005 | B1 |
| 7143294 | Johnson | Nov 2006 | B1 |
| 7282377 | Muranaka | Oct 2007 | B2 |
| RE40188 | Lofstrom | Mar 2008 | E |
| 7681103 | Devadas et al. | Mar 2010 | B2 |
| 7757083 | Devadas et al. | Jul 2010 | B2 |
| 7818569 | Devadas et al. | Oct 2010 | B2 |
| 7840803 | Clarke et al. | Nov 2010 | B2 |
| 20040170068 | Williams | Sep 2004 | A1 |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 10383416 | Mar 2003 | US |
| Child | 13011649 | US |