US20200042745A1 - Data Protection in Computer Processors - Google Patents
Data Protection in Computer Processors Download PDFInfo
- Publication number
- US20200042745A1 US20200042745A1 US16/054,913 US201816054913A US2020042745A1 US 20200042745 A1 US20200042745 A1 US 20200042745A1 US 201816054913 A US201816054913 A US 201816054913A US 2020042745 A1 US2020042745 A1 US 2020042745A1
- Authority
- US
- United States
- Prior art keywords
- data
- processor
- unscrambled
- scrambled
- register
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/14—Protection against unauthorised use of memory or access to memory
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/70—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer
- G06F21/71—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure computing or processing of information
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
- G06F12/0875—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches with dedicated cache, e.g. instruction or stack
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/14—Protection against unauthorised use of memory or access to memory
- G06F12/1408—Protection against unauthorised use of memory or access to memory by using cryptography
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/70—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer
- G06F21/71—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure computing or processing of information
- G06F21/72—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure computing or processing of information in cryptographic circuits
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/70—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer
- G06F21/78—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure storage of data
- G06F21/79—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure storage of data in semiconductor storage media, e.g. directly-addressable memories
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
- G06F9/30145—Instruction analysis, e.g. decoding, instruction word fields
- G06F9/3016—Decoding the operand specifier, e.g. specifier format
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
- G06F9/3017—Runtime instruction translation, e.g. macros
- G06F9/30178—Runtime instruction translation, e.g. macros of compressed or encrypted instructions
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/10—Providing a specific technical effect
- G06F2212/1052—Security improvement
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/40—Specific encoding of data in memory or cache
- G06F2212/402—Encrypted data
Definitions
- At least some embodiments disclosed herein relate generally to computer architecture and more specifically, but not limited to, data security in computer processors.
- a typical computer processor receives instructions and/or data from a main memory of the computer system for processing.
- the instructions and/or data can be cached for the processor.
- unauthorized access to the content in the main memory or the processor cache may be made.
- multiple processors or processing cores formed on a same die can share the main memory.
- One processor or processing core can access the content for another processor or processing core through the shared main memory and/or a processor cache memory through memory sharing and/or a cache coherence protocol.
- speculative execution is a computing technique where a processor executes one or more instructions based on the speculation that such instructions need to be executed under some conditions, before the determination result is available as to whether such instructions should be executed or not.
- Speculative execution can lead to security vulnerabilities where unauthorized access to content can be made. Examples of security vulnerabilities in computer processors include Meltdown and Spectre that were made public in 2018.
- FIG. 1 shows a processor having an unscrambler according to at least some embodiments.
- FIG. 2 shows the operations of an unscrambler for recovering a bit from scrambled data.
- FIG. 3 illustrates an unscrambler of a processor.
- FIG. 4 shows a method to unscramble data in a processor according to one embodiment.
- FIG. 5 shows a structure of a processor having different data security zones according to one embodiment.
- the present disclosure includes the techniques of protecting data in a computer processor via data scrambling.
- a data item addressable using an address in the computer processor can be stored in a scrambled form before its use in instruction execution.
- the scrambled data item can be an instruction, an address, or an operand to be operated upon by an instruction.
- the data item can be cached in the scrambled form in an internal cache and/or an external cache; and/or the data item can be stored in the main memory in the scrambled form. Unscrambling can be performed inside the processor to recover the data item just in time for the data item to be used in the processor. When the data item is scrambled, it can be difficult or impossible to recover the data item from the scrambled form without the key.
- the processor unscrambles the data item using the secret key(s) to execute upon the data item.
- the keys or secrets for the scrambling and thus corresponding unscrambling operations are random numbers; and the scrambling/unscrambling operations do not involve computational intensive operations such as those required in asymmetric cryptography.
- the keys or secrets for the scrambling/unscramble operations in the processor are not mathematical/numerical representations of entities, such as the public or private key pairs in asymmetric cryptography.
- FIG. 1 shows a processor ( 101 ) having an unscrambler ( 113 ) according to at least some embodiments.
- the processor ( 101 ) is coupled to a memory ( 105 ) that supplies instructions and data to the processor ( 101 ) for execution.
- the memory ( 105 ) stores scrambled data ( 109 ) that needs to be unscrambled using secret keys.
- the memory ( 105 ) can be the main memory of the computer system, or a storage device of the computer system, or a hybrid memory and storage device.
- the memory ( 105 ) can include volatile memory and/or non-volatile memory.
- the processor ( 101 ) may load the scrambled data ( 109 ) into an external cache ( 103 ) and/or an internal cache ( 107 ). Since the content in the external cache ( 103 ) and/or the internal cache ( 107 ) is scrambled using the secret keys, the content is protected against unauthorized access.
- the unscrambler ( 113 ) is coupled between the internal cache ( 107 ) and a register ( 111 ) and/or an execution unit ( 115 ).
- the unscrambler ( 113 ) generates the unscrambled data ( 117 ) just in time for use in the register ( 111 ) or the execution unit ( 115 ).
- the scrambled data ( 109 ) can be an instruction to be executed in the processor ( 101 ).
- the instruction can be stored in a scrambled form in the internal cache ( 107 ), the external cache ( 103 ), and/or the memory ( 105 ).
- the unscrambler ( 113 ) converts it into an unscrambled form.
- the execution unit ( 115 ) then executes the instruction.
- the processor ( 101 ) also includes a scrambler that scrambles the result of the execution to generate a scrambled result that is subsequently stored in the internal cache ( 107 ), the external cache ( 103 ), and/or the memory ( 105 ).
- the scrambled data ( 109 ) is an operand to be operated upon by an instruction in the processor ( 101 ).
- the item can be stored in the internal cache ( 107 ), the external cache ( 103 ), and/or the memory ( 105 ) in the scrambled form.
- the unscrambler ( 113 ) converts it into an unscrambled form.
- the execution unit ( 115 ) uses the item in the execution of the instruction.
- the execution unit ( 115 ) can be an arithmetic-logic unit; and the item can be an operand to be operated upon during the execution of an instruction in the arithmetic-logic unit, or the instruction itself.
- the data item is in a scrambled form in the memory ( 105 ), the external cache ( 103 ), and the internal cache ( 107 ), another processor ( 102 ) having access to the memory ( 105 ), the external cache ( 103 ), and the internal cache ( 107 ) cannot recover the unscrambled data item without the keys or secrets for unscrambling.
- the scramble/unscramble operations are configured such that the performance impact in the processor ( 101 ) is reduced/minimized.
- scrambling/unscrambling can be performed by reordering the bits in a data item.
- the data item has a predetermined width that corresponds to the number of bits in the data item and/or the width of the register ( 111 ) of the processor ( 101 ).
- the operation of reordering the bits within the data item can be performed efficiently using multiplexers illustrated in FIGS. 2 and 3 .
- FIG. 2 shows the operations of an unscrambler ( 113 ) for recovering a bit ( 113 ) of unscrambled data ( 117 ) from scrambled data ( 109 ).
- the bit j ( 133 ) at a particular position in the unscrambled data ( 117 ) is recovered by applying a corresponding key j ( 153 ) to a multiplexer ( 143 ).
- the multiplexer ( 143 ) receives then bits ( 121 , . . . , 123 , . . . , 125 ) of the scrambled data ( 109 ) as inputs.
- the key j ( 153 ) specifies which one (e.g., 123 ) of the input bits ( 121 , . . .
- the multiplexer ( 143 ) is to be selected by the multiplexer ( 143 ) as the output bit ( 133 ) at the given position j in the unscrambled data ( 117 ).
- the order of the bits ( 121 , . . . , 123 , . . . , 125 ) in the scrambled data ( 109 ) has been changed from the order of the bits in the unscrambled data ( 109 ).
- the key j ( 153 ) is used to select the correct bit (e.g., 123 ) from the scrambled data ( 109 ) as a bit at a particular position j in the unscrambled data ( 117 ).
- the randomly scrambled ordering of the bits ( 121 , . . . , 123 , . . . , 125 ) in the scrambled data ( 109 ) masks the true value of the unscrambled data ( 117 ). Therefore, a direct interpretation of the scrambled data ( 109 ) is useless.
- the operation of the multiplexer ( 143 ) can be implemented efficiently in the processor ( 101 ) using a logic circuit with minimum delay in the execution pipeline. No numerical or complex encryption algorithm operations (e.g., multiplication or division of integer numbers or floating-point numbers) are required to unscramble the data. Thus, an unscrambler ( 113 ) based on the operation of FIG. 2 has minimum impact on the operating performance of the processor ( 101 ).
- FIG. 3 illustrates an unscrambler of a processor.
- the scrambled data ( 109 ) and the unscrambled data ( 117 ) have the same number (n) of bits.
- a same number (n) of multiplexers ( 141 , . . . , 143 , . . . , 145 ) are used to operate on input bits ( 121 , . . . , 123 , . . . , 125 ) of the scrambled data ( 109 ) to output the respective output bits ( 131 , . . . , 133 , . . . , 135 ) of the unscrambled data ( 117 ).
- the multiplexers ( 141 , . . . , 143 , . . . , 145 ) are operated concurrently to minimize the delay caused by unscrambling.
- a reduced number of multiplexers can be used to reduce logic circuits used to implement the unscramble; and the reduced set of multiplexers can be used in iterations of operations to generate different subsets of output bits ( 131 , . . . , 133 , . . . , 135 ), such that the complete set of output bits ( 131 , . . . , 133 , . . . , 135 ) can be computed through the iterations.
- the scrambled data ( 109 ) and the unscrambled data ( 117 ) have the same number (n) of bits and the same values for corresponding bits.
- bit i ( 123 ) in the scrambled data ( 109 ) corresponds to bit j ( 133 ) in the unscrambled data ( 117 ).
- the scrambled data ( 109 ) and the unscrambled data ( 117 ) differ from each other in their bit sequences; and the unscrambled data ( 117 ) can be considered as scrambled version of the scrambled data ( 109 ). Therefore, the set of multiplexers ( 141 , . . .
- the unscrambler ( 113 ) can be used with a complementary set of keys to select the bits ( 131 , . . . , 133 , . . . , 135 ) of the unscrambled data ( 171 ) to generate the bits ( 121 , . . . , 123 . . . , 125 ) of the scrambled data ( 109 ).
- unscrambling key j ( 153 ) identifies select input bit i ( 123 ) from position i of the scrambled data ( 109 ) as output bit j ( 133 ) at position j of the unscrambled data ( 117 )
- a complementary scrambling key i identifies position j in the unscrambled data ( 117 ) for selection as the bit i ( 123 ) at position i in the scrambled data ( 109 ).
- the scrambling keys can be computed from the unscrambling keys ( 151 , . . . , 153 , . . . , 155 ).
- the unscrambler ( 113 ) can function as a scrambler to generate the scrambled data ( 109 ).
- the unscrambling keys ( 151 , . . . , 153 , . . . , 155 ) can be computed from the scrambling keys. Therefore, a scrambler can be implemented in a way as the unscrambler ( 113 ) implemented in FIG.
- the unscrambler ( 113 ) can be reconfigured as a scrambler ( 113 ) by loading a set of scrambling keys to replace the unscrambling keys ( 151 , 153 , . . . , 155 ).
- the scramble/unscrambling operations do not change the data size (n) before and after the operations.
- the storage capacity requirement for the scrambled data ( 109 ) is the same as the storage capacity requirement for the unscrambled data ( 117 ). No extra memory/storage capacity is required to for the scrambled data ( 109 ).
- FIGS. 2 and 3 illustrate a preferred unscrambler ( 113 ). In general, other unscramblers can also be used in the processor ( 101 ).
- a scrambler/unscrambler can be performed by selectively inverting a bit according to the value of a corresponding bit in a key. If the corresponding bit in a key has a predetermined value (e.g., 1), the bit of the input data is inverted to generate the corresponding bit of the output data; otherwise, the bit of the output data is the same as the bit of the input data.
- a predetermined value e.g. 1, 1
- bit inversion operation can be combined with bit re-positioning as in FIGS. 2 and 3 for scrambling/unscrambling.
- FIG. 4 shows a method to unscramble data in a processor according to one embodiment.
- the method of FIG. 4 can be implemented in the computer system of FIG. 1 with an unscrambler ( 113 ) of FIG. 3 .
- a processor ( 101 ) fetches from a memory ( 105 ) a scrambled data item ( 109 ), where bits are reordered according to secret scrambling keys.
- the scrambled data item ( 109 ) can be cached in a cache memory (e.g., 103 and/or 107 ).
- the processor ( 101 ) can be packaged in an integrated circuit chip with an internal cache ( 107 ), at least one register ( 111 ), and at least one execution unit ( 115 ).
- the memory ( 105 ) can be separate from and external to the integrated circuit chip.
- an external cache ( 103 ) is coupled between the processor ( 101 ) and the memory ( 105 ). Data in the memory ( 105 ), the external cache ( 103 ), and the internal cache ( 107 ) can be in a scrambled form.
- programs and/or their data can be stored in an encrypted form in the computer system; and in preparation for execution in the processor ( 101 ), a program and/or its data can be decrypted and stored in the memory ( 105 ) in a scrambled form.
- the processor ( 101 ) unscramble the program and/or its data inside the processor ( 101 ) in a secure zone; and programs and/or data of different users, different applications, and/or different virtual machines can be scrambled differently in the memory ( 105 ) for enhanced data security.
- an unscrambler ( 113 ) loads a key (e.g., 153 ) for each respective bit (e.g., 133 ) to be recovered from the scrambled data item ( 109 ).
- the unscrambler ( 113 ) selects the respective bit (e.g., 133 ) from the scrambled data item ( 109 ) according to the key ( 153 ), in response to the processor ( 101 ) using the data item in instruction execution.
- each unit of the scrambled data ( 109 ) and the corresponding unit of the unscrambled data ( 117 ) have a same number (n) of bits; and the register ( 111 ) has a width (n) that is equal to the number (n) of bits of each unit of scrambled data ( 109 ) or unscrambled data ( 117 ).
- the bit selection is performed with a unit for scrambling/unscrambling.
- the unscrambler ( 113 ) combines the recovered bits ( 131 , . . . , 133 , . . . , 135 ) as an unscrambled data item ( 117 ).
- the unscrambler ( 113 ) provides the unscrambled data item ( 117 ) to a register ( 111 ) or an execution unit ( 115 ) in response to the instruction execution.
- the unscrambled data item ( 117 ) can be an instruction to be executed, an address to be used by an instruction, or an operand to be operated upon during the execution of an instruction.
- the width of the scrambled data ( 109 ) and the width of the unscrambled data ( 117 ) are equal to the width of the register ( 111 ). In other instances, the width of the scrambled data ( 109 ) and the width of the unscrambled data ( 117 ) can be smaller than the width of the register ( 111 ). For example, a portion of a unit of data having the width equal to the width of the register ( 111 ) is scrambled; and the remaining portion of the unit is not scrambled. Unscrambling is performed for the scrambled portion that has a width smaller than the width of the register ( 111 ).
- the data is loaded into the register ( 111 ) in the scrambled form.
- the data in the register ( 111 ) is to be used in the execution, the data is unscrambled for use by the execution unit ( 115 ).
- the register ( 111 ) can be a data register, an address register, or an instruction register.
- the input of the unscrambler ( 113 ) is coupled to the output of the register ( 111 ) to receive the content in a scrambled form; and the output of the unscrambler ( 113 ) provides the content in an unscrambled from as input to the execution unit ( 115 ).
- the unscrambler ( 113 ) is positioned in the processor ( 101 ) on the data path between the register ( 111 ) and the execution unit ( 115 ).
- the unscrambler ( 113 ) can be positioned in the processor ( 101 ) in the data path just before the register ( 111 ) such that when loading data from the cache ( 107 ) into the register ( 111 ), the data leaves the internal cache ( 107 ) in a scrambled form and enters the register ( 111 ) in an unscrambled form.
- the unscrambler ( 113 ) can be positioned in the processor ( 101 ) in the data path from the internal cache ( 107 ) to the remaining part of the processor ( 101 ).
- the data leaves the internal cache ( 107 ) in a scrambled form for use during instruction execution in the remaining part of the processor ( 101 ) in an unscrambled form.
- FIG. 5 shows a structure of a processor ( 101 ) having different data security zones ( 161 , 163 ) according to one embodiment.
- the processor ( 101 ) can have a scrambled zone ( 161 ) and an unscrambled zone ( 163 ).
- the scrambled zone ( 161 ) includes the internal cache ( 107 ).
- the unscrambled zone ( 163 ) includes the execution unit ( 115 ). Thus, the execution unit ( 115 ) does not operate on any scrambled data (e.g., 109 ).
- the register ( 111 ) can be in the scrambled zone ( 161 ) or the unscrambled zone ( 163 ).
- An unscrambler ( 113 ) and a scrambler ( 112 ) interface or connect the scrambled zone ( 161 ) and the unscrambled zone ( 163 ).
- Content in the scrambled zone ( 161 ) is in a scrambled form; and content in the unscrambled zone ( 163 ) is in an unscrambled form.
- the processor ( 101 ) unscrambles content in the scrambled zone ( 161 ) to perform computation in the unscrambled zone ( 163 ) and scrambles the computation results before the computation results leave the unscrambled zone ( 163 ) and enter the scrambled zone ( 161 ).
- the unscrambler ( 113 ) converts scrambled data ( 109 ) into the unscrambled data ( 117 ) (e.g., for an arithmetic-logic unit of the processor ( 101 )); and the unscrambler ( 113 ) does not use the arithmetic-logic unit for unscrambling operations).
- the scrambler ( 112 ) converts a data item to be stored from an unscrambled form into a scrambled form.
- the scrambled result can be initially cached in the scrambled zone ( 161 ) and then stored in the external cache ( 103 ), the main memory ( 105 ), and/or a peripheral storage device in the scrambled form.
- the unscrambler ( 113 ) and the scrambler ( 112 ) can share a portion of logic circuits (e.g., multipliers ( 141 , . . . , 143 , . . . , 145 ).
- the unscrambler ( 113 ) configured to load data from the scrambled zone ( 161 ) to the unscrambled zone ( 163 ) in response to load instructions can be reconfigured as a scrambler ( 112 ) by changing the keys ( 151 , . . . , 153 , . . . , 155 ) for scrambling output data going from the unscrambled zone ( 163 ) to the scrambled zone ( 161 ) in response to store instructions.
- FIG. 1 illustrates the storing of data in a scrambled form in the main memory ( 105 ) and the cache memories ( 103 and 107 ) of a processor ( 101 ).
- Data can also be in the scrambled form in a storage device (e.g., a disk or a flash drive coupled to a peripheral bus of a computer system).
- a storage device e.g., a disk or a flash drive coupled to a peripheral bus of a computer system.
- the use of the unscrambler ( 113 ) in the processor ( 101 ) limits the availability of clear, unscrambled content to only in a portion of the processor ( 101 ) and thus improves data security in the computer system.
- the techniques disclosed herein can be applied to at least to computer systems where processors are separated from memory and processors communicate with memory and storage devices via communication buses and/or computer networks. Further, the techniques disclosed herein can be applied to computer systems in which processing capabilities are integrated within memory/storage.
- the processing circuits including executing units and/or registers of a typical processor, can be implemented within the integrated circuits and/or the integrated circuit packages of memory media to performing processing within a memory device.
- a processor e.g., 101
- the processor can be a unit integrated within memory to overcome the von Neumann bottleneck that limits computing performance as a result of a limit in throughput caused by latency in data moves between a central processing unit and memory configured separately according to the von Neumann architecture.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Security & Cryptography (AREA)
- Software Systems (AREA)
- Computer Hardware Design (AREA)
- Health & Medical Sciences (AREA)
- Bioethics (AREA)
- General Health & Medical Sciences (AREA)
- Mathematical Physics (AREA)
- Storage Device Security (AREA)
- Advance Control (AREA)
Abstract
Description
- At least some embodiments disclosed herein relate generally to computer architecture and more specifically, but not limited to, data security in computer processors.
- A typical computer processor receives instructions and/or data from a main memory of the computer system for processing. The instructions and/or data can be cached for the processor. In some instances, unauthorized access to the content in the main memory or the processor cache may be made. For example, multiple processors or processing cores formed on a same die can share the main memory. One processor or processing core can access the content for another processor or processing core through the shared main memory and/or a processor cache memory through memory sharing and/or a cache coherence protocol.
- For example, speculative execution is a computing technique where a processor executes one or more instructions based on the speculation that such instructions need to be executed under some conditions, before the determination result is available as to whether such instructions should be executed or not. Speculative execution can lead to security vulnerabilities where unauthorized access to content can be made. Examples of security vulnerabilities in computer processors include Meltdown and Spectre that were made public in 2018.
- The embodiments are illustrated by way of example and not limitation in the figures of the accompanying drawings in which like references indicate similar elements.
-
FIG. 1 shows a processor having an unscrambler according to at least some embodiments. -
FIG. 2 shows the operations of an unscrambler for recovering a bit from scrambled data. -
FIG. 3 illustrates an unscrambler of a processor. -
FIG. 4 shows a method to unscramble data in a processor according to one embodiment. -
FIG. 5 shows a structure of a processor having different data security zones according to one embodiment. - The present disclosure includes the techniques of protecting data in a computer processor via data scrambling.
- For example, a data item addressable using an address in the computer processor can be stored in a scrambled form before its use in instruction execution. The scrambled data item can be an instruction, an address, or an operand to be operated upon by an instruction. The data item can be cached in the scrambled form in an internal cache and/or an external cache; and/or the data item can be stored in the main memory in the scrambled form. Unscrambling can be performed inside the processor to recover the data item just in time for the data item to be used in the processor. When the data item is scrambled, it can be difficult or impossible to recover the data item from the scrambled form without the key. The processor unscrambles the data item using the secret key(s) to execute upon the data item. Thus, the data security in the processor is improved. Preferably, the keys or secrets for the scrambling and thus corresponding unscrambling operations are random numbers; and the scrambling/unscrambling operations do not involve computational intensive operations such as those required in asymmetric cryptography. Preferably, the keys or secrets for the scrambling/unscramble operations in the processor are not mathematical/numerical representations of entities, such as the public or private key pairs in asymmetric cryptography.
-
FIG. 1 shows a processor (101) having an unscrambler (113) according to at least some embodiments. - In
FIG. 1 , the processor (101) is coupled to a memory (105) that supplies instructions and data to the processor (101) for execution. The memory (105) stores scrambled data (109) that needs to be unscrambled using secret keys. In general, the memory (105) can be the main memory of the computer system, or a storage device of the computer system, or a hybrid memory and storage device. The memory (105) can include volatile memory and/or non-volatile memory. - The processor (101) may load the scrambled data (109) into an external cache (103) and/or an internal cache (107). Since the content in the external cache (103) and/or the internal cache (107) is scrambled using the secret keys, the content is protected against unauthorized access.
- The unscrambler (113) is coupled between the internal cache (107) and a register (111) and/or an execution unit (115). The unscrambler (113) generates the unscrambled data (117) just in time for use in the register (111) or the execution unit (115).
- For example, the scrambled data (109) can be an instruction to be executed in the processor (101). The instruction can be stored in a scrambled form in the internal cache (107), the external cache (103), and/or the memory (105). Just before the execution of the instruction, the unscrambler (113) converts it into an unscrambled form. The execution unit (115) then executes the instruction.
- In some instances, the processor (101) also includes a scrambler that scrambles the result of the execution to generate a scrambled result that is subsequently stored in the internal cache (107), the external cache (103), and/or the memory (105).
- In another example, the scrambled data (109) is an operand to be operated upon by an instruction in the processor (101). The item can be stored in the internal cache (107), the external cache (103), and/or the memory (105) in the scrambled form. Just before the item is loaded into the register (111) or the execution unit (115) for operations, the unscrambler (113) converts it into an unscrambled form. The execution unit (115) then uses the item in the execution of the instruction. For example, the execution unit (115) can be an arithmetic-logic unit; and the item can be an operand to be operated upon during the execution of an instruction in the arithmetic-logic unit, or the instruction itself.
- Since the data item is in a scrambled form in the memory (105), the external cache (103), and the internal cache (107), another processor (102) having access to the memory (105), the external cache (103), and the internal cache (107) cannot recover the unscrambled data item without the keys or secrets for unscrambling.
- Preferably, the scramble/unscramble operations are configured such that the performance impact in the processor (101) is reduced/minimized.
- For example, scrambling/unscrambling can be performed by reordering the bits in a data item. The data item has a predetermined width that corresponds to the number of bits in the data item and/or the width of the register (111) of the processor (101). The operation of reordering the bits within the data item can be performed efficiently using multiplexers illustrated in
FIGS. 2 and 3 . -
FIG. 2 shows the operations of an unscrambler (113) for recovering a bit (113) of unscrambled data (117) from scrambled data (109). - In
FIG. 2 , the bit j (133) at a particular position in the unscrambled data (117) is recovered by applying a corresponding key j (153) to a multiplexer (143). The multiplexer (143) receives then bits (121, . . . , 123, . . . , 125) of the scrambled data (109) as inputs. The key j (153) specifies which one (e.g., 123) of the input bits (121, . . . , 125) is to be selected by the multiplexer (143) as the output bit (133) at the given position j in the unscrambled data (117). The order of the bits (121, . . . , 123, . . . , 125) in the scrambled data (109) has been changed from the order of the bits in the unscrambled data (109). The key j (153) is used to select the correct bit (e.g., 123) from the scrambled data (109) as a bit at a particular position j in the unscrambled data (117). Without the secret/key j (153), the randomly scrambled ordering of the bits (121, . . . , 123, . . . , 125) in the scrambled data (109) masks the true value of the unscrambled data (117). Therefore, a direct interpretation of the scrambled data (109) is useless. - The operation of the multiplexer (143) can be implemented efficiently in the processor (101) using a logic circuit with minimum delay in the execution pipeline. No numerical or complex encryption algorithm operations (e.g., multiplication or division of integer numbers or floating-point numbers) are required to unscramble the data. Thus, an unscrambler (113) based on the operation of
FIG. 2 has minimum impact on the operating performance of the processor (101). -
FIG. 3 illustrates an unscrambler of a processor. - In
FIG. 3 , the scrambled data (109) and the unscrambled data (117) have the same number (n) of bits. A same number (n) of multiplexers (141, . . . , 143, . . . , 145) are used to operate on input bits (121, . . . , 123, . . . , 125) of the scrambled data (109) to output the respective output bits (131, . . . , 133, . . . , 135) of the unscrambled data (117). The multiplexers (141, . . . , 143, . . . , 145) change the order of the bits (121, . . . , 123, . . . , 125) of the scramble data (109) to the order of the bits (131, . . . , 133, . . . , 135) of the unscrambled data (117). - Preferably, the multiplexers (141, . . . , 143, . . . , 145) are operated concurrently to minimize the delay caused by unscrambling. Alternatively, a reduced number of multiplexers can be used to reduce logic circuits used to implement the unscramble; and the reduced set of multiplexers can be used in iterations of operations to generate different subsets of output bits (131, . . . , 133, . . . , 135), such that the complete set of output bits (131, . . . , 133, . . . , 135) can be computed through the iterations.
- As illustrated in
FIG. 3 , the scrambled data (109) and the unscrambled data (117) have the same number (n) of bits and the same values for corresponding bits. For example, bit i (123) in the scrambled data (109) corresponds to bit j (133) in the unscrambled data (117). Thus, the scrambled data (109) and the unscrambled data (117) differ from each other in their bit sequences; and the unscrambled data (117) can be considered as scrambled version of the scrambled data (109). Therefore, the set of multiplexers (141, . . . , 143, . . . , 145) of the unscrambler (113) can be used with a complementary set of keys to select the bits (131, . . . , 133, . . . , 135) of the unscrambled data (171) to generate the bits (121, . . . , 123 . . . , 125) of the scrambled data (109). For example, since unscrambling key j (153) identifies select input bit i (123) from position i of the scrambled data (109) as output bit j (133) at position j of the unscrambled data (117), a complementary scrambling key i identifies position j in the unscrambled data (117) for selection as the bit i (123) at position i in the scrambled data (109). Thus, the scrambling keys can be computed from the unscrambling keys (151, . . . , 153, . . . , 155). By applying the complementary set of scrambling keys in the unscrambler (113) to operate on the unscrambled data (117), the unscrambler (113) can function as a scrambler to generate the scrambled data (109). Similarly, the unscrambling keys (151, . . . , 153, . . . , 155) can be computed from the scrambling keys. Therefore, a scrambler can be implemented in a way as the unscrambler (113) implemented inFIG. 3 ; and the unscrambler (113) can be reconfigured as a scrambler (113) by loading a set of scrambling keys to replace the unscrambling keys (151, 153, . . . , 155). - As illustrated in the
FIG. 3 , the scramble/unscrambling operations do not change the data size (n) before and after the operations. The storage capacity requirement for the scrambled data (109) is the same as the storage capacity requirement for the unscrambled data (117). No extra memory/storage capacity is required to for the scrambled data (109). -
FIGS. 2 and 3 illustrate a preferred unscrambler (113). In general, other unscramblers can also be used in the processor (101). - For example, a scrambler/unscrambler can be performed by selectively inverting a bit according to the value of a corresponding bit in a key. If the corresponding bit in a key has a predetermined value (e.g., 1), the bit of the input data is inverted to generate the corresponding bit of the output data; otherwise, the bit of the output data is the same as the bit of the input data.
- For example, the bit inversion operation can be combined with bit re-positioning as in
FIGS. 2 and 3 for scrambling/unscrambling. -
FIG. 4 shows a method to unscramble data in a processor according to one embodiment. For example, the method ofFIG. 4 can be implemented in the computer system ofFIG. 1 with an unscrambler (113) ofFIG. 3 . - At
block 201, a processor (101) fetches from a memory (105) a scrambled data item (109), where bits are reordered according to secret scrambling keys. The scrambled data item (109) can be cached in a cache memory (e.g., 103 and/or 107). - For example, the processor (101) can be packaged in an integrated circuit chip with an internal cache (107), at least one register (111), and at least one execution unit (115). The memory (105) can be separate from and external to the integrated circuit chip. Optionally, an external cache (103) is coupled between the processor (101) and the memory (105). Data in the memory (105), the external cache (103), and the internal cache (107) can be in a scrambled form. For example, programs and/or their data can be stored in an encrypted form in the computer system; and in preparation for execution in the processor (101), a program and/or its data can be decrypted and stored in the memory (105) in a scrambled form. The processor (101) unscramble the program and/or its data inside the processor (101) in a secure zone; and programs and/or data of different users, different applications, and/or different virtual machines can be scrambled differently in the memory (105) for enhanced data security.
- At
block 203, an unscrambler (113) loads a key (e.g., 153) for each respective bit (e.g., 133) to be recovered from the scrambled data item (109). - At block 205, the unscrambler (113) selects the respective bit (e.g., 133) from the scrambled data item (109) according to the key (153), in response to the processor (101) using the data item in instruction execution.
- Preferably, each unit of the scrambled data (109) and the corresponding unit of the unscrambled data (117) have a same number (n) of bits; and the register (111) has a width (n) that is equal to the number (n) of bits of each unit of scrambled data (109) or unscrambled data (117). The bit selection is performed with a unit for scrambling/unscrambling.
- At
block 207, the unscrambler (113) combines the recovered bits (131, . . . , 133, . . . , 135) as an unscrambled data item (117). - At
block 209, the unscrambler (113) provides the unscrambled data item (117) to a register (111) or an execution unit (115) in response to the instruction execution. - For example, the unscrambled data item (117) can be an instruction to be executed, an address to be used by an instruction, or an operand to be operated upon during the execution of an instruction.
- In some instances, the width of the scrambled data (109) and the width of the unscrambled data (117) are equal to the width of the register (111). In other instances, the width of the scrambled data (109) and the width of the unscrambled data (117) can be smaller than the width of the register (111). For example, a portion of a unit of data having the width equal to the width of the register (111) is scrambled; and the remaining portion of the unit is not scrambled. Unscrambling is performed for the scrambled portion that has a width smaller than the width of the register (111).
- In some instances, the data is loaded into the register (111) in the scrambled form. When the data in the register (111) is to be used in the execution, the data is unscrambled for use by the execution unit (115). The register (111) can be a data register, an address register, or an instruction register. For example, the input of the unscrambler (113) is coupled to the output of the register (111) to receive the content in a scrambled form; and the output of the unscrambler (113) provides the content in an unscrambled from as input to the execution unit (115). Thus, the unscrambler (113) is positioned in the processor (101) on the data path between the register (111) and the execution unit (115).
- Alternatively, the unscrambler (113) can be positioned in the processor (101) in the data path just before the register (111) such that when loading data from the cache (107) into the register (111), the data leaves the internal cache (107) in a scrambled form and enters the register (111) in an unscrambled form.
- Alternatively, the unscrambler (113) can be positioned in the processor (101) in the data path from the internal cache (107) to the remaining part of the processor (101). Thus, the data leaves the internal cache (107) in a scrambled form for use during instruction execution in the remaining part of the processor (101) in an unscrambled form.
-
FIG. 5 shows a structure of a processor (101) having different data security zones (161, 163) according to one embodiment. - The processor (101) can have a scrambled zone (161) and an unscrambled zone (163). The scrambled zone (161) includes the internal cache (107). The unscrambled zone (163) includes the execution unit (115). Thus, the execution unit (115) does not operate on any scrambled data (e.g., 109). The register (111) can be in the scrambled zone (161) or the unscrambled zone (163). An unscrambler (113) and a scrambler (112) interface or connect the scrambled zone (161) and the unscrambled zone (163). Content in the scrambled zone (161) is in a scrambled form; and content in the unscrambled zone (163) is in an unscrambled form. The processor (101) unscrambles content in the scrambled zone (161) to perform computation in the unscrambled zone (163) and scrambles the computation results before the computation results leave the unscrambled zone (163) and enter the scrambled zone (161). For example, in response to a load instruction, the unscrambler (113) converts scrambled data (109) into the unscrambled data (117) (e.g., for an arithmetic-logic unit of the processor (101)); and the unscrambler (113) does not use the arithmetic-logic unit for unscrambling operations). In response to a store instruction, the scrambler (112) converts a data item to be stored from an unscrambled form into a scrambled form. The scrambled result can be initially cached in the scrambled zone (161) and then stored in the external cache (103), the main memory (105), and/or a peripheral storage device in the scrambled form. Optionally, the unscrambler (113) and the scrambler (112) can share a portion of logic circuits (e.g., multipliers (141, . . . , 143, . . . , 145). For example, the unscrambler (113) configured to load data from the scrambled zone (161) to the unscrambled zone (163) in response to load instructions can be reconfigured as a scrambler (112) by changing the keys (151, . . . , 153, . . . , 155) for scrambling output data going from the unscrambled zone (163) to the scrambled zone (161) in response to store instructions.
-
FIG. 1 illustrates the storing of data in a scrambled form in the main memory (105) and the cache memories (103 and 107) of a processor (101). Data can also be in the scrambled form in a storage device (e.g., a disk or a flash drive coupled to a peripheral bus of a computer system). Thus, when the data is loaded from the storage device into the main memory (105) and/or the cache memories (103 and 107), it is already in the scrambled form. - The use of the unscrambler (113) in the processor (101) limits the availability of clear, unscrambled content to only in a portion of the processor (101) and thus improves data security in the computer system.
- The techniques disclosed herein can be applied to at least to computer systems where processors are separated from memory and processors communicate with memory and storage devices via communication buses and/or computer networks. Further, the techniques disclosed herein can be applied to computer systems in which processing capabilities are integrated within memory/storage. For example, the processing circuits, including executing units and/or registers of a typical processor, can be implemented within the integrated circuits and/or the integrated circuit packages of memory media to performing processing within a memory device. Thus, a processor (e.g., 101) as discussed above and illustrated in the drawings is not necessarily a central processing unit in the von Neumann architecture. The processor can be a unit integrated within memory to overcome the von Neumann bottleneck that limits computing performance as a result of a limit in throughput caused by latency in data moves between a central processing unit and memory configured separately according to the von Neumann architecture.
- The description and drawings of the present disclosure are illustrative and are not to be construed as limiting. Numerous specific details are described to provide a thorough understanding. However, in certain instances, well known or conventional details are not described in order to avoid obscuring the description. References to one or an embodiment in the present disclosure are not necessarily references to the same embodiment; and, such references mean at least one.
- In the foregoing specification, the disclosure has been described with reference to specific exemplary embodiments thereof. It will be evident that various modifications can be made thereto without departing from the broader spirit and scope as set forth in the following claims. The specification and drawings are, accordingly, to be regarded in an illustrative sense rather than a restrictive sense.
Claims (20)
Priority Applications (6)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US16/054,913 US11113422B2 (en) | 2018-08-03 | 2018-08-03 | Data protection in computer processors |
| KR1020217006464A KR20210030985A (en) | 2018-08-03 | 2019-07-24 | Computer processor data protection |
| PCT/US2019/043291 WO2020028120A1 (en) | 2018-08-03 | 2019-07-24 | Data protection in computer processors |
| EP19845010.8A EP3830703B1 (en) | 2018-08-03 | 2019-07-24 | Data protection in computer processors |
| CN201980051069.8A CN112543923B (en) | 2018-08-03 | 2019-07-24 | Data protection in computer processors |
| US17/383,123 US11914756B2 (en) | 2018-08-03 | 2021-07-22 | Data protection in computer processors |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US16/054,913 US11113422B2 (en) | 2018-08-03 | 2018-08-03 | Data protection in computer processors |
Related Child Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| US17/383,123 Continuation US11914756B2 (en) | 2018-08-03 | 2021-07-22 | Data protection in computer processors |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| US20200042745A1 true US20200042745A1 (en) | 2020-02-06 |
| US11113422B2 US11113422B2 (en) | 2021-09-07 |
Family
ID=69229697
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| US16/054,913 Active 2039-03-08 US11113422B2 (en) | 2018-08-03 | 2018-08-03 | Data protection in computer processors |
| US17/383,123 Active 2038-09-09 US11914756B2 (en) | 2018-08-03 | 2021-07-22 | Data protection in computer processors |
Family Applications After (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| US17/383,123 Active 2038-09-09 US11914756B2 (en) | 2018-08-03 | 2021-07-22 | Data protection in computer processors |
Country Status (5)
| Country | Link |
|---|---|
| US (2) | US11113422B2 (en) |
| EP (1) | EP3830703B1 (en) |
| KR (1) | KR20210030985A (en) |
| CN (1) | CN112543923B (en) |
| WO (1) | WO2020028120A1 (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20210152190A1 (en) * | 2019-11-14 | 2021-05-20 | Micron Technology, Inc. | Apparatus with a data security mechanism and methods for operating the same |
| US20230342169A1 (en) * | 2022-04-25 | 2023-10-26 | Red Hat, Inc. | Encrypted memory guest/host communication |
| US11914756B2 (en) | 2018-08-03 | 2024-02-27 | Micron Technology, Inc. | Data protection in computer processors |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6061449A (en) * | 1997-10-10 | 2000-05-09 | General Instrument Corporation | Secure processor with external memory using block chaining and block re-ordering |
| US20090304180A1 (en) * | 2008-06-09 | 2009-12-10 | International Business Machines Corporation | Key evolution method and system of block ciphering |
| US20120002812A1 (en) * | 2010-06-30 | 2012-01-05 | International Business Machines Corporation | Data and control encryption |
Family Cites Families (36)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2232826C (en) * | 1993-12-16 | 2000-12-12 | International Business Machines Corporation | Protected programmable memory cartridge and computer system using same |
| US6532556B1 (en) | 2000-01-27 | 2003-03-11 | Multi Level Memory Technology | Data management for multi-bit-per-cell memories |
| US6567817B1 (en) | 2000-09-08 | 2003-05-20 | Hewlett-Packard Development Company, L.P. | Cache management system using hashing |
| JP2002185447A (en) * | 2000-12-18 | 2002-06-28 | Toshiba Corp | Secret data processing device and its electronic components |
| EP1320006A1 (en) | 2001-12-12 | 2003-06-18 | Canal+ Technologies Société Anonyme | Processing data |
| TWI288348B (en) * | 2003-07-09 | 2007-10-11 | Sunplus Technology Co Ltd | Processor using data block scrambling for data protection and method thereof |
| US7996671B2 (en) | 2003-11-17 | 2011-08-09 | Bluerisc Inc. | Security of program executables and microprocessors based on compiler-architecture interaction |
| EP1605359A1 (en) | 2004-06-11 | 2005-12-14 | Axalto SA | Hiding information transmitted on a data bus |
| US7921301B2 (en) * | 2005-05-17 | 2011-04-05 | Dot Hill Systems Corporation | Method and apparatus for obscuring data on removable storage devices |
| CN101273573B (en) * | 2005-09-26 | 2011-09-07 | 松下电器产业株式会社 | Data descramble apparatus and data descramble method |
| US8769311B2 (en) | 2006-05-31 | 2014-07-01 | International Business Machines Corporation | Systems and methods for transformation of logical data objects for storage |
| US8284929B2 (en) | 2006-09-14 | 2012-10-09 | Uniloc Luxembourg S.A. | System of dependant keys across multiple pieces of related scrambled information |
| US8301912B2 (en) * | 2007-12-31 | 2012-10-30 | Sandisk Technologies Inc. | System, method and memory device providing data scrambling compatible with on-chip copy operation |
| US8555015B2 (en) | 2008-10-23 | 2013-10-08 | Maxim Integrated Products, Inc. | Multi-layer content protecting microcontroller |
| US9117060B2 (en) | 2009-05-07 | 2015-08-25 | Cadence Design Systems, Inc. | System and method for preventing proper execution of an application program in an unauthorized processor |
| US8854882B2 (en) | 2010-01-27 | 2014-10-07 | Intelligent Intellectual Property Holdings 2 Llc | Configuring storage cells |
| US8885821B2 (en) | 2010-01-28 | 2014-11-11 | Cleversafe, Inc. | Sequencing encoded data slices |
| US8386749B2 (en) | 2010-03-16 | 2013-02-26 | Advanced Micro Devices, Inc. | Address mapping in virtualized processing system |
| US8843693B2 (en) | 2011-05-17 | 2014-09-23 | SanDisk Technologies, Inc. | Non-volatile memory and method with improved data scrambling |
| US8782375B2 (en) | 2012-01-17 | 2014-07-15 | International Business Machines Corporation | Hash-based managing of storage identifiers |
| US9400890B2 (en) | 2012-08-10 | 2016-07-26 | Qualcomm Incorporated | Method and devices for selective RAM scrambling |
| KR102201062B1 (en) | 2012-10-04 | 2021-01-11 | 인트린직 아이디 비브이 | System for generating a cryptographic key from a memory used as a physically unclonable function |
| US11228427B2 (en) | 2014-02-11 | 2022-01-18 | Ericsson Ab | System and method for securing content keys delivered in manifest files |
| US9753863B2 (en) | 2014-12-27 | 2017-09-05 | Intel Corporation | Memory protection with non-readable pages |
| US9898611B2 (en) * | 2015-03-30 | 2018-02-20 | Rockwell Automation Technologies, Inc. | Method and apparatus for scrambling a high speed data transmission |
| US10311229B1 (en) | 2015-05-18 | 2019-06-04 | Amazon Technologies, Inc. | Mitigating timing side-channel attacks by obscuring alternatives in code |
| GB2544546B (en) | 2015-11-20 | 2020-07-15 | Advanced Risc Mach Ltd | Dynamic memory scrambling |
| US10185731B2 (en) | 2016-03-31 | 2019-01-22 | Arm Limited | Indexing entries of a storage structure shared between multiple threads |
| US10423804B2 (en) | 2016-06-12 | 2019-09-24 | Apple Inc. | Cryptographic separation of users |
| US11126565B2 (en) | 2016-06-27 | 2021-09-21 | Hewlett Packard Enterprise Development Lp | Encrypted memory access using page table attributes |
| US10073661B2 (en) | 2016-07-20 | 2018-09-11 | Atmel Corporation | Security extensions for non-volatile memory |
| FR3055734B1 (en) * | 2016-09-05 | 2018-09-28 | STMicroelectronics (Grand Ouest) SAS | METHOD AND DEVICE FOR MITIGATING ELECTROMAGNETIC INTERFERENCE DURING TRANSFER OF DATA FROM OR TO A MEMORY. |
| US10740466B1 (en) | 2016-09-29 | 2020-08-11 | Amazon Technologies, Inc. | Securing interfaces of a compute node |
| US10552643B2 (en) * | 2016-12-28 | 2020-02-04 | Intel Corporation | Fast boot up memory controller |
| US11113422B2 (en) | 2018-08-03 | 2021-09-07 | Micron Technology, Inc. | Data protection in computer processors |
| US11074198B2 (en) | 2018-09-18 | 2021-07-27 | Micron Technology, Inc. | Key management in computer processors |
-
2018
- 2018-08-03 US US16/054,913 patent/US11113422B2/en active Active
-
2019
- 2019-07-24 EP EP19845010.8A patent/EP3830703B1/en active Active
- 2019-07-24 WO PCT/US2019/043291 patent/WO2020028120A1/en not_active Ceased
- 2019-07-24 CN CN201980051069.8A patent/CN112543923B/en active Active
- 2019-07-24 KR KR1020217006464A patent/KR20210030985A/en not_active Ceased
-
2021
- 2021-07-22 US US17/383,123 patent/US11914756B2/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6061449A (en) * | 1997-10-10 | 2000-05-09 | General Instrument Corporation | Secure processor with external memory using block chaining and block re-ordering |
| US20090304180A1 (en) * | 2008-06-09 | 2009-12-10 | International Business Machines Corporation | Key evolution method and system of block ciphering |
| US20120002812A1 (en) * | 2010-06-30 | 2012-01-05 | International Business Machines Corporation | Data and control encryption |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11914756B2 (en) | 2018-08-03 | 2024-02-27 | Micron Technology, Inc. | Data protection in computer processors |
| US20210152190A1 (en) * | 2019-11-14 | 2021-05-20 | Micron Technology, Inc. | Apparatus with a data security mechanism and methods for operating the same |
| US11165444B2 (en) * | 2019-11-14 | 2021-11-02 | Micron Technology, Inc. | Apparatus with a data security mechanism and methods for operating the same |
| US20230342169A1 (en) * | 2022-04-25 | 2023-10-26 | Red Hat, Inc. | Encrypted memory guest/host communication |
| US12430159B2 (en) * | 2022-04-25 | 2025-09-30 | Red Hat, Inc. | Encrypted memory guest/host communication |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112543923B (en) | 2025-03-07 |
| CN112543923A (en) | 2021-03-23 |
| US11113422B2 (en) | 2021-09-07 |
| EP3830703A1 (en) | 2021-06-09 |
| KR20210030985A (en) | 2021-03-18 |
| EP3830703A4 (en) | 2022-04-20 |
| EP3830703B1 (en) | 2025-12-17 |
| US20210350030A1 (en) | 2021-11-11 |
| US11914756B2 (en) | 2024-02-27 |
| WO2020028120A1 (en) | 2020-02-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11868274B2 (en) | Key management in computer processors | |
| US9847872B2 (en) | Memory integrity | |
| US11914756B2 (en) | Data protection in computer processors | |
| EP3839788B1 (en) | Bit-length parameterizable cipher | |
| US11222127B2 (en) | Processor hardware and instructions for SHA3 cryptographic operations | |
| CN113168486B (en) | Processor with adjustable security level according to application | |
| US12316742B2 (en) | Hardware circuit to perform round computations of ARX-based stream ciphers | |
| KR20200083230A (en) | Secure branch predictor with context-specific learned instruction target address encryption | |
| KR20180059217A (en) | Apparatus and method for secure processing of memory data | |
| Adetomi et al. | Towards an efficient intellectual property protection in dynamically reconfigurable FPGAs | |
| Chen et al. | Deploying scalable and secure secret sharing with gpu many-core architecture | |
| US11061996B2 (en) | Intrinsic authentication of program code | |
| Sharma et al. | An Efficient and Secure Database System using OpenCL | |
| CN120255787A (en) | Method for improving security of multi-tenant storage module |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| FEPP | Fee payment procedure |
Free format text: ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: BIG.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
| AS | Assignment |
Owner name: MICRON TECHNOLOGY, INC., IDAHO Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:WALLACH, STEVEN JEFFREY;REEL/FRAME:047040/0647 Effective date: 20180803 |
|
| AS | Assignment |
Owner name: JPMORGAN CHASE BANK, N.A.., AS COLLATERAL AGENT, ILLINOIS Free format text: SUPPLEMENT NO. 1 TO PATENT SECURITY AGREEMENT;ASSIGNOR:MICRON TECHNOLOGY, INC.;REEL/FRAME:047630/0756 Effective date: 20181015 Owner name: MORGAN STANLEY SENIOR FUNDING, INC., AS COLLATERAL AGENT, MARYLAND Free format text: SUPPLEMENT NO. 10 TO PATENT SECURITY AGREEMENT;ASSIGNOR:MICRON TECHNOLOGY, INC.;REEL/FRAME:048102/0420 Effective date: 20181015 |
|
| AS | Assignment |
Owner name: MICRON TECHNOLOGY, INC., IDAHO Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:MORGAN STANLEY SENIOR FUNDING, INC., AS COLLATERAL AGENT;REEL/FRAME:050719/0550 Effective date: 20190731 |
|
| AS | Assignment |
Owner name: MICRON TECHNOLOGY, INC., IDAHO Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT;REEL/FRAME:051028/0835 Effective date: 20190731 |
|
| STPP | Information on status: patent application and granting procedure in general |
Free format text: NON FINAL ACTION MAILED |
|
| STPP | Information on status: patent application and granting procedure in general |
Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER |
|
| STPP | Information on status: patent application and granting procedure in general |
Free format text: NON FINAL ACTION MAILED |
|
| STPP | Information on status: patent application and granting procedure in general |
Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER |
|
| STPP | Information on status: patent application and granting procedure in general |
Free format text: NOTICE OF ALLOWANCE MAILED -- APPLICATION RECEIVED IN OFFICE OF PUBLICATIONS |
|
| STPP | Information on status: patent application and granting procedure in general |
Free format text: PUBLICATIONS -- ISSUE FEE PAYMENT RECEIVED |
|
| STPP | Information on status: patent application and granting procedure in general |
Free format text: PUBLICATIONS -- ISSUE FEE PAYMENT VERIFIED |
|
| STPP | Information on status: patent application and granting procedure in general |
Free format text: PUBLICATIONS -- ISSUE FEE PAYMENT VERIFIED |
|
| STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
| MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 4TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1551); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Year of fee payment: 4 |