Not Applicable.
Not Applicable.
The embodiments disclosed herein relate generally to network processors and, more particularly, to network processors having cryptographic processing.
As is known in the art, there is a trend to provide network processors that perform cryptographic processing of packet data. To facilitate cryptographic processing, 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 line rate. One example of a network processor including such a crypto unit is the Intel IXP2850 network processor manufactured by Intel Corporation of Santa Clara, Calif.
Two types of cryptographic processing that are commonly performed on packet data 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, which is sent along with the packet, to allow 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 the packet, so that only the intended receiver, with the correct cryptographic key, can decrypt the packet and read its contents. Most commonly used security protocols perform both ciphering and authentication on each packet.
The crypto units in the Intel IXP2850 network processor, for example, implement the well-known 3DES/DES (Data Encryption Standard) and AES (Advanced Encryption Standard) cipher algorithms, as well as the SHA1 (Secure Hash Algorithm authentication algorithm). Each of the crypto units contains a pair of 3DES/DES and SHA1 cores, and a single AES core. By implementing a pair of cores, the crypto units meet the data rate requirements by allowing both cores to process data in parallel, thereby doubling the data rate of a single core.
Data from the crypto units is transferred to a transmit buffer element in a media switch fabric interface of the processor and then transmitted over an interface, such as an SPI4.2 or NPSI interface. SPI4.2 (Optical Internetworking Forum (OIF) standard System Packet Interface level 4, Phase 2, published January, 2001) is an industry standard interface commonly used to interconnect MAC (Media Access Controller)/framer devices to network processors. NPSI (Network Processing Forum (NPF) Streaming Interface, September, 2002) is a related interface that is used for transmitting data between network processors. Data is transmitted over the SPI4.2/NPSI interfaces in blocks, referred to as mpackets. Protocol packets, such as IP (Internet Protocol) packets or Ethernet frames, are split into multiple mpackets. The amount of data within an mpacket is a multiple of 16 bytes, unless the mpacket is the last mpacket in a packet.
When block cipher algorithms such as AES and 3DES/DES are used, data is processed by the crypto unit in fixed size blocks and upon processing is transferred in fixed sized blocks into buffer elements of predetermined size. Because data in an mpacket must be a multiple of 16 bytes, all of the data from the last block may not fit into a given buffer element because the resulting data in the buffer element would not be a multiple of 16 bytes. In this case, the data would need to be split among multiple buffer elements. Software control over this splitting process can increase the processing overhead.
It would, therefore, be desirable to overcome the aforesaid and other disadvantages.
The presently disclosed embodiments will be more fully understood from the following detailed description taken in conjunction with the accompanying drawings, in which:
It is understood that for ease of comprehension and clarity components of the network processor 100 not relevant to the features described herein may not be shown or described. It is further understood that such components are well known to one of ordinary skill in the art.
The crypto units 102a, 102b accelerate the cryptographic processing of packet data to support crypto processing at line rate. In an exemplary embodiment, the crypto units 102 implement the following cipher algorithms: 3DES/DES, AES, and RC4. The 3DES/DES and AES algorithms are block cipher algorithms, which means that they process data in discrete blocks. The block size of the 3DES/DES algorithm is 8 bytes and the block size of the AES algorithm is 16 bytes. The RC4 algorithm is a stream cipher that processes data one byte at a time.
In one particular embodiment, the crypto units 102a, 102b each implement the following well-known authentication algorithms: MD5, SHA1, and AES-XCBC-MAC, which are block-oriented algorithms. The MD5 and SHA1 algorithms have a block size of 64 bytes, while the AES-XCBC-MAC algorithm has a block size of 16 bytes.
In an exemplary embodiment shown in
Referring again to
In an exemplary embodiment shown in
It is understood that the alignment buffer can be provided in a variety of implementations and mechanisms well known to one of ordinary skill in the art. In one particular embodiment, the alignment buffer includes storage elements, such as flip-flops, to store the current residue. When new data arrives, a byte shifter can be used to align the new data with the current residue data. After alignment with a byte shifter, the data can be written info flip-flops.
In processing block 304, the crypto unit 102 ciphers packet data to fill the given TBUF element 110. The starting address in the MSF 104 is passed along on each cipher command. Ciphered data is fed through the alignment buffer 106 and sent to the MSF 104 in blocks of 16 bytes, so the amount of valid data in the TBUF element is a multiple of 16 bytes. When a TBUF element has been filled, it is determined in decision block 306 whether there is still data to cipher (whether or not the packet has been completely processed). If not, it is determined in decision block 310 whether there is any data remaining in the alignment buffer. If there is no remaining data, processing of this packet is complete and processing of the next packet can be started in processing block 300. If there is data remaining, it is determined in decision block 312 whether this data will fit into the current TBUF element. If this data will fit, in processing block 316 the data is sent to this TBUF element and processing of the next packet can be started in processing block 300. If the data in the alignment buffer will not fit in the current TBUF element, in processing block 314 a new TBUF element is allocated. The data remaining in the alignment buffer is then sent to the TBUF element (processing block 316) and processing of the next packet can be started in processing block 300. The data that remains in the alignment buffer 106, which is at or between 0 and 15 bytes, is sent to the MSF in processing step 316 even though it is not a complete 16 bytes. While this may result in an amount of data in the TBUF element that is not a multiple of 16 bytes, this is allowed by the SPI4.2 and NPSI protocols, for example, at the end of a packet. With these protocols, software indicates the correct length when validating the last TBUF element, so that the MSF unit sends out the correct number of bytes at the end of the packet.
If packet processing is not complete as determined in decision block 306, in processing block 308 an additional TBUF element is allocated. The crypto unit 102 then ciphers more packet data to fill the additional TBUF element in processing step 304.
It is understood that the switching device can be provided from a variety of devices that include cryptographic data processing, such as a network router. Various network applications, configurations, switching devices, and topologies for the network and network processor will be readily apparent to one of ordinary skill in the art.
The embodiments described above provide a way to eliminate the need for software control over the process of splitting ciphered data blocks across TBUF elements thereby saving processing cycles and bus bandwidth. This arrangement also provides a cleaner programming model since the program does not have to distinguish between blocks that fit into a TBUF element and blocks that do not fit. In addition, buffer alignment is programmable for supporting various security protocols and encapsulation protocols having a variety of differently sized packet headers, which are not subject to ciphering.
While the embodiments described herein are primarily shown and described in conjunction with an Intel IXP2850 network processor architecture, it is understood that embodiments are applicable to network processors in general. For example, it will be appreciated that any number of crypto units can be used. In addition, the number of cipher and authentication cores and processing contexts, as well as the supported algorithm types, can vary without departing from the scope of the present embodiments.
One skilled in the art will appreciate further features and advantages based on the above-described embodiments. Accordingly, the embodiments described herein are not to be limited by what has been particularly shown and described, except as indicated by the appended claims. All publications and references cited herein are expressly incorporated herein by reference in their 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 |
6061449 | Candelore et al. | May 2000 | A |
6061779 | Garde | May 2000 | A |
6064976 | Tolopka | May 2000 | A |
6105053 | Kimmel | 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 |
6557095 | Henstrom | Apr 2003 | B1 |
6606692 | Hill et al. | Aug 2003 | B2 |
6625150 | Yu | Sep 2003 | B1 |
6697932 | Yoaz et al. | Feb 2004 | B1 |
6757791 | O'Grady et al. | Jun 2004 | B1 |
6829315 | Cruikshank | Dec 2004 | B1 |
6853635 | Beshai | Feb 2005 | B1 |
6868082 | Allen et al. | Mar 2005 | B1 |
6971006 | Krishna et al. | Nov 2005 | B2 |
7069447 | Corder | Jun 2006 | B1 |
7073067 | Mizrah | Jul 2006 | B2 |
7082534 | Tardo | Jul 2006 | B2 |
7245616 | Elnathan et al. | Jul 2007 | B1 |
20020035681 | Maturana et al. | Mar 2002 | A1 |
20020078342 | Matthews, Jr. | Jun 2002 | A1 |
20020083317 | Ohta et al. | Jun 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 |
20030046423 | Narad et al. | Mar 2003 | A1 |
20030091036 | Milliken et al. | May 2003 | A1 |
20030097481 | Richter | May 2003 | A1 |
20030099254 | Richter | May 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 |
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 |
20040148382 | Narad et al. | Jul 2004 | A1 |
20040225885 | Grohoski et al. | Nov 2004 | A1 |
20040264502 | Hulmani et al. | Dec 2004 | A1 |
20050138368 | Sydir et al. | Jun 2005 | A1 |
20050141715 | Sydir et al. | Jun 2005 | A1 |
20050149744 | Sydir et al. | Jul 2005 | A1 |
Number | Date | Country |
---|---|---|
WO 9966678 | Dec 1999 | WO |
Number | Date | Country | |
---|---|---|---|
20050149725 A1 | Jul 2005 | US |