| Patent application number | Description | Published |
|---|
| 20100017622 | High performance arithmetic logic unit (ALU) for cryptographic applications with built-in countermeasures against side channel attacks - The present invention is a cryptoengine configured for providing countermeasures against attacks, including: an input/output (I/O) control unit, a memory, a controller, and an Arithmetic Logic Unit (ALU). The memory is communicatively coupled with the I/O control unit, receives inputs from the I/O control unit, and provides outputs to the I/O control unit based upon the received inputs. The controller is communicatively coupled with the I/O control unit for transmitting and receiving control signals. The ALU includes a plurality of storage components and computational components. The ALU is communicatively coupled with the controller and receives commands from/transmits status bits and flags to the controller. The ALU is further communicatively coupled with the memory and is configured for providing output signals to/receiving input signals from the memory. Further, the cryptoengine is configured for being communicatively coupled with a host computing device. | 01-21-2010 |
| 20100057823 | Alternate galois field advanced encryption standard round - An apparatus having a first circuit and a second circuit is disclosed. The first circuit may be configured to (i) generate second Galois Field elements by performing a first Galois Field inversion on first Galois Field elements, the first Galois Field inversion being different from a second Galois Field inversion defined by an Advanced Encryption Standard and (ii) generate third Galois Field elements by multiplying the second Galois Field elements by an inverse of a predetermined matrix. The second circuit may be configured to (i) generate fourth Galois Field elements by processing the third Galois Field elements in a current encryption round while in a non-skip mode, (ii) generate fifth Galois Field elements by multiplying the fourth Galois Field elements by the predetermined matrix and (iii) present the fifth Galois Field elements as updated versions of the first Galois Field elements in advance of a next encryption round. | 03-04-2010 |
| 20100086127 | EFFICIENT IMPLEMENTATION OF ARITHMETICAL SECURE HASH TECHNIQUES - An apparatus including an initialization circuit and a hash computation circuit. The initialization circuit may be configured to present a number of initialization values. The hash computation circuit may be configured to generate hash values for the message in response to the padded message blocks and the initialization values. The hash computation circuit generally performs a diagonal cut technique that simultaneously uses values from a plurality of different cycle rounds in a single cycle round analog. | 04-08-2010 |
| 20100293421 | LOW DEPTH PROGRAMMABLE PRIORITY ENCODERS - An apparatus having a plurality of first circuits, second circuits, third circuits and fourth circuits is disclosed. The first circuits may be configured to generate a plurality of first signals in response to (i) a priority signal and (ii) a request signal. The second circuits may be configured to generate a plurality of second signals in response to the first signals. The third circuits may be configured to generate a plurality of enable signals in response to the second signals. The fourth circuits may be configured to generate collectively an output signal in response to (i) the enable signals and (ii) the request signal. A combination of the first circuits, the second circuits, the third circuits and the fourth circuits generally establishes a programmable priority encoder. The second signals may be generated independent of the enable signals. | 11-18-2010 |
| 20110029980 | LOW DEPTH PROGRAMMABLE PRIORITY ENCODERS - An apparatus having a plurality of first circuits, second circuits, third circuits and fourth circuits is disclosed. The first circuits may be configured to generate a plurality of first signals in response to (i) a priority signal and (ii) a request signal. The second circuits may be configured to generate a plurality of second signals in response to the first signals. The third circuits may be configured to generate a plurality of enable signals in response to the second signals. The fourth circuits may be configured to generate collectively an output signal in response to (i) the enable signals and (ii) the request signal. A combination of the first circuits, the second circuits, the third circuits and the fourth circuits generally establishes a programmable priority encoder. The second signals may be generated independent of the enable signals. | 02-03-2011 |
| 20110255689 | MULTIPLE-MODE CRYPTOGRAPHIC MODULE USABLE WITH MEMORY CONTROLLERS - In one embodiment, a multi-mode Advanced Encryption Standard (MM-AES) module for a storage controller is adapted to perform interleaved processing of multiple data streams, i.e., concurrently encrypt and/or decrypt string-data blocks from multiple data streams using, for each data stream, a corresponding cipher mode that is any one of a plurality of AES cipher modes. The MM-AES module receives a string-data block with (a) a corresponding key identifier that identifies the corresponding module-cached key and (b) a corresponding control command that indicates to the MM-AES module what AES-mode-related processing steps to perform on the data block. The MM-AES module generates, updates, and caches masks to preserve inter-block information and allow the interleaved processing. The MM-AES module uses an unrolled and pipelined architecture where each processed data block moves through its processing pipeline in step with correspondingly moving key, auxiliary data, and instructions in parallel pipelines. | 10-20-2011 |
| Patent application number | Description | Published |
|---|
| 20090313259 | CONTAINER HANDLERS FOR SHARING AND UNSHARING - A container reference such as a library may reference other items and may be shared or unshared among computing devices, computing applications, or users. A sharing handler may be registered for the container reference and may be used in conjunction with the sharing and unsharing of the container reference and the items that are referenced by the container reference. The sharing handler may perform post-processing on the container reference to update the paths for the item references. The paths may be changed from local to remote for items that are shared or from remote to local for items that are unshared. | 12-17-2009 |
| 20090327221 | CONTEMPORANEOUSLY SHARING RESOURCES TARGETED BY A LIBRARY - Computer-readable media, computer-readable media, computerized methods, and computer systems for acting on properties of multiple resources, which span disparate locations within a network, upon detecting an intuitive user-initiated operation are provided. Initially, a library is provided that includes a framework for contemporaneously accessing a collection of items within a scope thereof. Upon launching the library, representations of the scoped items are surfaced at a UI display. When the user-initiated operation is applied at one of the surfaced representations, properties of each of the scoped items are automatically manipulated. A library-configuration state, which reflects how the items are affected upon manipulating the properties thereof, may be updated upon implementing the manipulation. Accordingly, if the scope of the library is subsequently extended to encompass another item outside the original collection of items, the properties of this new item are automatically manipulated to align with the library-configuration state. | 12-31-2009 |
| 20090327900 | INDICATING RESOURCES TO WHICH THERE ARE ACCESS RIGHTS - Methods and computer storage media for displaying shared resources of a sharing device to which a computing device of a network has access are provided. Shared resources of a sharing device are determined. A message is generated that includes information regarding the shared resource. The message is communicated to a computing device that interprets the message to identify those resources that are shared with the computing device. Upon determining those resources that the computing device has access rights, the computing device provides an indication for a user that facilitates the utilization of those shared resource to which it has access rights. In some embodiments, the message is securely communicated. | 12-31-2009 |
| 20090327904 | PRESENTING DYNAMIC FOLDERS - Methods and systems are illustrated for defining and presenting a location that is virtual and composed of items from different file system locations to a user interface. Items that have been published over a network can be easily accessed and efficiently browsed when there is a large number of data items shared. The data items shared can be from multiple locations and/or multiple clients that have been published over a network, which can be retrieved, defined and presented directly in a user interface. | 12-31-2009 |
| 20110246525 | CONTEMPORANEOUSLY SHARING RESOURCES TARGETED BY A LIBRARY - Computer-readable media, computer-readable media, computerized methods, and computer systems for acting on properties of multiple resources, which span disparate locations within a network, upon detecting an intuitive user-initiated operation are provided. Initially, a library is provided that includes a framework for contemporaneously accessing a collection of items within a scope thereof. Upon launching the library, representations of the scoped items are surfaced at a UI display. When the user-initiated operation is applied at one of the surfaced representations, properties of each of the scoped items are automatically manipulated. A library-configuration state, which reflects how the items are affected upon manipulating the properties thereof, may be updated upon implementing the manipulation. Accordingly, if the scope of the library is subsequently extended to encompass another item outside the original collection of items, the properties of this new item are automatically manipulated to align with the library-configuration state. | 10-06-2011 |
