Intel Corporation

Marvellworld Trade Ltd.

Marvell International Limited

Intryca, Inc.

Kahraman D Akdemir

Tolga Nihat Aytek

Deniz Karakoyunlu

Vinodh Gopal

Gilbert M Wolrich

Wajdi K Feghali

Martin Guy Dixon

Erdinc Ozturk

James D Guilford

Daniel J Ragland

Ariel Gur

Kirk Pfaender

Pavithra Sampath

Ghaith Hammouri

Cetin Kaya Koc

Berk Sunar

Jim D Guilford

An integrated circuit of an aspect includes a power control unit having an interface to receive an indication that one or more instructions of a first type are to be performed by a core. The power control unit also has logic to control a maximum clock frequency for the core based on the indication that the instructions of the first type are to be performed by the core.

Processors, methods, and systems to adjust maximum clock frequencies based on instruction type

The present disclosure describes apparatuses and techniques for patching boot code of read-only memory (ROM). In some aspects, execution of boot code from a ROM is initiated to start a boot process of a device. Execution of the boot code from the ROM is then interrupted to enable execution of other boot code, such as corrected boot code or additional boot code, from another memory. Once the other boot code is executed, execution of the boot code from the ROM is resumed to continue booting the computing device. By so doing, the corrected boot code or additional boot code can be executed during the boot process effective to patch the boot code stored in the ROM.

Patching boot code of read-only memory

Systems, methods, and other embodiments associated with implementing security functions are described. According to one embodiment, a device includes a memory storing (i) a plurality of functions and (ii) a mapping of locations of the plurality of functions in the memory. The device includes a processing unit configured to, in response to a request by a process being executed by the processing unit, determine a location in the memory of a security function of the plurality of functions using the mapping. The processing unit is configured to execute the security function for the process from the memory according to the mapping.

Implementing security functions using ROM

Systems, methods, and other embodiments associated with implementing security functions in a read-only memory (ROM) are described. According to one embodiment, an device includes a read-only memory (ROM) that stores (i) a plurality of security functions and (ii) a mapping of locations of the plurality of security functions in the ROM. The device also includes a processing unit configured to, in response to a request by a process being executed by the processing unit, determine a location in the ROM of a security function using the mapping, and execute the security function for the process from the ROM.

Systems, methods, and other embodiments associated with a secure software resume from low power mode are described. According to one embodiment, a method includes receiving a request to enter a low power mode. In response to the request, the method includes storing a data section in LPDRM, performing a validation function on the data section to compute a validation value, and constructing a resume package that includes the validation value and a location of the data section in the LPDRM. The resume package is stored in the LPDRM for use in resuming operation after exiting low power mode.

Method for secure software resume from low power mode

Methods and apparatus for processing bitstreams and byte streams. According to one aspect, bitstream data is compressed using coalesced string match tokens with delayed matching. A matcher is employed to perform search string match operations using a shortened maximum string length search criteria, resulting in generation of a token stream having &#x3c;len, distance&#x3e; data and literal data. A distance match operation is performed on sequentially adjacent tokens to determine if they contain the same distance data. If they do, the len values of the tokens are added through use of a coalesce buffer. Upon detection of a distance non-match, a final coalesced length of a matching string is calculated and output along with the prior matching distance as a coalesced token. Also disclosed is a scheme for writing variable-length tokens into a bitstream under which token data is input into a bit accumulator and written to memory (or cache to be subsequently written to memory) as each token is processed in a manner that eliminates branch mispredict operations associated with detecting whether the bit accumulator is full or close to full.

Bitstream processing using coalesced buffers and delayed matching and enhanced memory writes

In one embodiment, the present disclosure provides a method that includes segmenting an n-bit exponent e into a first segment eand a number t of k-bit segments ein response to a request to determine a modular exponentiation result R, wherein R is a modular exponentiation of a generator base g for the exponent e and a q-bit modulus m, wherein the generator base g equals two and k is based at least in part on a processor configured to determine the result R; iteratively determining a respective intermediate modular exponentiation result for each segment e, wherein the determining comprises multiplication, exponentiation and a modular reduction of at least one of a multiplication result and an exponentiation result; and generating the modular exponentiation result R=gmod m based on, at least in part, at least one respective intermediate modular exponentiation result.

Efficient multiplication, exponentiation and modular reduction implementations

An embodiment may include circuitry to execute, at least in part, a first list of instructions and/or to concurrently process, at least in part, first and second buffers. The execution of the first list of instructions may result, at least in part, from invocation of a first function call. The first list of instructions may include at least one portion of a second list of instructions interleaved, at least in part, with at least one other portion of a third list of instructions. The portions may be concurrently carried out, at least in part, by one or more sets of execution units of the circuitry. The second and third lists of instructions may implement, at least in part, respective algorithms that are amenable to being invoked by separate respective function calls. The concurrent processing may involve, at least in part, complementary algorithms.

Enhancing performance by instruction interleaving and/or concurrent processing of multiple buffers

A system for generating a computing system specific value comprising, a computing system not comprising any specialized hardware to generate a device specific value, a software product tangibly embodied in a machine-readable medium, comprising instructions operable to cause computing system to perform operations comprising: generating a digital value which is substantially dependent on manufacturing variation among like devices of computing system.

Growing community of inventors

Franklin, MA, United States of America

Kahraman D Akdemir