Patent application number | Description | Published |
20100191935 | Architecture and implementation method of programmable arithmetic controller for cryptographic applications - An architecture includes a controller. The controller is configured to receive a microprogram. The microprogram is configured for performing at least one of hierarchical or a sequence of polynomial computations. The architecture also includes an arithmetic logic unit (ALU) communicably coupled to the controller. The ALU is controlled by the controller. Additionally, the microprogram is compiled prior to execution by the controller, the microprogram is compiled into a plurality of binary tables, and the microprogram is programmed in a command language in which each command includes a first portion for indicating at least one of a command or data transferred to the ALU, and a second portion for including a control command to the controller. The architecture and implementation of the programmable controller may be for cryptographic applications, including those related to public key cryptography. | 07-29-2010 |
20110320397 | IMPULSE REGULAR EXPRESSION MATCHING - Disclosed is a method and apparatus for matching regular expressions. A buffer of symbols giving a number of the last occurrence positions of each symbol is maintained. When two constants match on either side of a regular expression operator, the buffer of symbols is queried to determine if a member of the complement of the regular expression operator occurred between the two constants. If so, then the operator was not satisfied. If not, then the operator was satisfied. | 12-29-2011 |
20120076298 | UNIFIED ARCHITECTURE FOR CRYPTO FUNCTIONAL UNITS - In described embodiments, a unified Crypto Functional Unit (CFU) block architecture provides a capability for advanced communication processors to provide parallel and concurrent processing of multiple crypto operations/transactions within high-speed hardware to support different security standards (e.g. from IPsec, 3GPP). In particular, each CFU block of the unified CFU block architecture comprises a FIFO-based interface, switch, and wrapped cipher/hasher. The unified CFU block architecture allows for drop-in solutions for cipher blocks in ASIC designs with crypto function blocks. | 03-29-2012 |
20120121079 | CIPHER INDEPENDENT INTERFACE FOR CRYPTOGRAPHIC HARDWARE SERVICE - Disclosed is a cipher independent cryptographic hardware service. Cipher independent transactions are received into input slots ( | 05-17-2012 |
20120324319 | HIGH THROUGHPUT FRAME CHECK SEQUENCE MODULE ARCHITECTURE - Described embodiments provide for a frame check sequence (FCS) module with a cyclic redundancy check (CRC) unit that receives a data block (padded, if necessary, to a maximum width) and a first state vector and computes an internal vector based on an extended CRC transition matrix. The FCS module further includes a set of matrix units, each matrix unit configured to multiply the internal vector by a corresponding correction matrix wherein the multiplications result in a set of products. A multiplexer selects, by a control signal determined by a maximum number of bytes and the original width, a second state vector from the set of products. | 12-20-2012 |
20130024668 | ARCHITECTURE AND IMPLEMENTATION METHOD OF PROGRAMMABLE ARITHMETIC CONTROLLER FOR CRYPTOGRAPHIC APPLICATIONS - An architecture includes a controller. The controller is configured to receive a microprogram. The microprogram is configured for performing at least one of hierarchical or a sequence of polynomial computations. The architecture also includes an arithmetic logic unit (ALU) communicably coupled to the controller. The ALU is controlled by the controller. Additionally, the microprogram is compiled prior to execution by the controller, the microprogram is compiled into a plurality of binary tables, and the microprogram is programmed in a command language in which each command includes a first portion for indicating at least one of a command or data transferred to the ALU, and a second portion for including a control command to the controller. The architecture and implementation of the programmable controller may be for cryptographic applications, including those related to public key cryptography. | 01-24-2013 |
20140136465 | IMPULSE REGULAR EXPRESSION MATCHING - Disclosed is a method and apparatus for matching regular expressions. A buffer of symbols giving a number of the last occurrence positions of each symbol is maintained. When two constants match on either side of a regular expression operator, the buffer of symbols is queried to determine if a member of the complement of the regular expression operator occurred between the two constants. If so, then the operator was not satisfied. If not, then the operator was satisfied. | 05-15-2014 |
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 |
20120226731 | LOW DEPTH COMBINATIONAL FINITE FIELD MULTIPLIER - A method for generating a design of a multiplier is disclosed. The method generally includes steps (A) to (C). Step (A) may generate a first circuit comprising a plurality of polynomial results of a particular multiplier scheme based on a plurality of parameters of the multiplier. The first circuit is generally configured to multiply a plurality of polynomials. Step (B) may generate a second circuit comprising a plurality of polynomial evaluators based on the parameters. The second circuit may be (i) connected to the first circuit and (ii) configured to evaluate a polynomial modulo operation. Step (C) may generate the design of the multiplier in combinational logic by optimizing a depth of a plurality of logic gates through the first circuit and the second circuit. A product of the polynomials generally resides in a finite field. | 09-06-2012 |
20130254623 | Systems and Methods for Variable Redundancy Data Protection - The present inventions are related to systems and methods for data processing, and more particularly to systems and methods for variable rate coding in a data processing system. | 09-26-2013 |
20130283114 | Systems and Methods for Locating and Correcting Decoder Mis-Corrections - Various embodiments of the present invention provide systems and methods for data processing. For example, data processing systems are disclosed that include a data decoding circuit having a data decoder circuit, an element modification circuit, an element modification log, and a mis-correction detection circuit. | 10-24-2013 |
20130346824 | DYNAMICALLY CONTROLLING THE NUMBER OF LOCAL ITERATIONS IN AN ITERATIVE DECODER - An iterative decoder dynamically controls the number of local iterations of error-correction decoding performed for each global iteration of channel detection. In so doing, the iterative decoder (i) limits the number of local iterations that are performed after error-correction decoding has likely encountered a trapping set and (ii) permits decoding to continue when error-correction decoding is on the path to converging on a valid codeword. To predict whether error-correction decoding is on the path to encountering a trapping set or converging on a valid codeword, a model is generated based on observed numbers of unsatisfied check nodes for a specified number of local iterations. For local iterations following the specified number of local iterations, the observed numbers of unsatisfied check nodes are then compared to the model to determine whether to continue or terminate local iterations of error-correction decoding. | 12-26-2013 |
20140068367 | LDPC Decoder Trapping Set Identification - The present inventions are related to systems and methods for detecting trapping sets in LDPC decoders, and particularly for detecting variable nodes in trapping sets in a non-erasure channel LDPC decoder. | 03-06-2014 |
20140075264 | CORRECTING ERRORS IN MISCORRECTED CODEWORDS USING LIST DECODING - A receive path of a communications system comprises an error-correction decoder, an error-detection decoder, and a codeword adjuster. The error-correction decoder performs error-correction decoding on a received codeword to generate a valid codeword. The error-detection decoder performs error-detection decoding on the valid codeword to determine whether or not the valid codeword is the correct codeword that was transmitted. If the valid codeword is not the correct codeword, then the codeword adjuster generates an adjusted valid codeword by applying an error vector to the valid codeword. The error-detection decoder performs error-detection decoding on the adjusted valid codeword to determine whether or not the adjusted valid codeword is the correct codeword. When the error-correction decoder generates an incorrect valid codeword, adjusting the valid codeword enables the receive path to recover the correct codeword without retransmitting or re-detecting the codeword. | 03-13-2014 |
20140164866 | Low Density Parity Check Decoder With Miscorrection Handling - A data processing system is disclosed including a decoder circuit, syndrome calculation circuit and hash calculation circuit. The decoder circuit is operable to apply a decoding algorithm to a decoder input based on a first portion of a composite matrix to yield a codeword. The syndrome calculation circuit is operable to calculate a syndrome based on the codeword and on the first portion of the composite matrix. The hash calculation circuit is operable to calculate a hash based on a second portion of the composite matrix. The decoder circuit is also operable to correct the codeword on the hash when the syndrome indicates that the codeword based on the first portion of the composite matrix is correct but a second test indicates that the codeword is miscorrected. | 06-12-2014 |
20140181624 | Majority-Tabular Post Processing of Quasi-Cyclic Low-Density Parity-Check Codes - A method for finding a valid codeword based on a near codeword trapping in a low-density parity-check decoding process includes identifying trapping set configurations and applying corrections to produce trapping sets with a limited number of invalid checks. Trapping set configurations are corrected in order to produce a trapping set in a table of trapping sets, the table associating each corrected trapping set with a valid codeword. | 06-26-2014 |
20140281284 | MULTI-READ PORT MEMORY - A method includes receiving a multi-port read request for retrieval of data stored in three memories, each comprising two memory modules and a parity module. The multi-port read request is associated with first data stored at a first memory address, second data stored at a second memory address, and third data stored at a third memory address. When the first memory address, the second memory address, and the third memory address are associated with a first memory module, first data is retrieved from the first memory module, second data is reconstructed using data from a second memory module and a first parity module, and third data is reconstructed using data from a fourth memory module and a seventh memory module. The first data, the second data, and the third data are provided in response to the multi-port read request. | 09-18-2014 |
Patent application number | Description | Published |
20100205186 | SYSTEM AND METHOD FOR FILTERING AND ORGANIZING ITEMS BASED ON COMMON ELEMENTS - A system and method for filtering and organizing items from computer memories based on common elements is provided. Filters can be provided for manipulating the items, which serve as tools for narrowing down a set of items. The filters can be dynamically generated based on the properties of the separate items. The system can utilize virtual folders. The virtual folders can expose regular files and folders to users in different views based on their metadata instead of the actual physical underlying file system structure on the disk. Quick links can be provided, which serve as a set of predefined links (e.g., located on the left side of the display) that can be clicked on to generate useful views of the sets of items. Libraries, which can provide large groups of usable types of items that can be associated together, may also be used. | 08-12-2010 |
20120158891 | TECHNIQUES FOR UNIVERSAL REPRESENTATION OF DIGITAL CONTENT - A universal content representation system (“UCRS”) implements techniques for universally representing digital content such as files, device information, and applications across a group of electronic devices that includes at least a source electronic device and a remote electronic device. Proxy content items, which correspond with items of content (“source content items”) stored on the source electronic device, are data stores for the corresponding source content items, and visually represent the corresponding source content items on the remote electronic device, whether the source electronic device is online or offline. A user of the remote electronic devices uses the proxy content items to search for and view source content items prior to requesting full access to the source content items. From time-to-time, source content items and proxy content items are synchronized with each other. | 06-21-2012 |
20150234893 | SYSTEM AND METHOD FOR FILTERING AND ORGANIZING ITEMS BASED ON COMMON ELEMENTS - A system and method for filtering and organizing items from computer memories based on common elements. In accordance with one aspect of the invention, filters are provided for manipulating the items. The filters are essentially tools for narrowing down a set of items. In one embodiment, the filters are dynamically generated based on the properties of the separate items. The system utilizes virtual folders. The virtual folders expose regular files and folders to users in different views based on their metadata instead of the actual physical underlying file system structure on the disk. In accordance with another aspect of the invention, quick links are provided. In one embodiment, quick links are a set of predefined links (e.g., located on the left side of the display) that can be clicked on to generate useful views of the sets of items. In accordance with another aspect of the invention, libraries are provided. Libraries consist of large groups of usable types of items that can be associated together. | 08-20-2015 |
Patent application number | Description | Published |
20120304116 | Application Notifications - Application notification techniques are described. Implementations are described in which a representation of an application may include notifications that pertain to the application. Techniques are further described which may be used to manage the notifications, including replacement of notifications, use of queues, overrides, selection of notifications based on execution state of an application, cycling a display of a plurality of notifications, cycling a display of different subsets of notifications, examination of a manifest of an application to determine criteria to be used to display the notifications, display priority of the notifications, and so on. | 11-29-2012 |
20120304117 | Application Notification Tags - Application notification tag techniques are described. Implementations are described in which a representation of an application may include notifications that pertain to the application. Techniques are further described which may be used to manage the notifications, including replacement of notifications, use of queues, overrides, selection of notifications based on execution state of an application, cycling a display of a plurality of notifications, cycling a display of different subsets of notifications, examination of a manifest of an application to determine criteria to be used to display the notifications, display priority of the notifications, and so on. | 11-29-2012 |
20120304118 | Application Notification Display - Application notification display techniques are described. Implementations are described in which a representation of an application may include notifications that pertain to the application. Techniques are further described which may be used to manage the notifications, including replacement of notifications, use of queues, overrides, selection of notifications based on execution state of an application, cycling a display of a plurality of notifications, cycling a display of different subsets of notifications, examination of a manifest of an application to determine criteria to be used to display the notifications, display priority of the notifications, and so on. | 11-29-2012 |
20120304200 | Application Activation Framework - Techniques for application activation are described herein. An operating system (OS) can be configured to incorporate various extension points that are serviceable through contracts defining individual invocations of extensible functionality. The extensible functionality is integrated as part of the OS and controlled by the OS in a centralized manner. However, the specific implementations of the extensible functionally are offloaded to applications using the contracts. For example, the OS can include or otherwise make use of a centralized application activation component that employs an object-oriented approach to invoke applications to perform particular contracts. The application activation component can pass information describing a particular contract to activate a designated application and enable the application to service the contract in the manner specified by the OS. In this way, the manner in which contracts are handled by application code can be managed and coordinated through a centralized application activation component. | 11-29-2012 |
20140324776 | FILE MANAGEMENT WITH PLACEHOLDERS - Aspects of the subject matter described herein relate to file system placeholders. In aspects, placeholders may be used by a client to represent remote file system objects. The placeholders may include metadata and may also include none, some, or all of the content of the represented remote file system objects. In conjunction with local file system metadata, the placeholders allow a file system namespace to be navigated and may also allow other operations to be performed on the file system objects even when the client is offline with respect to the remote file system. After connectivity is re-established with the remote file system, the placeholders may be used in synchronizing changes. | 10-30-2014 |
20140324777 | SEARCHING AND PLACEHOLDERS - Aspects of the subject matter described herein relate to file system placeholders. In aspects, placeholders may be used by a client to represent remote file system objects. The placeholders may include metadata, searchable text, and may also include none, some, or all of the content of the represented remote file system objects. Search data from the placeholders is integrated into a local search database of the client such that the client is able to satisfy queries and identify relevant local and remote file system objects even when the client is offline with respect to remote storage. | 10-30-2014 |
20150046829 | Application Notifications - Application notification techniques are described. Implementations are described in which a representation of an application may include notifications that pertain to the application. Techniques are further described which may be used to manage the notifications, including replacement of notifications, use of queues, overrides, selection of notifications based on execution state of an application, cycling a display of a plurality of notifications, cycling a display of different subsets of notifications, examination of a manifest of an application to determine criteria to be used to display the notifications, display priority of the notifications, and so on. | 02-12-2015 |
20150286499 | Application Activation Framework - Techniques for application activation are described herein. An operating system (OS) can be configured to incorporate various extension points that are serviceable through contracts defining individual invocations of extensible functionality. The extensible functionality is integrated as part of the OS and controlled by the OS in a centralized manner. However, the specific implementations of the extensible functionally are offloaded to applications using the contracts. For example, the OS can include or otherwise make use of a centralized application activation component that employs an object-oriented approach to invoke applications to perform particular contracts. The application activation component can pass information describing a particular contract to activate a designated application and enable the application to service the contract in the manner specified by the OS. In this way, the manner in which contracts are handled by application code can be managed and coordinated through a centralized application activation component. | 10-08-2015 |
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 |