This invention relates generally to an authentication technique for an article used in a host device. More specifically, one particular embodiment of this invention relates to an improvement to an ink cassette or cartridge in a thermal marking apparatus wherein the ink cassette or ribbon cartridge may be authenticate as being of a suitable type and coming from an authorized source.
Other approaches have been tried for authenticating consumables in a host, but none of these have proven satisfactory. In particular, the background approaches discussed below do not provide an effective anti-piracy deterrent. These previously known approaches do not provide adequate authentication and can often be defeated by copying, spoofing, or similar techniques.
One early technique to authenticate consumables relied on keyed shapes of the consumable. Such keyed shapes can be designed so that only a consumable in the keyed shape will fit into a given type of host. As one example, a particular brand of razor can be adapted to receive only razor blades having a particular keyed shape. As a second example, an ink jet printer can be adapted to receive only refill ink cartridges having a particular keyed shape. The use of such a keyed shape can prevent interchange of consumables between different types of host. That approach is generally ineffective for anti-piracy, however, because the keyed shape of the consumable can be readily observed and easily duplicated.
Also unsatisfactory are the “challenge and response” authentication algorithms used in transponders intended for automobile security systems, such as the Atmel TK556, and equivalents. Automotive security systems were designed for “one lock, few keys” applications, where a single secret number is programmed into each key and each lock. If a host device, such as a printer or a camera, is the “lock,” then such challenge-response transponders require that all the keys (media) and locks (printers) be programmed with the same secret number.
It is known to provide encodements on consumables, such as film units and/or hosts such as cameras, for identification purposes and to convey information about the film unit or camera. The term “encodement” very broadly describes a feature of physical media used to communicate one or more pieces of information to a machine. “Encodement” includes alphanumeric text and other indicia, symbols, and the like. An encodement can be detectable by various means, including but not limited to optical, magnetic, and/or punch readers.
U.S. Pat. No. 6,106,166 discloses a device having a transponder and a transceiver. An electrically or electronically programmable read/write memory contained in the transponder is integrally attached to a consumable. The transponder is capable of receiving a first RF frequency electromagnetic field and deriving power and address information therefrom, and then generating a second RF frequency electromagnetic field in response. The second electromagnetic field is characteristic of the data stored in memory. A transceiver is disposed within the host with an antenna and support components for polling each transponder. As instructed by a control logic processor, the transceiver can read manufacturing data from the transponder and write usage and processing data to the transponder for storage in memory.
Radio-frequency identification transponders are widely available in a variety of forms. One form, referred to as “inlay transponders” are identification transponders that have a substantially flat shape. The antenna for an inlay transponder is in the form of a conductive trace deposited on a non-conductive support. The antenna may have the shape of a flat coil and the like. Leads for the antenna are also deposited, with non-conductive layers interposed as necessary. Memory components, RF communications, and any control functions are provided by a chip mounted on the support and operatively connected through the leads to the antenna. Inlay transponders have been used as layers of identification tags and labels to provide encodements that are accessible at a distance. A camera having a radio-frequency identification transponder that can be accessed for writing and reading at a distance is disclosed in U.S. Pat. No. 6,173,119.
Another known type of transponder is a radio frequency identification (RFID) transponder. An RFID transponder can typically include a unique identifier installed by the manufacturer in non-volatile memory.
With respect to host devices, it is known to provide a consumable article, such as a print cartridge, with a transponder. The host device, such as a printer into which the cartridge is installed, includes a transceiver for detecting the type of media on the print cartridge. A transceiver and transponder of this general type are disclosed in U.S. Pat. No. 6,099,178 to Spurr et al. The Spurr patent discloses a printer adapted to sense the type of media installed and includes a radio frequency transceiver for transmitting a first electromagnetic field, and for sensing a second electromagnetic field. However, Spurr does not teach or suggest a means for authenticating the media bearing the transponder. The information encoded in the transponder in Spurr can be easily forged, thus rendering the system ineffective as an anti-piracy measure.
International Publication Number WO 98/52762 discloses an inkjet printer that uses an RFID tag for identifying the type of paper that is loaded in an inkjet printer. That approach offers contactless communication with a read/write memory that is added to the inkjet roll. That publication, however, does not teach or suggest an authentication method and apparatus in accord with this disclosure.
A need exists, therefore, for an effective anti-piracy measure using a transponder and transceiver for sensing information encoded on a consumable article for use in a host device, such as media for use in a printer.
It is believed that the invention will be better understood from the following description when taken in conjunction with the accompanying drawings, wherein:
The present description is directed in particular to elements forming part of, or cooperating more directly with, the apparatus in accordance with the invention. It is to be understood that elements not specifically shown or described can take various forms known to those skilled in the art. In this description the term “consumable” refers to a component designed to be used up and replaced in a device referred to as a host. Examples of consumables and their respective hosts include ink jet reservoirs for use in printers, film for use in cameras, a ribbon for use on a typewriter, and/or a toner cartridge for use in a copier.
Referring now to
Still referring to the embodiment shown in
In accord with the illustrated embodiment of
An authentication number, x, is calculated using an encryption function, F, selected by and confidential to the manufacturer of the ribbon cartridge consumable article (120). The authentication number is permanently stored on the RFID transponder (130). The encryption function F is made available to the printer host device (100) during operation thereof. For example, in one embodiment shown in
Every printer (100) from a given manufacturer may be programmed with the same encryption algorithm at the factory. When the ribbon cartridge consumable article (120) is produced, the same encryption algorithm used to generate the authentication number is provided in the printer. Once the ribbon cartridge consumable article (120) is installed, the transponder's unique serial number, n, is read. In a preferred embodiment, transponder's unique serial number, n, is already locked into the RFID transponder (130) memory by the manufacturer.
The manufacturer of the ribbon cartridge consumable article (120) also knows the type of media to be made, y. In another embodiment, the values of both n and also y are combined to be used in the encryption algorithm to calculate the authentication code x. The manufacturer of the ribbon cartridge consumable article (120) then programs and locks the values x and y into the transponder (130) memory. The transponder (130) is permanently mounted on to the ribbon cartridge consumable article (120). An effectively unlimited number of unique media rolls or cassettes can be produced in this manner, each containing a uniquely programmed and locked value of serial number n, media type number y, and authentication number x.
Although the serial number n, media type number y, and the authentication number x are freely readable, the confidential encryption function, F, are preferably selected from a known class of functions having no obvious inverse. Accordingly, such functions are difficult to decode, thus providing secure authentication. A ribbon cartridge consumable article (120) counterfeiter would have to reconstruct the algorithm F available to the printer (100) in order to make a counterfeit ribbon cartridge consumable article (120) work on a printer (100) according to the embodiment depicted in
If a value of x is calculated as some complicated function of the unique and non-copyable transponder serial number n, then the values of n and x can both be stored on the RFID transponder (130), where both numbers are unencrypted and readable by anyone. Optionally, if a media type number, y, is also used in the transformation, it can also be stored on the RFID transponder. When the ribbon cartridge consumable article (120) is installed on the printer (100), the printer can read both x and n (and, optionally, y) from the transponder and validate that the read value of x is correct for the read value of n (and optionally, y), thus validating the ribbon cartridge consumable article (120) for the corresponding printer (100).
Judicious selection of an algorithm for F from among known strong encryption algorithms can make the breaking of this security system very difficult and, in practice, prohibitively expensive. The authentication code x can be calculated using cryptographic methods by applying some function to encrypt n. The only information available to the counterfeiter is that a given ribbon's authentication code x is correct for a given serial number n. More particularly, the counterfeiter will not know or be able to learn how the value of x was obtained for a given n. Nor can the counterfeiter randomly try all possible values of n, because the associated values of x will not be known unless the counterfeiter has obtained a valid media roll having both that n and the correct authentication code x. Thus, the counterfeiter has only limited samples of n, x to test.
The same is true for embodiments in which x is calculated as a function of both the serial number n and the media type number y. The authentication code x can be calculated using cryptographic methods by applying some function to encrypt n and y. Again, the only information available to the counterfeiter is that a given ribbon's authentication code x is correct for a given pair n, y.
As a further defense against the security system being compromised, a plurality of functions defining acceptable relations among the test values can be stored on the host device. The consumable article can then be programmed with a plurality of authentication codes, each of which satisfies a particular authentication functional relationship. If it is learned that any particular authentication function has been compromised, then media can be validated using one of the other authenticating functions and authentication values. The compromised authentication function can be disabled in the host device to prevent authentication of pirated media made using the compromised authentication function. For example, the compromised authentication function can be disabled in response to a flag set in subsequent media or by updates to the host device software or firmware.
As is know in the art, the host device or printer (100) includes suitable memory; such as RAM, ROM, EEPROM and the like, input/output devices, computer or central processor, optional disc storage and associated support devices, all of which are not shown. The computer may be, for example, an IBM compatible computer having, for example, a Pentium® or Intel family microprocessor. Alternatively, the computer may be APPLE® compatible having a Motorola family microprocessor. However, the computer or central processor may be any computer, processor, central processing unit (CPU), microprocessor, RISC (reduced instruction set computer), mainframe computer, work station, single chip computer, distributed processor, server, controller, micro-controller, discrete logic device, remote computer, interne computer or web computer. The memory and/or the disk storage associated with the computer is configured to store program instructions representing the algorithms and processing steps described herein. Such program instructions may be “downloaded” from disk storage or from non-volatile memory, such as ROM, PROM, EPROM, and the like, or may be downloaded from a remote source via a network or other communication link.
Referring now to the embodiment shown in
For simplicity of description, the execution of the invention next described will employ only the serial number n and the authentication number x. However, it is also within the scope of the invention to use a media type number y in conjunction with the serial number n to compute the authentication number x. The use of the serial number n can differ from the use of the media type number y in that the serial number can be permanently fixed in the RFID transponder when it is manufactured and can be unique to each transponder. On the other hand, the media type number y can be stored in the RFID transponder at the factory and is the same for each media of a given type. However, the use of the serial number n in the authentication or encryption calculations described here is the same as the use of the media type number y.
An alternative embodiment of a sequence of operations for preparing an authenticatable consumable article to use in a host device is illustrated in
The parameters M and Q are two prime values, which are related by M being the primitive element of a prime Galois Field GF(Q) of order Q. After settling on an encryption function in the select authentication function FM,Q process (202′), the next step is the read RFID transponder serial number n process (204). The next step in the embodiment of
As is known from Galois Field number theory, functions G that produce these values can compromise the security of the encryption function FM,Q. An appropriate preparatory function G(n,y) having been selected, the next step in the sequence of operations shown in the particular embodiment illustrated in
This is shown in the embodiment illustrated in
Referring still to the embodiment of
A used consumables list data (470) is made available to the host device in this embodiment to confirm that a previously used up cartridge is not being inserted. After the consumable is validated, it is used in the host in a use consumable process (460) as, for example, by using a ribbon cartridge to print product. In one embodiment, when it is determined that the consumable article has been completely expended by the use consumable process (460), an identifier of the consumable article (such as the unique serial number n) will be stored in a used consumable list data (470) indicating that the particular consumable article is completely used. In another embodiment, the used consumable list data (470) can include an identification of all consumable articles loaded into the host device and the percentage of life remaining in each consumable article. The used consumable list data (470) can inexpensively store information regarding a large number of previously used consumables such as, for example, a list of the last 512 print cartridges used in a plastic card printer. If a ribbon cassette or ribbon roll reappears with a higher value of remaining panel count than stored in the plastic card printer memory, the plastic card printer treats the reloaded ribbon cassette or ribbon roll as if it had an invalid authentication, and not only can refuse to use that media, but also can lock its transponder into “fully used” status.
Referring next to the embodiment of
Referring next to
Referring now to
Second, the low-cost RFID transponders preferable has the ability to one-time write (or write and lock) data values, x and y, into a public data area (825) of the transponder. The value y in this particular embodiment is the media type information, since not all media types work on all printer types. The non-zero data value x for this illustrative mode will be a complicated function of y and the unique identification number n of that transponder. The value x in this depicted example will be factory programmed into the transponder at the time the media is made, or at least before it leaves the manufacturer's facility.
Both the Philips I*Code and equivalents and any International Standards Organization (“ISO”) 15693 standard compliant 13.56 MHz RFID transponders have a factory-programmed, non-copyable 48-bit serial number with the ability to permanently store a corresponding authentication code (derived from the serial number) in the chip. Section 4.1 of ISO 15693 specifies that each compliant transponder shall be identified by a 64-bit Unique Identifier (UID), which shall be set permanently by the IC manufacturer, and shall be structured as follows:
The most significant byte shall be ‘E0’ hex, followed by an 8-bit IC manufacturer code, which is assigned per ISO 7816-6/AM1. The 48-bit serial number shall be assigned by the identified IC manufacturer. It is expected that various manufacturers will produce compliant ISO 15693 transponders with factory programmed serial numbers and unique manufacturers' IDs registered under ISO 7816. The manufacturer's unique 8-bit ID, or a list of qualified manufacturers' IDs, can be included as part of the authentication process.
Referring still to the specific embodiment of
The consumable article preferably includes flags (827) to indicate the number of units of media such as panels of ribbon used on the consumable article. Each ribbon roll core or cassette can only be used once. Other memory elements in the transponder keep track of media usage, and remaining media count. Flags in the transponder memory are reset and locked as each unit portion (typically 10-15%) of that media is used. Since only a maximum of 15% of additional media can be reloaded on the core or cassette, this makes reuse of partially used cores or cassettes economically unattractive. Of course, the flags may be used to indicate any degree of usage.
Referring still to the embodiment illustrated in
Referring next to
One embodiment of a circuit board suitable for practicing one mode of the invention is shown in
Referring next to
Referring next to
Referring now to
Referring now to
Second, the low-cost type of RFID transponders can preferably have the ability to one-time write (or write and lock) data values, x and y, into a public data area (1525) of the transponder. The value y in this particular embodiment is the media type information, since not all medias work on all printer types. The non-zero data value, x, for this illustrative mode will be a complicated function of y and the unique identification number n of that transponder. The value x in this depicted example can be factory programmed into the transponder at the time the media is made, or at least before it leaves the manufacturer's warehouse.
Also shown is a host device (1550), which includes a communication component (1555, 1560) for reading the values of n, x, and y stored on the consumable article. A processor (1565) can receive the information stored on the consumable article and can use an authentication function (1570) F(M,Q,x,y) available to the processor to confirm that an authenticating relationship exists between the authentication code x and the serial number n and the media type code y. The processor (1565) can be remote from the host device and may communicate with the host device through a communications channel (1590), such as a network or a telecommunications link.
The consumable article preferably includes flags (1527) to indicate the number of units of media, such as panels of ribbon, used on the consumable article. Each ribbon roll core or cassette can only be used once. Other memory elements in the transponder keep track of media usage, and remaining media count. Flags in the transponder memory can be reset and locked as each portion (typically 10-15%) of that media is used. Because only a maximum of 15% of additional media can be reloaded on the core or cassette, this makes reuse of partially used cores or cassettes economically unattractive.
Referring still
Implementation of the above described method and apparatus includes repeated operations of the form MN, where M and N are both large prime numbers. When M and N are both large prime numbers, then MN can be theoretically become hundreds of digits (or bits). To better implement the above described authentication algorithm, a method has been derived that allows both MN to be quickly evaluated in a small microprocessor and restrict the number of bits to twice the length of Q.
As an example, assume that M<<Q and Q is 64 bits, so that a 64-bit times 64-bit multiply (128-bit result) is all that is required. This example is offered by way of illustration, and other embodiments are possible.
Let N be defined as a 64-bit binary number, which is some function of n and y.
In this equation, each ci represents successive binary digits. Substituting the above into MN yields:
Using this transformation of MN, the equation MN mod Q can be evaluated using the lemma:
(a×b)modc=[(amodc)×(bmodc)]modc Equation 3
Applying this lemma yields:
Letting
Ti=(Mc
then
Each term Ti can now be evaluated using the fact that each ci is either 0 or 1.
if ci=0 then Ti=Mc
if ci=1 then Ti=Mc
The up to 64 values of Ti for ci=1 can be either be previously calculated and stored in a table or can be sequentially evaluated. Using this table or these calculated values for Ti, the value of MN mod Q can be evaluated progressively. Let Pi be the partial product at each stage, i, from 1 to 63. Calculating in a recursive, pair-wise manner:
until
MN modQ=P63=(P62×T63)modQ Equation 9
Using the fact that when ci=0 then Ti=1 cuts the number of 64×64 bit multiplication operations by 50% on the average. In order to implement the security system described herein, however, there remains a need for a fast 64-bit modulo Q operation on a 128-bit number.
For each of the steps above when ci=1 a reduction of form (W mod Q) must be performed. Normally, this is done by an integer long division operation to find the integer remainder. In the case here, where the divisor Q is of order 64 bits and the dividend W is of order 128 bits, a great number of shift and subtract operations must be performed.
To better implement the security system described herein, a method that is approximately 20 times faster than long division has been developed. Assume that Q is chosen to be
Q=2n−k, where k<<2n Equation 10
This includes the Mersenne Prime numbers, of form 2n−1. But, if (W div Q) can be accurately estimated (that is, the integer quotient of the division operation) then the remainder can easily be easily found by:
WmodQ=W−Q×(WdivQ) Equation 11
The integer quotient of the division operation can be estimated as follows. First, write the equivalence
Multiplying both the numerator and denominator of the right side by 2−n yields
Because Q is typically larger (here on the order of n ˜63 bits), then (2−n k)<<1 and the denominator in Equation 14 can be expanded using the infinite series
Substituting Equation 14 into Equation 13 yields:
Evaluating the first few terms of Equation 15 reveals that
WdivQ≈int(2−nW+w−2nkW+2−3nk2w+ . . . ) Equation 16
Knowing the maximum values of n, k, and W, one can evaluate the terms of Equation 16 until the first term is found which is sufficiently small (such as less than ½) so that further terms will not affect the integer portion since all subsequent terms will be smaller. These terms that will not affect the value of the integer portion can then be safely ignored in the evaluation of Equation 16.
In practice, W, Q and k can be chosen so that Equation 16 converges after only a few terms. This method of calculating W mod Q proves in practice to be many times faster than finding it by long division directly.
As another example of an alternate embodiment, the consumable and the host can communicate by an optical coupling. Other examples include electrical contracts and magnetic read-write heads. This invention is not limited to any of the particular exemplary modes of communication between the consumable and the host enumerated in this description, and the claims below are intended to cover any suitable mode of communication.
Whereas the invention has been described as being preferably applied to a media processing system in the form of a thermal transfer printer, the invention has equal applicability to thermal printers, such as described in U.S. Pat. Nos. 5,266,968 and 5,455,617, photoprocessing apparatus, such as described in U.S. Pat. No. 6,106,166, photographic cameras, such as described in U.S. Pat. No. 6,173,119, X-ray cameras, such as described in U.S. Pat. No. 5,428,659, ink jet printers, laser printers, and the like. Whereas the invention has been depicted as applied to a media processing system wherein the media assembly and media processing system communicate wirelessly, the invention is also readily adapted for use in systems wherein the media assembly and media processing system communicate by a wired connection, as shown in U.S. Pat. Nos. 5,266,968 and 5,455,617.
Specific embodiments of the present method and apparatus have been described for the purpose of illustrating the manner in which the invention may be made and used. It should be understood that implementation of other variations and modifications of the invention and its various aspects will be apparent to those skilled in the art, and that the invention is not limited by the specific embodiments described. It is therefore contemplated to cover by the present invention any and all modifications, variations, or equivalents that fall within the true spirit and scope of the basic underlying principles disclosed and claimed herein.
This application is a continuation of application Ser. No. 11/364,354, filed Feb. 28, 2006 now U.S. Pat. No. 7,664,257, entitled Method and Apparatus for Article Authentication, which is a divisional of application Ser. No. 10/164,070, filed Jun. 6, 2002 now U.S. Pat. No. 7,137,000, and claims benefit of provisional application 60/314,926 filed Aug. 24, 2001, entitled Method and Apparatus for Consumable Authentication, all of which are incorporated herein by reference in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
3729362 | French et al. | Apr 1973 | A |
3956615 | Anderson et al. | May 1976 | A |
4111121 | Borum | Sep 1978 | A |
4132583 | Hodgson | Jan 1979 | A |
4496237 | Schron | Jan 1985 | A |
4516208 | Sakura et al. | May 1985 | A |
4663622 | Goldman | May 1987 | A |
4691202 | Denne et al. | Sep 1987 | A |
4783798 | Leibholz et al. | Nov 1988 | A |
4807287 | Tucker et al. | Feb 1989 | A |
4839642 | Batz et al. | Jun 1989 | A |
4846504 | Macgregor et al. | Jul 1989 | A |
4855754 | Tanaka et al. | Aug 1989 | A |
4857893 | Carroll | Aug 1989 | A |
4870459 | Ito et al. | Sep 1989 | A |
4882604 | Kato et al. | Nov 1989 | A |
4930915 | Kikuchi et al. | Jun 1990 | A |
4961142 | Elliott et al. | Oct 1990 | A |
4970531 | Shimizu et al. | Nov 1990 | A |
4993068 | Piosenka et al. | Feb 1991 | A |
5010573 | Musyck et al. | Apr 1991 | A |
5015834 | Suzuki et al. | May 1991 | A |
5024718 | Hannen | Jun 1991 | A |
5036461 | Elliott et al. | Jul 1991 | A |
5041826 | Milheiser | Aug 1991 | A |
5066978 | Watarai et al. | Nov 1991 | A |
5078523 | McGourty et al. | Jan 1992 | A |
5132729 | Matsushita et al. | Jul 1992 | A |
5148534 | Comerford | Sep 1992 | A |
5167752 | Dowling | Dec 1992 | A |
5189246 | Marsh et al. | Feb 1993 | A |
5196840 | Leith et al. | Mar 1993 | A |
5216464 | Kotani et al. | Jun 1993 | A |
5229587 | Kimura et al. | Jul 1993 | A |
5239294 | Flanders et al. | Aug 1993 | A |
5266968 | Stephenson | Nov 1993 | A |
5272503 | LeSueur et al. | Dec 1993 | A |
5282421 | Marsh et al. | Feb 1994 | A |
5283597 | Yoshida et al. | Feb 1994 | A |
5283613 | Midgley, Sr. | Feb 1994 | A |
D347021 | Adams et al. | May 1994 | S |
5318370 | Nehowig | Jun 1994 | A |
5333960 | Nam | Aug 1994 | A |
5340968 | Watanabe et al. | Aug 1994 | A |
5353009 | Marsh et al. | Oct 1994 | A |
5355413 | Ohno | Oct 1994 | A |
5379344 | Larsson et al. | Jan 1995 | A |
5385416 | Maekawa et al. | Jan 1995 | A |
5387302 | Bernard et al. | Feb 1995 | A |
5400319 | Fite et al. | Mar 1995 | A |
5406890 | Marsh et al. | Apr 1995 | A |
5428659 | Renner et al. | Jun 1995 | A |
5452059 | Sekiya | Sep 1995 | A |
5455617 | Stephenson et al. | Oct 1995 | A |
5479467 | Katsumata | Dec 1995 | A |
5491540 | Hirst | Feb 1996 | A |
5491751 | Paulson et al. | Feb 1996 | A |
5507489 | Riebel et al. | Apr 1996 | A |
5510884 | Bov, Jr. et al. | Apr 1996 | A |
5513169 | Fite et al. | Apr 1996 | A |
5519381 | Marsh et al. | May 1996 | A |
5528222 | Moskowitz et al. | Jun 1996 | A |
5537105 | Marsh et al. | Jul 1996 | A |
5541904 | Fite et al. | Jul 1996 | A |
5544273 | Harrison | Aug 1996 | A |
5546163 | Asai et al. | Aug 1996 | A |
5557280 | Marsh et al. | Sep 1996 | A |
5566441 | Marsh et al. | Oct 1996 | A |
5568552 | Davis | Oct 1996 | A |
5572193 | Flanders et al. | Nov 1996 | A |
5577121 | Davis et al. | Nov 1996 | A |
5579088 | Ko | Nov 1996 | A |
5614278 | Chamberlain et al. | Mar 1997 | A |
5625692 | Herzberg et al. | Apr 1997 | A |
5625693 | Rohatgi et al. | Apr 1997 | A |
5640002 | Ruppert et al. | Jun 1997 | A |
5660663 | Chamberlain et al. | Aug 1997 | A |
5666585 | Nagira et al. | Sep 1997 | A |
5699066 | Marsh et al. | Dec 1997 | A |
5713679 | Taylor | Feb 1998 | A |
5717974 | Park | Feb 1998 | A |
5724423 | Khello | Mar 1998 | A |
5724425 | Chang et al. | Mar 1998 | A |
5726630 | Marsh et al. | Mar 1998 | A |
5754656 | Nishioka et al. | May 1998 | A |
5755519 | Klinefelter | May 1998 | A |
5760916 | Dellert et al. | Jun 1998 | A |
5771291 | Newton et al. | Jun 1998 | A |
5781635 | Chan | Jul 1998 | A |
5781708 | Austin et al. | Jul 1998 | A |
5787174 | Tuttle | Jul 1998 | A |
5787278 | Barton et al. | Jul 1998 | A |
5797060 | Thompson | Aug 1998 | A |
5805703 | Crandall | Sep 1998 | A |
5810353 | Baskette et al. | Sep 1998 | A |
5865390 | Iveges | Feb 1999 | A |
5867102 | Souder et al. | Feb 1999 | A |
5875248 | Lewis | Feb 1999 | A |
5881136 | Tasker et al. | Mar 1999 | A |
5892211 | Davis et al. | Apr 1999 | A |
5897741 | Mills et al. | Apr 1999 | A |
5902437 | McDonough et al. | May 1999 | A |
5907739 | Tsunemi et al. | May 1999 | A |
5907748 | Kawana | May 1999 | A |
5909233 | Hamman et al. | Jun 1999 | A |
5917911 | Dabbish et al. | Jun 1999 | A |
5978483 | Thompson et al. | Nov 1999 | A |
5982295 | Goto et al. | Nov 1999 | A |
5995626 | Nishioka et al. | Nov 1999 | A |
6011937 | Chaussade et al. | Jan 2000 | A |
6014533 | Kawana | Jan 2000 | A |
6015344 | Kelly et al. | Jan 2000 | A |
6019461 | Yoshimura et al. | Feb 2000 | A |
6019865 | Palmer et al. | Feb 2000 | A |
6049289 | Waggamon et al. | Apr 2000 | A |
6049610 | Crandall | Apr 2000 | A |
6050622 | Gustafson | Apr 2000 | A |
6068372 | Rousseau et al. | May 2000 | A |
6075997 | Lindqvist et al. | Jun 2000 | A |
6092888 | Eade et al. | Jul 2000 | A |
6099178 | Spurr et al. | Aug 2000 | A |
6100804 | Brady et al. | Aug 2000 | A |
6106166 | Spurr et al. | Aug 2000 | A |
6118379 | Kodukula et al. | Sep 2000 | A |
6123796 | Kathmann et al. | Sep 2000 | A |
6130613 | Eberhardt et al. | Oct 2000 | A |
6163260 | Conwell et al. | Dec 2000 | A |
6163361 | McIntyre et al. | Dec 2000 | A |
6163631 | Kawanishi et al. | Dec 2000 | A |
6173119 | Manico et al. | Jan 2001 | B1 |
6188423 | Pou | Feb 2001 | B1 |
6206292 | Robertz et al. | Mar 2001 | B1 |
6227643 | Purcell et al. | May 2001 | B1 |
6246326 | Wiklof et al. | Jun 2001 | B1 |
6249291 | Popp et al. | Jun 2001 | B1 |
6263170 | Bortnem | Jul 2001 | B1 |
6271928 | Bullock et al. | Aug 2001 | B1 |
6280544 | Fox et al. | Aug 2001 | B1 |
6285342 | Brady et al. | Sep 2001 | B1 |
6286762 | Reynolds et al. | Sep 2001 | B1 |
6290138 | Ohno et al. | Sep 2001 | B1 |
6295423 | Haines et al. | Sep 2001 | B1 |
6312106 | Walker | Nov 2001 | B1 |
6327972 | Heredia et al. | Dec 2001 | B2 |
6332062 | Phillips et al. | Dec 2001 | B1 |
6334921 | Duschek | Jan 2002 | B1 |
6351618 | Pollocks, Jr. | Feb 2002 | B1 |
6351621 | Richards et al. | Feb 2002 | B1 |
6357503 | Kromer et al. | Mar 2002 | B1 |
6363483 | Keshav | Mar 2002 | B1 |
6375298 | Purcell et al. | Apr 2002 | B2 |
6381418 | Spurr et al. | Apr 2002 | B1 |
6385407 | Inose | May 2002 | B1 |
6386772 | Klinefelter et al. | May 2002 | B1 |
6404335 | Ohno et al. | Jun 2002 | B1 |
6409401 | Petteruti et al. | Jun 2002 | B1 |
6418283 | Wegman et al. | Jul 2002 | B1 |
6451154 | Grabau et al. | Sep 2002 | B1 |
6473571 | Wegman et al. | Oct 2002 | B1 |
6487812 | Johnson | Dec 2002 | B2 |
6490352 | Schroeppel | Dec 2002 | B1 |
6490420 | Pollocks, Jr. | Dec 2002 | B2 |
6522348 | Brot et al. | Feb 2003 | B1 |
6525835 | Gulati | Feb 2003 | B1 |
6527356 | Spurr et al. | Mar 2003 | B1 |
6532351 | Richards et al. | Mar 2003 | B2 |
6536660 | Blankenship et al. | Mar 2003 | B2 |
6539867 | Lee | Apr 2003 | B2 |
6546327 | Hattori et al. | Apr 2003 | B2 |
6557606 | Duschek | May 2003 | B1 |
6557758 | Monico | May 2003 | B1 |
6588658 | Blank | Jul 2003 | B1 |
6592035 | Mandile | Jul 2003 | B2 |
6593853 | Barrett et al. | Jul 2003 | B1 |
6593952 | Funayama et al. | Jul 2003 | B1 |
6597465 | Jarchow et al. | Jul 2003 | B1 |
6603497 | Hevenor et al. | Aug 2003 | B2 |
6629134 | Hayward et al. | Sep 2003 | B2 |
6634814 | Spurr et al. | Oct 2003 | B2 |
6636702 | Abe | Oct 2003 | B2 |
6644544 | Spurr et al. | Nov 2003 | B1 |
6644771 | Silverbrook | Nov 2003 | B1 |
6683638 | Sato | Jan 2004 | B2 |
6687634 | Borg | Feb 2004 | B2 |
6694884 | Klinefelter et al. | Feb 2004 | B2 |
6708005 | Chihara | Mar 2004 | B2 |
6714745 | Sasame et al. | Mar 2004 | B2 |
6722753 | Helterline et al. | Apr 2004 | B2 |
6724895 | Turner et al. | Apr 2004 | B1 |
6735399 | Tabb et al. | May 2004 | B2 |
6738903 | Haines | May 2004 | B1 |
6748182 | Yoshida et al. | Jun 2004 | B2 |
6791704 | Moreau et al. | Sep 2004 | B1 |
6793307 | Spun et al. | Sep 2004 | B2 |
6798997 | Hayward et al. | Sep 2004 | B1 |
6802659 | Cremon et al. | Oct 2004 | B2 |
6807380 | Iida et al. | Oct 2004 | B2 |
6808255 | Haines et al. | Oct 2004 | B1 |
6820039 | Johnson et al. | Nov 2004 | B2 |
6832866 | Klinefelter et al. | Dec 2004 | B2 |
6879785 | Ito et al. | Apr 2005 | B2 |
6894711 | Yamakawa et al. | May 2005 | B2 |
6932527 | Pribula et al. | Aug 2005 | B2 |
6954533 | Turner et al. | Oct 2005 | B2 |
6963351 | Squires et al. | Nov 2005 | B2 |
6986057 | Cusey et al. | Jan 2006 | B1 |
7018117 | Meier et al. | Mar 2006 | B2 |
7031946 | Tamai et al. | Apr 2006 | B1 |
7137000 | Hohberger et al. | Nov 2006 | B2 |
7147165 | Mongin et al. | Dec 2006 | B2 |
7183505 | Mongin et al. | Feb 2007 | B2 |
7206010 | Maghakian | Apr 2007 | B2 |
7228433 | Turner et al. | Jun 2007 | B2 |
7237485 | Meier et al. | Jul 2007 | B2 |
7430762 | Klinefelter et al. | Sep 2008 | B2 |
7664257 | Hohberger et al. | Feb 2010 | B2 |
20010027443 | Hanzawa et al. | Oct 2001 | A1 |
20010029857 | Heredia et al. | Oct 2001 | A1 |
20010048361 | Mays et al. | Dec 2001 | A1 |
20010056409 | Bellovin et al. | Dec 2001 | A1 |
20020062898 | Austin et al. | May 2002 | A1 |
20020145036 | Otto | Oct 2002 | A1 |
20020170973 | Teraura | Nov 2002 | A1 |
20020195194 | Grabau et al. | Dec 2002 | A1 |
20020195195 | Grabau et al. | Dec 2002 | A1 |
20030063002 | Okamoto et al. | Apr 2003 | A1 |
20030089444 | Meizer et al. | May 2003 | A1 |
20030128269 | Squires et al. | Jul 2003 | A1 |
20030183329 | Duschek | Oct 2003 | A1 |
20030189490 | Hogerton et al. | Oct 2003 | A1 |
20040109715 | Meier et al. | Jun 2004 | A1 |
20040114981 | Meier et al. | Jun 2004 | A1 |
20050275708 | Squires et al. | Dec 2005 | A1 |
20060123471 | Fontanella et al. | Jun 2006 | A1 |
20060203075 | Vazac et al. | Sep 2006 | A1 |
20070056027 | Nehowig et al. | Mar 2007 | A1 |
20070057057 | Andresky et al. | Mar 2007 | A1 |
20080316523 | Klinefelter et al. | Dec 2008 | A1 |
Number | Date | Country |
---|---|---|
743556 | Sep 1998 | AU |
196 53 113 | Jun 1997 | DE |
0 595 549 | May 1994 | EP |
0 878 403 | Nov 1998 | EP |
1 016 037 | May 2000 | EP |
2 303 613 | Feb 1997 | GB |
62(1987)-46281 | Feb 1987 | JP |
03-220572 | Sep 1991 | JP |
4(1992)-371026 | Dec 1992 | JP |
5(1993)-335969 | Dec 1993 | JP |
6-124369 | May 1994 | JP |
9-104189 | Apr 1997 | JP |
409-185324 | Jul 1997 | JP |
11-263025 | Sep 1999 | JP |
2000-062273 | Feb 2000 | JP |
2000-246921 | Sep 2000 | JP |
2000-355146 | Dec 2000 | JP |
2001-001424 | Jan 2001 | JP |
2001-096814 | Apr 2001 | JP |
2001-215779 | Aug 2001 | JP |
2001-510912 | Aug 2001 | JP |
2002-334313 | Nov 2002 | JP |
2003011931 | Jan 2003 | JP |
2003011939 | Jan 2003 | JP |
2003159838 | Jun 2003 | JP |
2003207984 | Jul 2003 | JP |
2 120 387 | Oct 1998 | RU |
2 147 790 | Apr 2000 | RU |
9604402-9 | May 1998 | SE |
1 069 276 | Nov 1997 | SU |
WO 9608092 | Mar 1996 | WO |
WO 9628941 | Sep 1996 | WO |
WO 9711530 | Mar 1997 | WO |
WO 9839734 | Sep 1998 | WO |
WO 9852762 | Nov 1998 | WO |
WO 0007807 | Feb 2000 | WO |
WO 0043932 | Jul 2000 | WO |
WO 0047410 | Aug 2000 | WO |
WO 0100492 | Jan 2001 | WO |
WO 0115382 | Mar 2001 | WO |
WO 0157807 | Aug 2001 | WO |
WO 0161646 | Aug 2001 | WO |
WO 0235463 | May 2002 | WO |
WO 03019459 | Mar 2003 | WO |
WO 03029005 | Apr 2003 | WO |
Number | Date | Country | |
---|---|---|---|
20100284531 A1 | Nov 2010 | US |
Number | Date | Country | |
---|---|---|---|
60314926 | Aug 2001 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10164070 | Jun 2002 | US |
Child | 11364354 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11364354 | Feb 2006 | US |
Child | 12648961 | US |