This application is claims priority to GB Patent Application No. 1711972.8 filed Jul. 25, 2017, the entire contents of which are hereby incorporated by reference.
This disclosure relates to the field of data processing systems. More particularly, this disclosure relates to processing performed upon data fetched as a sequence of blocks of data.
In some systems, data may be subject to multiple processing operations. For example, data may be fetched from a memory and subject to a first processing operation and then, providing a satisfactory result is achieved from that first processing operation, it may be subject to a second processing operation. One problem that can arise in this type of system is that a malicious person may seek to perturb the operation of the system between completion of the first operation and the starting of the second operation such that the second operation is performed upon modified data or in a modified manner in a way that compromises the security of the system. As an example, a malicious person may subject the system to a clock glitch, a power glitch, a short clock cycle or direct memory content modification between completion of the first process and performing of the second process in a manner such that the data which is processed in a second process, or at least the results of processing that data, do not properly correspond to the data as processed by the first process, or the results of the data processed by the first process.
At least some example embodiments of the present disclosure provide apparatus for processing data, comprising: fetch circuitry to fetch data as a sequence of blocks of data; and processing circuitry to subject a fetched block of data from among said sequence to at least partially temporally overlapping processing by at least two processes, and, for each of said at least two processes, to generate a result of said processing for said sequence.
At least some example embodiments of the present disclosure provide apparatus for processing data, comprising: fetch means for fetching data as a sequence of blocks of data; and processing means for subjecting a fetched block of data from among said sequence to at least partially temporally overlapping processing by at least two processes, and, for each of said at least two processes, generating a result of said processing for said sequence.
At least some embodiments of the present disclosure provide a method of processing data, comprising: fetching data as a sequence of blocks of data; and subjecting a fetched block of data from among said sequence to at least partially temporally overlapping processing by at least two processes; and for each of said at least two processes, generating a result of said processing for said sequence.
Further aspects, features and advantages of the present technique will be apparent from the following description of examples, which is to be read in conjunction with the accompanying drawings.
The security coprocessor 6 comprises processing circuitry 14 which in this example embodiment has the form of a cryptographic hash processing pipeline 16 and a cryptographic message authentication code pipeline 18 (e.g. an AES-MAC processing pipeline). The fetch circuitry 12 passes a fetched block of data in parallel to each of the cryptographic hash processing pipeline 16 and the cryptographic message authentication code pipeline 18 which then perform their respective processing operations. A verification process to generate a result indicative of the integrity of the data 8 is performed by the cryptographic hash processing pipeline 16 and a signature process to generate a new signature value for the data 8 is performed by the cryptographic message authentication code pipeline 18. It will be appreciated that the cryptographic hash result used to confirm the integrity of the data and the signature result resulting from the cryptographic message authentication code signature operation are each results accumulated over the processing of the entire data 8 as this is broken down and processed block-by-block within the processing circuitry 14. The cryptographic hash verification process and the cryptographic message authentication code signature process are merely two examples of cryptographic processes which it may be desired to perform on a block-by-block basis in parallel whilst generating a result for an entire data 8 in order to help increase resistance to an attack upon the integrity of the results being produced. In particular, by performing these processes at least partially temporally overlapping the system gains resistance from taempering such as by introducing clock glitches, power glitches, short clock cycles or directly data modification since if such an attack is used to perturb the data being processed then the perturbed data will be supplied both to the cryptographic hash processing pipeline 16 and the cryptographic message authentication code pipeline 18 and accordingly the cryptographic hash verification process will fail even though the cryptographic message authentication code process produces a signature value. More particularly, breaking the processing of the data file down into blocks and processing these blocks in parallel prevents a malicious person introducing a glitch to the system between the verification process having successfully completed and the signature process being performed in a manner which could otherwise result in a signed version of a modified data file being generated on the basis of the trust achieved by checking the cryptographic hash value of that data file before it was modified.
As previously mentioned, the cryptographic hash process performs a verification of the integrity of the data 8 and when all of the blocks of data into which the data 8 has been broken down have been processed, a final cryptographic hash value for the data 8 will be generated. In parallel with this, and on a block-by-block basis, the cryptographic message authentication code pipeline 18 generates a signature for the data 8 to be used in place of the cryptographic hash based signature upon subsequent manipulation of that verified data file within the data processing system 2. Such a verification and re-signature process may be undertaken as checking the new signature can subsequently be performed more rapidly than the cryptographic hash process so resulting in faster operation of the data processing system 2 when it wishes to re-verify the integrity of the data 8. When the data 8 has been subject to processing of all its blocks of data, then the cryptographic hash value generated and the new cryptographic message authentication code signature are passed to a general purpose processor 22 which serves to perform a cryptographic hash compare operation signified by processing block 24 in which the cryptographic hash value generated in the cryptographic hash processing pipeline 16 is compared with the signature 10 obtained from the memory 4. If the cryptographic hash value calculated matches the signature 10, then the verification and re-signature process has been a success and the output of the security coprocessor 6 is a combined result indicating a successful result and the associated new cryptographic message authentication code signature value. If the cryptographic hash value calculated by the cryptographic hash processing pipeline 16 does not match the signature 10, then the combined result of the cryptographic hash processing and the cryptographic message authentication code re-signature processing is a fail result.
If the determination at step 36 is that the last block of data has already been fetched, then processing proceeds to step 40 where the combined cryptographic hash result for the full data 8 and the re-signature value for the full data 8 are returned by the processing circuitry 14. Step 42 determines whether the returned cryptographic hash result matches the expected cryptographic hash result (signature 10). If a match is not detected at step 42, then step 44 serves to return a cryptographic hash fail result indicating that the data 8 did not pass its verification. If the result of step 42 was a match, then processing proceeds to step 46 at which the cryptographic message authentication code result which was generated in the cryptographic message authentication code pipeline 18 is indicated as being a valid new signature value for data 8 which has successfully passed verification of its integrity using the cryptographic hash result produced by the cryptographic hash processing pipeline 16 and the signature 10 associated with the data 8.
In order to keep the two general purpose processors 52, 54 in synchronism in their processing of the data 50 on a block-by-block basis at least one of the streams of program instructions executed by a respective general purpose processor 52, 54 (the quicker to complete) includes a synchronization instruction which serves to pause advancement to process a next fetched block of data by that general purpose processor while the other of the general purpose processors continues to process the currently fetched block of data and completes that processing. Thus, even though the general purpose processors 52, 54 may complete at different times, they are constrained to advance to process a next block of data in lock step.
The present techniques may be used in a variety of different situations in which it is desired to perform two processing operations upon the same data and reduce the likelihood of an unauthorized person being able to inappropriate alter the data, or its processing, to generate erroneous operation, such as by altering the data between completion of the first data processing and starting of the second data processing. An example of a situation in which such a problem may arise is when data is downloaded to a data processing apparatus for subsequent storage and use by that data processing apparatus. In this situation it is desirable that the downloaded data file should be verified to ensure it is unaltered since it was originally signed (a previous verification) and then to generate a new signature value which can subsequently be used by the apparatus itself to more rapidly determine that that data is unaltered whilst it is stored within the apparatus between uses. The downloaded data may, for example, comprise a software program to be executed by the apparatus such as a firmware program. Such software program may need to be downloaded as part of a software update process to be performed. It will be appreciated that the present technique may be used in situations other than such a firmware verification and re-signature process.
In the present application, the words “configured to . . . ” are used to mean that an element of an apparatus has a configuration able to carry out the defined operation. In this context, a “configuration” means an arrangement or manner of interconnection of hardware or software. For example, the apparatus may have dedicated hardware which provides the defined operation, or a processor or other processing device may be programmed to perform the function. “Configured to” does not imply that the apparatus element needs to be changed in any way in order to provide the defined operation.
Although illustrative embodiments of the invention have been described in detail herein with reference to the accompanying drawings, it is to be understood that the invention is not limited to those precise embodiments, and that various changes and modifications can be effected therein by one skilled in the art without departing from the scope and spirit of the invention as defined by the appended claims.
Number | Date | Country | Kind |
---|---|---|---|
1711972 | Jul 2017 | GB | national |
Number | Name | Date | Kind |
---|---|---|---|
5291612 | Sosic | Mar 1994 | A |
6021201 | Bakhle | Feb 2000 | A |
6061449 | Candelore | May 2000 | A |
6243361 | McMillen | Jun 2001 | B1 |
6327661 | Kocher | Dec 2001 | B1 |
6704871 | Kaplan | Mar 2004 | B1 |
6725371 | Verhoorn, III | Apr 2004 | B1 |
7367889 | Canterbury | May 2008 | B2 |
7373504 | Belgaied | May 2008 | B1 |
7401110 | Rarick | Jul 2008 | B1 |
7590869 | Hashimoto | Sep 2009 | B2 |
7620821 | Grohoski | Nov 2009 | B1 |
7761779 | Kanai | Jul 2010 | B2 |
8166294 | Sangster | Apr 2012 | B1 |
8379841 | Taylor | Feb 2013 | B2 |
8601000 | Stefani | Dec 2013 | B1 |
8639945 | Henry | Jan 2014 | B2 |
8650655 | Hayashi | Feb 2014 | B2 |
8654969 | Bolotov | Feb 2014 | B2 |
8683208 | Hayashi | Mar 2014 | B2 |
8707062 | Jahagirdar | Apr 2014 | B2 |
8782434 | Ghose | Jul 2014 | B1 |
8782435 | Ghose | Jul 2014 | B1 |
8898112 | Natanzon | Nov 2014 | B1 |
8904189 | Ghose | Dec 2014 | B1 |
8996563 | Bender | Mar 2015 | B2 |
9049186 | Paczkowski | Jun 2015 | B1 |
9158924 | Maeda | Oct 2015 | B2 |
9183606 | Paczkowski | Nov 2015 | B1 |
9489434 | Rath | Nov 2016 | B1 |
9501542 | Natanzon | Nov 2016 | B1 |
9613208 | Paczkowski | Apr 2017 | B1 |
9754100 | Hitchcock | Sep 2017 | B1 |
9767284 | Ghose | Sep 2017 | B2 |
9798898 | Henry | Oct 2017 | B2 |
9892283 | Henry | Feb 2018 | B2 |
9911008 | Henry | Mar 2018 | B2 |
9967092 | Henry | May 2018 | B2 |
10223289 | Avanzi | Mar 2019 | B2 |
10387402 | Stefani | Aug 2019 | B2 |
10417190 | Donlan | Sep 2019 | B1 |
20020141585 | Carr | Oct 2002 | A1 |
20020165912 | Wenocur | Nov 2002 | A1 |
20020178360 | Wenocur | Nov 2002 | A1 |
20020194483 | Wenocur | Dec 2002 | A1 |
20020194501 | Wenocur | Dec 2002 | A1 |
20020196935 | Wenocur | Dec 2002 | A1 |
20020199001 | Wenocur | Dec 2002 | A1 |
20020199096 | Wenocur | Dec 2002 | A1 |
20030009694 | Wenocur | Jan 2003 | A1 |
20030041110 | Wenocur | Feb 2003 | A1 |
20030194094 | Lampson | Oct 2003 | A1 |
20030229568 | Richmann | Dec 2003 | A1 |
20040008711 | Lahti | Jan 2004 | A1 |
20040015706 | Eshghi | Jan 2004 | A1 |
20040054913 | West | Mar 2004 | A1 |
20040193763 | Iizuka | Sep 2004 | A1 |
20040205332 | Bouchard | Oct 2004 | A1 |
20050015625 | Inoue | Jan 2005 | A1 |
20050044351 | Harvey | Feb 2005 | A1 |
20050076228 | Davis | Apr 2005 | A1 |
20060107047 | Bar-El | May 2006 | A1 |
20080010218 | Zank | Jan 2008 | A1 |
20080077797 | Greco | Mar 2008 | A1 |
20080215920 | Mayer | Sep 2008 | A1 |
20090217050 | Amiel | Aug 2009 | A1 |
20090248727 | Hughes | Oct 2009 | A1 |
20100098247 | Suumaki | Apr 2010 | A1 |
20100299538 | Miller | Nov 2010 | A1 |
20110026761 | Radhakrishnan | Feb 2011 | A1 |
20110044454 | Baek | Feb 2011 | A1 |
20110320803 | Hampel | Dec 2011 | A1 |
20130006993 | Kobayashi | Jan 2013 | A1 |
20130086002 | Lyle | Apr 2013 | A1 |
20130091112 | Iyer | Apr 2013 | A1 |
20130263255 | Wolf | Oct 2013 | A1 |
20130283361 | Rao | Oct 2013 | A1 |
20130332744 | Zhuang | Dec 2013 | A1 |
20130339968 | Boland | Dec 2013 | A1 |
20130339971 | Boland | Dec 2013 | A1 |
20140006797 | Cordelia | Jan 2014 | A1 |
20140019694 | Gulley | Jan 2014 | A1 |
20140059347 | Dougherty | Feb 2014 | A1 |
20140082327 | Ghose | Mar 2014 | A1 |
20140325239 | Ghose | Oct 2014 | A1 |
20140359306 | Sasao | Dec 2014 | A1 |
20150023501 | Taylor | Jan 2015 | A1 |
20150149771 | Yen | May 2015 | A1 |
20150149788 | Gupta | May 2015 | A1 |
20150169667 | Roth | Jun 2015 | A1 |
20150186139 | Wolrich | Jul 2015 | A1 |
20150363332 | Mundra | Dec 2015 | A1 |
20150363333 | Wallace | Dec 2015 | A1 |
20150363334 | Mundra | Dec 2015 | A1 |
20160006568 | Minematsu | Jan 2016 | A1 |
20160021093 | Vinckier | Jan 2016 | A1 |
20160063050 | Schoen | Mar 2016 | A1 |
20160063281 | Kahana | Mar 2016 | A1 |
20160070931 | Gueron | Mar 2016 | A1 |
20160378752 | Anderson | Dec 2016 | A1 |
20160380772 | Gopal | Dec 2016 | A1 |
20170004506 | Steinman | Jan 2017 | A1 |
20170063566 | Seminario | Mar 2017 | A1 |
20170180314 | Walker | Jun 2017 | A1 |
20170180341 | Walker | Jun 2017 | A1 |
20170206034 | Fetik | Jul 2017 | A1 |
20170244729 | Fahrny | Aug 2017 | A1 |
20170308706 | Ray | Oct 2017 | A1 |
20170353315 | Dottax | Dec 2017 | A1 |
20180032729 | Zhang | Feb 2018 | A1 |
20180034831 | Zhang | Feb 2018 | A1 |
20180197171 | Steinman | Jul 2018 | A1 |
20180359538 | Good | Dec 2018 | A1 |
20190125361 | Shelton, IV | May 2019 | A1 |
20190125454 | Stokes | May 2019 | A1 |
20190125455 | Shelton, IV | May 2019 | A1 |
20190125456 | Shelton, IV | May 2019 | A1 |
20190125457 | Parihar | May 2019 | A1 |
20190125458 | Shelton, IV | May 2019 | A1 |
20190125459 | Shelton, IV | May 2019 | A1 |
20190158278 | Zhuang | May 2019 | A1 |
20190171598 | Zhu | Jun 2019 | A1 |
20190200977 | Shelton, IV | Jul 2019 | A1 |
20190201136 | Shelton, IV | Jul 2019 | A1 |
20190206565 | Shelton, IV | Jul 2019 | A1 |
20190213288 | Bhowmick | Jul 2019 | A1 |
20190332390 | Kaminski | Oct 2019 | A1 |
20190332815 | Kaminski | Oct 2019 | A1 |
20190332816 | Glasco | Oct 2019 | A1 |
20190334706 | Fortenberry | Oct 2019 | A1 |
20200021569 | Simons | Jan 2020 | A1 |
20200034351 | Matsugatani | Jan 2020 | A1 |
20200043128 | Kim | Feb 2020 | A1 |
Number | Date | Country |
---|---|---|
2809992 | Oct 2013 | CA |
2 645 291 | Oct 2013 | EP |
2645291 | Oct 2013 | EP |
2009108776 | Sep 2009 | WO |
WO-2009108776 | Sep 2009 | WO |
Entry |
---|
Lie et al, Architectural Support for Copy and Tamper Resistant, Yr:2000, ACM, https://pdos.csail.mit.edu/archive/6.824-2005/papers/xom.pdf (Year: 2000). |
Chen et al, Certifying Program Execution with Secure Processors, Yr: 2006, MIT, https://pdos.csail.mit.edu/papers/cerium:hotos03.pdf (Year: 2006). |
Suh et al, AEGIS: Architecture for Tamper-Evident and Tamper-Resistant Processing, CSAIL, MIT, http://csg.csail.mit.edu/pubs/memos/Memo-474/Memo-474.pdf (Year: 2004). |
Smith et al, Building a high-performance, programmable secure coprocessor, Yr: 1999, Elsevier, https://www.cs.dartmouth.edu/˜sws/pubs/sw99.pdf (Year: 1999). |
Arora et al, Hardware-Assisted Run-Time Monitoring for Secure Program Execution on Embedded Processors, Yr:2006, IEEE Transactions on Very Large Scale Integration (VLSI) (Year: 2006). |
Meixner et al, Argus: Low-Cost, Comprehensive Error Detection in Simple Cores, Yr:2008, IEEE Computer Society, https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4460512&tag=1 (Year: 2008). |
Tillich et al, Uniform Evaluation of Hardware Implementations of the Round-Two SHA-3 Candidates, Yr: 2010, University of California, Santa Barbara, Candidate Conference, https://burstwiki.org/media/09xxxx-SHABAL_uniform_eval_hw_impl.pdf (Year: 2010). |
Combined Search and Examination Report for GB 1711972.8 dated Jan. 16, 2018, 7 pages. |
Number | Date | Country | |
---|---|---|---|
20190034205 A1 | Jan 2019 | US |