Not Applicable
This invention relates generally to network processors and more particularly to a method and apparatus for scheduling cipher processing and authentication processing in a programmable network processor.
As is known in the art, there is a trend to provide network processors that perform cryptographic processing of network packets. To facilitate the cryptographic processing, the network processors include cryptographic acceleration units (also referred to as “crypto units”). The crypto units accelerate the cryptographic processing of packet data to support cryptographic processing at network line rate. One example of a network processor including such a crypto unit is the INTEL® IXP2850 network processor manufactured by Intel Corporation.
Two types of cryptographic processing that are commonly performed on network packets are authentication processing (or more simply authentication) and ciphering processing (or more simply ciphering). Authentication is the process of creating a digest of the packet called a MAC (message authentication code), which is sent along with the packet, and which allows the receiver to verify that the packet was indeed sent by the sender (rather than by some third party) and was not modified in transit. Ciphering is the process of encrypting or decrypting the packet, so that only the intended receiver, with the correct cryptographic key, can decrypt the packet and read its contents. Commonly used security protocols perform both ciphering and authentication on each network packet.
Known cipher algorithms include, but are not limited to, 3DES, AES, and RC4 cipher algorithms. The 3DES and AES algorithms are block cipher algorithms, which means that they process data in discrete blocks. The processing block size of the 3DES algorithm is 8 bytes, the processing block size of the AES algorithm is 16 bytes, and the RC4 algorithm is a stream cipher and processes data one byte at a time. These are but some of many cipher algorithms, and have processing block sizes representative of other cipher algorithms.
Known authentication algorithms include, but are not limited to, MD5, SHA1, and AES-XCBC-MAC authentication algorithms. All of these are block-oriented algorithms. The processing block size of the MD5 and SHA1 algorithms is 64 bytes, while the AES-XCBC-MAC algorithm uses a block size of 16 bytes. These are but some of many authentication algorithms, and have processing block sizes representative of other authentication algorithms. It should be appreciated that the length of a network data packet is not required to be a multiple of the block size of a particular cipher or authentication algorithm.
Known security protocols such as IPSEC provide part of the data in a network packet that is subject to ciphering and authentication, while another part of the data is subject only to authentication. The data that is subject only to authentication generally appears at the beginning of the packet. Other security protocols have a similar requirement that part of the data in a network packet is subject to ciphering and authentication, while another part of the data is subject only to authentication.
It should be appreciated that different security protocols can have different size headers associated with a network packet and that the amount of data subject to authentication only is not necessarily a multiple of the block size of the cipher and/or authentication algorithm.
Network packet data subject to ciphering and authentication can have two varieties. In a first variety, as discussed more fully below, incoming unencrypted data subject to ciphering and authentication (to be encrypted) can be ciphered and then sequentially processed by the authentication core. In a second variety, incoming encrypted data subject to ciphering and authentication (to be decrypted) can be processed by both the authentication and cipher cores substantially in parallel. Whether the ciphering and the authentication operations are performed sequentially or in parallel can depend not only on whether packets are to be encrypted or decrypted, but can also depend on the specific security protocol used, for example IPSec.
Once ciphered with the cipher core, data that is ciphered and not yet processed by the authentication core can be referred to as ciphered-network-packet data subject to authentication. Therefore, for a network data packet associated with a security protocol, different types of data exist, including network packet data subject to authentication and ciphering, network packet data subject only to authentication, and ciphered-network-packet data subject to authentication.
In order to provide both cipher processing and authentication processing, some prior art techniques employ a two-pass approach. In the two-pass approach, a network packet is processed in a first pass with cipher processing of network packet data subject to ciphering and authentication. The network packet is then processed in a second pass with authentication processing of the resulting ciphered-network-packet data subject to authentication along with network packet data subject only to authentication. As networks become faster, the two-pass approach tends to limit throughput of network packets. In order to perform both ciphering and authentication at a high data rate, it would be desirable to perform both operations in one pass.
Therefore, it would be desirable to overcome the aforesaid and other disadvantages, and to provide a method and apparatus that can process a network packet data in a security protocol having ciphering and authentication, at full network line speed. It would be further desirable to provide the method and apparatus that is readily adaptable to processing with any cipher algorithm and any authentication algorithm.
The foregoing features of the invention, as well as the invention itself may be more fully understood from the following detailed description of the drawings, in which:
Before describing the method and apparatus for performing authentication after cipher, some introductory concepts and terminology are explained. As used herein, the term “data” refers to any portion of a network packet, including but not limited to, header information, source address information, destination address information, and user data. The network packet can be in any format, including, but not limited to IP, TCP/IP, and Ethernet.
Also, as used herein, the terms “network packet data subject to ciphering and authentication,” “network packet data subject only to authentication,” and “ciphered-network-packet data subject to authentication,” are distinct types of data associated with a security protocol and with a network packet as described by the terms and as further described below. It will become apparent from discussions below that the network packet data subject to ciphering and authentication can have two varieties, a first variety in which the ciphering and the authentication are performed sequentially upon received unencrypted network packet data, and a second variety in which the ciphering and the authentication are performed substantially in parallel upon received encrypted network packet data.
As used herein, “ciphering” refers both to encrypting and decrypting data associated with a network packet.
Referring now to
In the exemplary network processor 10 of
The cipher core group 24 provides ciphered-network-packet data subject to authentication along a path 26 to the selected authentication buffer with the authentication buffer group 28. The cipher core group 24 also transmits ciphered network packet data out of the cryptographic unit 16 along path 36.
It will therefore be understood that the selected authentication buffer stores “authentication data” including at least one of ciphered-network-packet data subject to authentication, network packet data subject only to authentication, and network packet data subject to ciphering and authentication.
Blocks of the authentication data are provided along a path 30 from the authentication buffer group 28 to a selected authentication core within an authentication core group 32. The authentication core group 32 includes two MD5 cores 32a, 32b using an MD5 algorithm, two SHA1 cores 32c, 32c using an SHA1 algorithm, and one AES-XCBC-MAC core 32e using an AES-XCBC-MAC algorithm. As described above, the processing block size of the MD5 and SHA1 algorithms is 64 bytes, while the AES-XCBC-MAC algorithm uses a block size of 16 bytes. Message authentication codes (MACs) 34 that result from the authentication operation performed on a packet are provided by the authentication core group 32.
The authentication buffer, e.g., authentication buffer 28a, provides a means of operating with the cipher cores 24a-24d and with authentication cores 32a-32f having different processing block sizes, while maintaining a consistent throughput at network line speed. The function of the authentication buffers 28a-28f will become apparent in conjunction with figures below.
A processor 12 provides commands along a path 14, which control the scheduler 18 to provide the portions of the network packets which require ciphering and authentication and the portions of the network packets requiring only authentication along the paths 22, 20, respectively, as described above. The processor 12 also provides commands to select a cipher core 24a-24d from among the cipher core group 24, an authentication buffer 28a-28f from among the authentication buffer group 28, and an authentication core 32a-32f from among the authentication core group 32.
Having more than one authentication buffer in the authentication buffer group 28 allows parallel operations to be performed upon multiple network packets at the same time, therefore tending to increase throughput speed.
The authentication buffers 28a-28e decouple and speed match the operation of the cipher cores 24a-24d and the operation of the authentication cores 32a-32e, which can operate at different data rates and on blocks of data having different sizes. Each authentication buffer 28a-28f is sized to hold at least a largest block of data associated with any of the supported authentication algorithms, plus a largest block of data associated with any of the supported cipher algorithms. For the exemplary embodiment shown in
In order to support the ciphering network packets, the exemplary cryptographic unit 16 has six processing “contexts” and six corresponding authentication buffers 28a-28f, which are each used to process one packet at a time. A processing context corresponds to a variety of information, including a cipher key and intermediate ciphering/authentication results associated with the processing of one packet. Multiple processing contexts and a corresponding plurality of authentication buffers allow any latency generated by loading of cryptographic key material and packet data to be hidden. In essence, the cryptographic unit 16 is pipelined, allowing the loading of data and key material associated with some of the contexts concurrently with processing of data associated with other contexts. This allows the cryptographic unit 16 to achieve a high throughput.
It should be understood that although in the exemplary embodiment of
While six authentication buffers are shown, it should also be appreciated that more than six or fewer than six authentication buffers can be used. The number of authentication buffers to use is selected in accordance with a desired number or processing contexts resulting in a corresponding number of authentication buffers being loaded and/or processed in parallel.
Referring now to
The authentication buffer 70 is arranged as a circular first-in-first-out (FIFO) memory. The FIFO structure allows the block size of the data being written to the buffer to be different from the block size of the data being read from the buffer. This allows a write operation to provide more data than is required by an authentication core, e.g., authentication core 32a of
When enough data has accumulated in the authentication buffer 70 to fill a data block, required by an authentication algorithm associated with the authentication core, then the block of data is read from the authentication buffer 70 and sent to an authentication core, e.g., authentication core 32a, of
Further operation of the authentication buffer 70 is described in terms of an example. In operation, initially the start of data pointer 72 and the end of data pointer 74 each point to the first physical byte of the authentication buffer 70 (byte 0). In one example, 12 bytes of network packet data subject only to authentication are loaded into the authentication buffer 70 and the end of data pointer 74 is moved to byte 12 accordingly. In
Referring now to
When the authentication buffer 70 contains sufficient data to begin authentication processing, a block of data is processed, which is here 64 bytes. The authentication core processes 64 bytes of data starting at the start of data pointer 72. In this example, therefore, the authentication core processes bytes 0 through 63.
When the authentication core has processed the data, the start of data pointer 72 is advanced to point to byte 64 and the end of data pointer 74 remains at byte 76.
Referring now to
It should be understood that though the authentication buffer 70 can have a fixed physical size, for example, eighty bytes, by means of the start of data pointer 72 and the end of data pointer 74, the actual number of bytes used in the circular FIFO structure can be changed or programmed to have any length of eighty bytes or less. The programming can be provided, for example, by the processor 12 of
In one particular embodiment, the authentication buffer 70 is implemented as an 80-byte circular FIFO using byte-writeable register files. Register files allow new network packet data to be written into the authentication buffer 70 byte-by-byte as they arrive without having to shift the data through an accumulation buffer 70.
Register files, which in one embodiment, are used to implement the circular FIFO authentication buffer 70, use a smaller amount of integrated circuit die area than flip-flop structures. Typically, an implementation using register files is two or three times more die area efficient than an implementation using flops. As is known, register files are composed of memory cells, decoders, and read/write circuitry. Register files use memory cells, which are approximately one third the size of flip-flops. In addition, data read from a register file does not need to be multiplexed between outputs of flip-flops. For register files, multiplexing is performed very efficiently by a register file bit line structure. Therefore, register files require a smaller integrated circuit die area than flip-flops.
It should be appreciated that the example described in conjunction with
Referring now to
At step 104 a start of data pointer and end of data pointer are set to point to the start of the authentication buffer, as described above in conjunction with
At step 106, one or more blocks of network packet data are moved to the selected authentication buffer selected at step 102. This data can be network packet data subject only to authentication as provided along the path 20 of
At step 108, an end of data pointer is set to point to a location immediately after the end of data within the authentication buffer, to the next location to which data can be written.
At step 110, a decision is made as to whether there is enough data in the selected authentication buffer to allow a selected authentication core, having a predetermined authentication algorithm associated with a predetermined data block size, to operate on the data within the selected authentication buffer. If there is not enough data, the process returns to step 106. If enough data has been received the process proceeds to step 112.
At step 112 a data block corresponding in size to the predetermined data block size is moved to an authentication core (e.g., authentication core 32a,
At step 114, the start of data pointer is set in accordance with the data block being moved to an authentication core at step 112, as described above in conjunction with
At step 116 a decision is made as to whether the last data has been received from a network data packet. If the last data has been received, the process ends. If the last network data has not yet been received, the process returns to step 106.
Having described preferred embodiments of the invention it will now become apparent to those of ordinary skill in the art that other embodiments incorporating these concepts may be used. Additionally, the software included as part of the invention may be embodied in a computer program product that includes a computer useable medium. For example, such a computer usable medium can include a readable memory device, such as a hard drive device, a CD-ROM, a DVD-ROM, or a computer diskette, having computer readable program code segments stored thereon. The computer readable medium can also include a communications link, either optical, wired, or wireless, having program code segments carried thereon as digital or analog signals. Accordingly, it is submitted that that the invention should not be limited to the described embodiments but rather should be limited only by the spirit and scope of the appended claims. All publications and references cited herein are expressly incorporated herein by reference in their entirety.
This application is a continuation of U.S. patent application Ser. No. 12/455,038, filed on May 27, 2009, which issued as U.S. Pat. No. 8,041,945, and entitled, “METHOD AND APPARATUS FOR SCHEDULING THE PROCESSING OF COMMANDS FOR EXECUTION BY CRYPTOGRAPHIC ALGORITHM CORES IN A PROGRAMMABLE NETWORK PROCESSOR,” which is a continuation of U.S. patent application Ser. No. 10/741,676, filed on Dec. 19, 2003, which issued as U.S. Pat. No. 7,543,142, and entitled, “METHOD AND APPARATUS FOR SCHEDULING THE PROCESSING OF COMMANDS FOR EXECUTION BY CRYPTOGRAPHIC ALGORITHM CORES IN A PROGRAMMABLE NETWORK PROCESSOR,” is hereby incorporated by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
3627928 | Wolper et al. | Dec 1971 | A |
3868631 | Morgan et al. | Feb 1975 | A |
4107458 | Constant | Aug 1978 | A |
4434322 | Ferrell | Feb 1984 | A |
4661657 | Grenzebach et al. | Apr 1987 | A |
5070528 | Hawe et al. | Dec 1991 | A |
5161193 | Lampson et al. | Nov 1992 | A |
5235644 | Gupta et al. | Aug 1993 | A |
5307459 | Petersen et al. | Apr 1994 | A |
5377270 | Koopman, Jr. et al. | Dec 1994 | A |
5592679 | Yung | Jan 1997 | A |
5594869 | Hawe et al. | Jan 1997 | A |
5790545 | Holt et al. | Aug 1998 | A |
5860072 | Schofield | Jan 1999 | A |
5996086 | Delaney et al. | Nov 1999 | A |
6061449 | Candelore et al. | May 2000 | A |
6061779 | Garde | May 2000 | A |
6064976 | Tolopka | May 2000 | A |
6105053 | Kimmel et al. | Aug 2000 | A |
6157955 | Narad et al. | Dec 2000 | A |
6295604 | Callum | Sep 2001 | B1 |
6341335 | Kanai et al. | Jan 2002 | B1 |
6363444 | Platko et al. | Mar 2002 | B1 |
6477646 | Krishna et al. | Nov 2002 | B1 |
6487218 | Ludwig et al. | Nov 2002 | B1 |
6557095 | Henstrom | Apr 2003 | B1 |
6606692 | Hill et al. | Aug 2003 | B2 |
6625150 | Yu | Sep 2003 | B1 |
6697932 | Yoaz et al. | Feb 2004 | B1 |
6701432 | Deng et al. | Mar 2004 | B1 |
6757791 | O'Grady et al. | Jun 2004 | B1 |
6785390 | Hiraide | Aug 2004 | B1 |
6829315 | Cruikshank | Dec 2004 | B1 |
6853635 | Beshai | Feb 2005 | B1 |
6868082 | Allen, Jr. et al. | Mar 2005 | B1 |
6898713 | Joly et al. | May 2005 | B1 |
6971006 | Krishna et al. | Nov 2005 | B2 |
7069447 | Corder | Jun 2006 | B1 |
7073067 | Mizrah | Jul 2006 | B2 |
7082534 | Tardo | Jul 2006 | B2 |
7165824 | Walmsley et al. | Jan 2007 | B2 |
7245616 | Elnathan et al. | Jul 2007 | B1 |
7512945 | Sydir et al. | Mar 2009 | B2 |
7529924 | Sydir et al. | May 2009 | B2 |
7543142 | Sydir et al. | Jun 2009 | B2 |
8041945 | Sydir et al. | Oct 2011 | B2 |
8065678 | Sydir et al. | Nov 2011 | B2 |
20020009094 | Medina et al. | Jan 2002 | A1 |
20020035681 | Maturana et al. | Mar 2002 | A1 |
20020062444 | Law | May 2002 | A1 |
20020078342 | Matthews, Jr. | Jun 2002 | A1 |
20020083317 | Ohta et al. | Jun 2002 | A1 |
20020108048 | Qi et al. | Aug 2002 | A1 |
20020184487 | Badamo et al. | Dec 2002 | A1 |
20020188839 | Noehring et al. | Dec 2002 | A1 |
20020188871 | Noehring et al. | Dec 2002 | A1 |
20020188885 | Sihlbom et al. | Dec 2002 | A1 |
20030002509 | Vandenhoudt et al. | Jan 2003 | A1 |
20030005103 | Narad et al. | Jan 2003 | A1 |
20030046423 | Narad et al. | Mar 2003 | A1 |
20030091036 | Milliken et al. | May 2003 | A1 |
20030097481 | Richter | May 2003 | A1 |
20030099254 | Richter | May 2003 | A1 |
20030108205 | Joyner et al. | Jun 2003 | A1 |
20030118185 | Lambert | Jun 2003 | A1 |
20030135711 | Shoemaker et al. | Jul 2003 | A1 |
20030169877 | Liu et al. | Sep 2003 | A1 |
20030172104 | Hooman et al. | Sep 2003 | A1 |
20030200330 | Oelke et al. | Oct 2003 | A1 |
20030221074 | Satoyama et al. | Nov 2003 | A1 |
20040004964 | Lakshmanamurthy et al. | Jan 2004 | A1 |
20040019782 | Hawkes et al. | Jan 2004 | A1 |
20040019783 | Hawkes et al. | Jan 2004 | A1 |
20040039936 | Lai | Feb 2004 | A1 |
20040117642 | Mowery et al. | Jun 2004 | A1 |
20040131186 | Kasuya et al. | Jul 2004 | A1 |
20040148382 | Narad et al. | Jul 2004 | A1 |
20040225885 | Grohoski et al. | Nov 2004 | A1 |
20040250095 | Feldman | Dec 2004 | A1 |
20040264502 | Hulmani et al. | Dec 2004 | A1 |
20050149725 | Sydir et al. | Jul 2005 | A1 |
20050149744 | Sydir et al. | Jul 2005 | A1 |
20070006150 | Walmsley | Jan 2007 | A9 |
20120060159 | Sydir et al. | Mar 2012 | A1 |
Number | Date | Country |
---|---|---|
9966678 | Dec 1999 | WO |
Entry |
---|
“Context switch”, Free On-Line Dictionary of Computing, Dec. 18, 1996,1 page. |
Examiner Interview Summary for U.S. Appl. No. 10/749,035, dated Sep. 24, 2007, 3 pages. |
File History from related U.S. Appl. No. 10/741,676, filed Dec. 19, 2003. |
Final Office Action received for U.S. Appl. No. 12/380,575, mailed on Jan. 14, 2011, 14 pages. |
“Intel IXP2850 Network Processor; High-speed, Secure Content Processing in a Single Chip”, Intel Corporation, available at <http://www.intel.com/design/network/prodbrf/25213601.pdf>, 2002, pp. 1-6. |
“Product Brief: Intel IXP2855 Network Processor”, Intel Corporation; available at <http://www.intel.com/go/networkprocessors>, 2005, 8 pages. |
“SATURN User Network Interface for 9.953 Gbit/s”, PMC-Sierra, 2001, 2 pages. |
“System Packet Interface Level 4 (SPL-4) Phase 2 Revision 1: OC-192 System Interface for Physical and Link Layer Devices”, Optical Internetworking Forum, Oct. 15, 2003, 72 pages. |
“Ultra High Speed ASIC Network Technology that Fully Conforms to International Standard Interface”, FIND, vol. 20, No. 3, 2002, pp. 48-53. |
Final Office Action received for U.S. Appl. No. 10/741,676, mailed on Dec. 18, 2010, 11 Pages. |
Non Final Office Action received for U.S. Appl. No. 10/741/676, mailed on Feb. 2, 2007, 9 pages. |
Non Final Office Action received for U.S. Appl. No. 10/741,676, mailed on Jun. 13, 2008, 9 pages. |
Non Final Office Action received for U.S. Appl. No. 10/741,676, mailed on Jun. 22, 2007, 9 pages. |
Notice of Allowance received for U.S. Appl. No. 10/741,676, mailed on Mar. 4, 2009, 10 pages. |
Response to Office Action received for U.S. Appl. No. 10/741,676, filed on Mar. 12, 2007, 18 pages. |
Response to Office Action received for U.S. Appl. No. 10/741,676, filed on Sep. 15, 2008, 6 pages. |
Response to Office Action for U.S. Appl. No. 10/741,676, filed on Sep. 24, 2010, 11 pages. |
Final Office Action received for U.S. Appl. No. 10/747,852, mailed on Sep. 3, 2008, 16 pages. |
Non Final Office Action received for U.S. Appl. No. 10/747,852, mailed on Dec. 10, 2007, 23 pages. |
Non Final Office Action received for U.S. Appl. No. 10/747,852. mailed on Mar. 19, 2008, 20 pages. |
Notice of Allowance received for U.S. Appl. No. 10/747,852, mailed on Nov. 28, 2008, 9 pages. |
Response to Final Office Action for U.S. Appl. No. 10/747,852, filed Nov. 3, 2008, 12 pages. |
Response to Non Final Office Action for U.S. Appl. No. 10/747,852, filed on Jun. 2, 2008, 19 pages. |
Ex Parte Quayle Office Action received for U.S. Appl. No. 10/749,035, mailed on Jul. 25, 2008, 5 pages. |
Final Office Action received for U.S. Appl. No. 10/749,035, mailed on Jun. 11, 2008, 18 pages. |
Non Final Office Action received for U.S. Appl. No. 10/749,035 mailed on Dec. 20, 2006, 130 pages. |
Non Final Office Action received for U.S. Appl. No. 10/749,035. mailed on Mar. 28, 2007, 15 pages. |
Non-Final Office Action received for U.S. Appl. No. 10/749,035, mailed on Jun. 18, 2007, 16 pages. |
Non-Final Office Action received for U.S. Appl. No. 10/749,035, mailed on Dec. 18, 2007, 18 pages. |
Notice of Allowance received for U.S. Appl. No. 10/749,035, mailed on Dec. 12, 2008, 6 pages. |
Response after Notice of Allowance for U.S. Appl. No. 10/749,035, filed on Jan. 27, 2009, 9 pages. |
Response to Ex Parte Quayle Action for U.S. Appl. No. 10/749,035, filed on Aug. 4, 2008, 9 pages. |
Response to Final Office Action for U.S. Appl. No. 10/749,035, filed on Jun. 30, 2008, 9 pages. |
Response to Final Office Action for U.S. Appl. No. 10/749,035, filed on Jun. 11, 2008, 10 pages. |
Response to Non Final Office Action for U.S. Appl. No. 10/749,035, filed on Apr. 30, 2007, 11 pages. |
Response to Non Final Office Action for U.S. Appl. No. 10/749,035, filed on Feb. 22, 2007, 20 pages. |
Response to Non-Final Office Action for U.S. Appl. No. 10/749,035, filed on Sep. 20, 2007, 6 pages. |
Response to Non-Final Office Action for U.S. Appl. No. 10/749,035, filed on Mar. 3, 2008, 16 pages. |
Advisory Action received for U.S. Appl. No. 10/749,913, mailed on Sep. 12, 2007, 4 pages. |
Final Office Action Received for U.S. Appl. No. 10/749,913, mailed on Apr. 7, 2009, 26 pages. |
Final Office Action received for U.S. Appl. No. 10/749,913, mailed on Apr. 24, 2008, 24 pages. |
Final Office Action received for U.S. Appl. No. 10/749,913, mailed on Jun. 22, 2007, 14 pages. |
Final Office Action received for U.S. Appl. No. 10/749,913, mailed on Apr. 13, 2010, 16 pages. |
Non final Office Action received for U.S. Appl. No. 10/749,913, mailed on Sep. 29, 2010, 14 pages. |
Non-Final Office Action received for U.S. Appl. No. 10/749,913, mailed on Feb. 9, 2007, 12 pages. |
Non-Final Office Action received for U.S. Appl. No. 10/749,913, mailed on Sep. 5, 2008, 19 pages. |
Non-Final Office Action received for U.S. Appl. No. 10/749,913, mailed on Dec. 26, 2007, 12 pages. |
Response to Final Office Action for U.S. Appl. No. 10/749,913, filed on Nov. 1, 2007, 17 pages. |
Response to Final Office Action for U.S. Appl. No. 10/749,913, filed on Aug. 23, 2007, 16 pages. |
Response to Final Office Action for U.S. Appl. No. 10/749,913, filed on Jun. 12, 2008, 18 pages. |
Response to Final Office Action for U.S. Appl. No. 10/749,913, filed on Feb. 8, 2008, 17 pages. |
Response to Non Final Office Action for U.S. Appl. No. 10/749,913, filed on Jan. 8, 2009, 10 pages. |
Response to Non Final Office Action for U.S. Appl. No. 10/749,913, filed on Mar. 12, 2007, 21 pages. |
Response to Office Action for U.S. Appl. No. 10/749,913, filed on Dec. 28, 2009, 18 pages. |
Response to Office Action for U.S. Appl. No. 10/749,913, filed on Jul. 10, 2009, 18 pages. |
Non Final Office Action Received for U.S. Appl. No. 12/380,575, mailed on Sep. 2, 2010, 15 pages. |
Notice of Allowance received for U.S. Appl. No. 12/380,575, mailed on Aug. 11, 2011, 5 pages. |
Response to Non Final Office Action for U.S. Appl. No. 12/380,575, filed on Oct. 29, 2010, 9 pages. |
Final Rejection received for U.S. Appl. No. 12/455,038, mailed on Jan. 14, 2011, 17 pages. |
Non Final Office Action Received for U.S. Appl. No. 12/455,038, mailed on Aug. 31, 2010, 14 pages. |
Response to Non Final Office Action for U.S. Appl. No. 12/455,038, filed on Oct. 29, 2010, 10 pages. |
Non Final Office Action received for U.S. Appl. No. 13/293,807, mailed on Apr. 24, 2012, 30 pages. |
Acharya et al., “Secure Comparison of Encrypted Data in Wireless Sensor Networks”, Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, 2005. WIOPT 2005. Third International Symposium, 2002, pp. 47-53. |
Bergen et al., “Streaming Interface (NPSI) Implementation Agreement”, The Network Processing Forum, Oct. 18, 2002, 87 pages. |
Chou, W., “Inside SSL: Accelerating Secure Transactions”, IEEE, IT PRO, Sep. 2002, pp. 37-41. |
Palkert, T., “Optical Inter Networking Forum Report”, Network Elements Incorporated, Nov. 4, 1999,15 pages. |
Pereira et al., “The ESP CBC-Mode Cipher Algorithms”, Network Working Group Request for Comments: 2451; availabel at <http://www.ietf.org/rfc/rfc/rfc2451.txt.>, Nov. 1998, 14 pages. |
Ramaswamy et al., “Considering Processing Cost in Network Simulations”, ACM SIGCOMM Workshop, Aug. 2003, pp. 47-56. |
Venkatachalam, M., “Integrated Data and Control Plane Processing Using Intel(R) IXP23XX Network Processors”, Technology@Intel Magazine, Feb. 2005, 11 pages. |
Yoaz et al., “Speculation Techniques for Improving Load Related Instruction Scheduling”, IEEE, 1999, 12 pages. |
Number | Date | Country | |
---|---|---|---|
20120079564 A1 | Mar 2012 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12455038 | May 2009 | US |
Child | 13270532 | US | |
Parent | 10741676 | Dec 2003 | US |
Child | 12455038 | US |