Abstract: An electronic file can be decomposed into a number of fragments. The fragments can be randomly assembled into a number of fragment files, which can be stored randomly at different locations on one or more storage devices and/or on a network. One or more of the fragments and/or fragment files can be encrypted or otherwise protected. Instructions (e.g., fragment file locations, fragment assembly instructions) are generated for restoring the electronic file from the fragments. The instructions and other information (decryption keys) for restoring the electronic file can reside in a protected application. The protected application can intentionally be made inoperable until the protected application is dynamically linked at runtime with a security module obtained from, for example, a security service. Varying levels of protection (e.g., whether or not use a protected application) can be applied to electronic files based on file attributes.

Abstract: A device and search method are described herein which minimizes the cost associated with searching and accessing a memory to obtain a particular piece of stored data. In one embodiment, the device performs the following steps: (1) input search information into a hash function; (2) run the hash function which outputs a first set of information; (3) access a search database (located in static random access memory (SRAM)) to determine an index number of an element therein that contains a second set of information which matches the first set of information outputted by the hash function; and (4) access a result database (located in dynamic random access memory (DRAM)) to obtain the particular piece of data that is stored within an element therein which has an index number that matches the index number of the element within the search database that contained the second set of information which matched the first set of information outputted by the hash function.

Abstract: An electronic file is decomposed into a number of fragments. The fragments are assembled into a number of fragment files. Instructions for restoring the electronic file are generated. The fragment files are sent to a recipient device at different times and/or in a random (or different) order. In some implementations, the fragment files are transferred over different routes to and from the Internet using, for example, two or more Internet Service Providers (ISPs). In some implementations, the restoring instructions can be retrieved by a user from a network (e.g., from a website) using a link sent with the email. In another implementation, the instructions are uploaded on a website or other web property, which the recipient can access through a password or other security procedures. In some implementations, the instructions can be included in a protected application attached to the email sent to the recipient.

Abstract: A Content Addressable Memory (CAM) that downloads and banks a group of filters. Each filter has an associated filter-index, which is mapped in a mapping table to an available CAM address for storing the associated filter. Each succeeding filter in the group of filters is stored in a higher address in the CAM. The plurality of CAM addresses may not all be contiguous, in which case the mapping table maps each succeeding filter-index to the next higher available CAM address without regard to contiguity of the addresses.

Abstract: A Content Addressable Memory (CAM) that downloads and banks a group of filters. Each filter has an associated filter-index, which is mapped in a mapping table to an available CAM address for storing the associated filter. Each succeeding filter in the group of filters is stored in a higher address in the CAM. The plurality of CAM addresses may not all be contiguous, in which case the mapping table maps each succeeding filter-index to the next higher available CAM address without regard to contiguity of the addresses.

Abstract: A compressed prefix tree data structure is provided that allows large prefix trees and Virtual Private Network (VPN) trees to be placed in external memory, while minimizing the number of memory reads needed to reach a result. The compressed prefix tree data structure represents one or more bonsai trees, where each bonsai tree is a portion of a prefix tree containing two or more nodes that can be coded into a single data word (codeword). Each codeword is stored in a portion of the external memory (e.g., 16 bytes of DRAM), and retrieved as a unit for processing. Thus, each external DRAM call can retrieve multiple nodes of a prefix tree, reducing the time required for traversing the prefix tree.

Abstract: A method and system for protecting software products from unauthorized use and distribution is described. The system comprises a client process executed on a client computer coupled to a producer computer over a network. The method comprises the steps of providing to a user a copy of the distributed software, the distributed software comprising an incomplete executable program requiring a security module to be installed prior to execution on the client computer. The user receives a registration code for use with the distributed software. Upon attempted execution of the distributed software the producer computer requests user registration from the user. Upon receipt of the registration information including the registration code from the user, the producer computer validates the registration code and constructing a security module for transmission to the client computer. The security module is integrated with the distributed software to allow execution of the executable program.

Abstract: A system and corresponding method for randomly reordering a plurality or sequence of elements (E). In certain embodiments, ATM cells received by a switching apparatus may be randomly reordered as they proceed through an ATM switching apparatus, so as to enable the cells to be treated in a more fair manner. In one exemplary embodiment, a number or value within a given range(s) is randomly generated for each element E in a sequence or group to be randomly reordered. Each element E is shifted through a number of empty logic units or positions determined by the randomly generated number for that element, until finally being stored in one such unit. If none of the randomly generated number(s) for an element fall within the given range, a reserve number may be used to indicate how many empty logic units the element should be shifted, or a retry flag if set may cause a new set of random numbers to be generated for the element at issue.

Abstract: A compressed prefix tree data structure is provided that allows large prefix trees and Virtual Private Network (VPN) trees to be placed in external memory, while minimizing the number of memory reads needed to reach a result. The compressed prefix tree data structure represents one or more bonsai trees, where each bonsai tree is a portion of a prefix tree containing two or more nodes that can be coded into a single data word (codeword). Each codeword is stored in a portion of the external memory (e.g., 16 bytes of DRAM), and retrieved as a unit for processing. Thus, each external DRAM call can retrieve multiple nodes of a prefix tree, reducing the time required for traversing the prefix tree.