Abstract: A method begins with a processing module obtaining data to store and determining whether substantially similar data to the data is stored. When the substantially similar data is not stored, the method continues with the processing module generating a first encryption key based on the data, encoding the first encryption key into encoded data slices in accordance with an error coding dispersal storage function, and storing the encoded data slices in a dispersed storage network (DSN) memory. The method continues with the processing module encrypting the data using an encryption key of the substantially similar data in accordance with an encryption function to produce encrypted data, compressing the encrypted data in accordance with a compression function to produce compressed data, storing the compressed data when the substantially similar data is stored.

Abstract: Methods and apparatus involve two keys to decode data that are generated during original encoding of the data. The keys are stored on computing devices separate from one another, and the encrypted data, which maintains security until such time as the original data requires decoding. Because the keys can be relatively large, its stored form may have padding bits to align with the file form of the encoded data. Representative keys include a dictionary corresponding to symbols representing the data and a weighted path decoder that correlates the symbols of the dictionary to underlying original bits. A “fast approximation” of compression of current data involves using information obtained from an earlier compression of similar data. Creating the two keys for the original data can also include creating a master key for decoding a plurality of later-encoded files. A second key also works in conjunction with the master key during decoding.

Abstract: Systems and methods for encrypting a plaintext logical data object for storage in a storage device operable with at least one storage protocol, creating, reading, writing, optimization and restoring thereof. Encrypting the plaintext logical data object comprises creating in the storage device an encrypted logical data object comprising a header and one or more allocated encrypted sections with predefined size; encrypting one or more sequentially obtained chunks of plaintext data corresponding to the plaintext logical data object thus giving rise to the encrypted data chunks; and sequentially accommodating the processed data chunks into said encrypted sections in accordance with an order said chunks received, wherein said encrypted sections serve as atomic elements of encryption/decryption operations during input/output transactions on the logical data object.

Abstract: A method and system for encrypting a plaintext logical data object for storage in a storage device operable with at least one storage protocol, creating, reading, writing, optimization and restoring thereof. Encrypting the plaintext logical data object comprises creating in the storage device an encrypted logical data object comprising a header and one or more allocated encrypted sections with predefined size; encrypting one or more sequentially obtained chunks of plaintext data corresponding to the plaintext logical data object thus giving rise to the encrypted data chunks; and sequentially accommodating the processed data chunks into said encrypted sections in accordance with an order said chunks received, wherein said encrypted sections serve as atomic elements of encryption/decryption operations during input/output transactions on the logical data object.

Abstract: Parallel compression is performed on an input data stream by processing circuitry. The processing circuitry includes hashing circuitry, match engines, pipeline circuitry and a match selector. The hashing circuitry identifies multiple locations in one or more history buffers for searching for a target data in the input data stream. The match engines perform multiple searches in parallel for the target data in the one or more history buffers. The pipeline circuitry performs pipelined searches for multiple sequential target data in the input data stream in consecutive clock cycles. Then the match selector selects a result from the multiple searches and pipelined searches to compress the input data stream.

Abstract: A system for storing encrypted compressed data comprises a processor and a memory. The processor is configured to determine whether an encrypted compressed segment has been previously stored. The encrypted compressed segment was determined by breaking a data stream, a data block, or a data file into one or more segments and compressing and then encrypting each of the one or more segments. The processor is further configured to store the encrypted compressed segment in the event that the encrypted compressed segment has not been previously stored. The memory is coupled to the processor and configured to provide the processor with instructions.

Abstract: In a first data compression process, a compressed code of an input symbol is generated in accordance with a compression dictionary selected on the basis of P symbols immediately preceding the input symbol, and a (P+1)K+1-th compressed code is encrypted to generate a compressed and encrypted code. Then, compressed and encrypted data comprising compressed and encrypted codes and other compressed codes is output. In a second data compression process, a bit string is added to the head of compression target data, and a compressed code of an input symbol is generated in accordance with a compression dictionary selected on the basis of a bit string or a symbol immediately preceding the input symbol. Then, a plurality of compressed codes are alternately output to different output destinations.

Abstract: Systems and methods for information compression. In a first method embodiment, a computer implemented method for compressing information includes finding a closest match entry of a dictionary to a data block, the dictionary stored in computer usable media. A logical exclusive OR combination of the closest match entry and the data block is performed to form a spatial difference vector identifying locations wherein the data block differs from the closest match entry. An information difference vector comprising differences between the data block and the closest match entry is formed. A compressed data block comprising the spatial difference vector, the information difference vector and a reference to the closest match entry is produced. The compressed data block is characterized as being smaller than the data block.

Abstract: A system and method for authenticating a user in a secure computer system. A client computer transmits a request for a sign-on page, the secure computer system responds by transmitting a prompt for a first user identifier, and the client computer transmits a request including a first identifier, a second identifier stored in an object stored at the client computer and a plurality of request header attributes. A server module authenticates the first and second user identifiers, and compares the transmitted plurality of request header attributes with request header attributes stored at the computer system and associated with the first and second user identifiers. If the first and second user identifiers are authenticated, and if a predetermined number of transmitted request header attributes match stored request header attributes, the server software module transmits a success message, and the user is allowed to access the secure computer system.

Abstract: A compressing unit compresses an element on an algebraic torus into affine representation according to a compression map. A determining unit determines whether a target element on the algebraic torus to be compressed is an exceptional point representing an element on the algebraic torus that cannot be compressed by the compression map. The compressing unit generates, when it is determined that the target element is the exceptional point, a processing result including exceptional information indicating that the target element is the exceptional point, and generates, when it is determined that the target element is not the exceptional point, a processing result including affine representation obtained by compressing the target element according to the compression map.

Abstract: A method includes receiving data which has been encoded according to a first higher complexity protection scheme and compressed. The method also includes decompressing the data. The method also includes decoding the data according to the first higher complexity protection scheme using a first higher complexity key. The method also includes encoding at least the first portion of the data according to a second higher complexity protection scheme using a second higher complexity key. The method also includes encoding at least a second portion of the data according to a lower complexity protection scheme using a lower complexity key.

Abstract: A method for transmitting data, a receiving method, related devices, and an aircraft equipped with the devices. The method includes determining an authentication word of the data; processing the data to obtain processed data; and transmitting the processed data on a transmission channel.

Abstract: An information processing system and a method for use therewith, an information processing apparatus and a method for use therewith, and a program which are capable of decrypting desired portions of encrypted data are provided. Of packets 211 through 216 constituting a bit stream of layered-encoded image data 201 according to JPEG 2000, the packets 211 through 213 are each encrypted independently of the packets 214 through 216 which are also encrypted each. This produces encrypted split data 262 with the resolution at level zero (corresponding to R0) and encrypted split data 263 with the resolution at level one (corresponding to R1). The header (ranging from SOC to SOD) of layered-encoded image data 201 is appropriated for a header 261, followed by encrypted split data 262 and 263 and an EOC 264, in that order, the whole data array constituting data 251 that is output as the definitive encrypted data. This invention is particularly applicable to image delivery apparatus.

Abstract: A configuration for encapsulating data that is unreadable after a predetermined timeout. To encapsulate data a random data key is generated and split into shares. A threshold number of shares are needed to reconstruct the key. The shares are stored at random locations within one or more networks. Each location is configured to delete the stored data after a predetermined time period. Encapsulated data is created by creating a vanishing data object (VDO) comprising the encrypted data, and data sufficient to locate at least a threshold number of key shares from their stored locations. The VDO becomes inaccessible after enough shares of the data are deleted such that the data key cannot be restored. However, if prior to timeout a sufficient number of data key shares are located and retrieved the data key can be reconstructed. The reconstructed data key is then used to decrypt the original data.

Abstract: In a data structure of a multimedia file format, a movie box and a media data box are provided. In each box, a non-encrypted size field, a non-encrypted type field and box data field are provided. In box data of the movie box, information data regarding multimedia data is stored. The multimedia data is encrypted and stored in box data of the media data box. The information data is obtained by referring to the container in the movie box. This information data is held as encryption and encoding information data. By referring to the information data, a data unit of the encrypted multimedia data in the media data box is obtained, and the unit data is decrypted.

Abstract: A network component comprising at least one processor configured to implement a method comprising deriving a Master Session Key (MSK) using a secret key and at least one parameter obtained from an Extensible Authentication Protocol (EAP) sequence, deriving a first Pairwise Master Key (PMK) and a second PMK from the MSK, authenticating with a home gateway (HG) using the first PMK, and authenticating with an end point using the second PMK. Included is an apparatus comprising a node comprising an access controller (AC) and a protocol for carrying authentication for network access (PANA) Authentication Agent (PAA), wherein the AC is configured to manage authentication for a UE, and wherein the PAA is configured to implement a PANA to forward authentication information related to the UE.

Abstract: A method and system for securely communicating information via a low bandwidth channel uses encryption that adds comparatively little overhead to the size of the transmission. This method and system efficiently take advantage of the properties of public key cryptography, a shared secret, a traffic key from the shared secret, an abbreviated initialization vector, and an abbreviated whole message signature. The information and the whole message signature are encrypted using the traffic key with a stream cipher.

Abstract: A method for determining the entropy of a noise source providing a bit flow, a method and a device for generating a bit flow, including parallelizing the bit flow to obtain first words over a first number of bits, applying to the successive words a compression function, and evaluating a second number of bits over which the compression function provides its results, the second number representing the number of useful bits in the first words.

Abstract: There is realized a data conversion device that performs generation of a hash value with improved analysis resistance and a high degree of safety. There are provided a stirring processing section performing a data stirring process on input data; and a compression processing section performing a data compression process on input data including data segments which are divisions of message data, the message data being a target of a data conversion. Part of multi-stage compression subsections is configured to perform a data compression process based on both of output of the stirring processing section and the data segments in the message data. There is provided such a configuration that the stirring process is executed at least on fixed timing of a compression processing round of plural rounds and thus, there is realized a data conversion device that performs generation of a hash value with improved analysis resistance and a high degree of safety.

Abstract: A data processing method comprises the following steps: determining a first result data word from a first input data word and a first secret data word; obtaining a first compressed data word from the first result data word or the first input data word using a compression algorithm; determining a second result data word from a second input data word and a second secret data word; obtaining a second compressed data word from the second result data word using the compression algorithm; comparing the first compressed data word and the second compressed data word.

Abstract: Described is a process for encrypting and compressing data for storage by computing systems. A data stream received by a computing system is separated into data chunks for storage on a storage device using a data layout format. Each data chunk is examined and if possible, compressed to produce a compressed data chunk. Whether or not the data chunk can be compressed, the data chunk is encrypted and stored on the storage device in addition to metadata that describes the data chunk. When reading the stored data chunk from the storage device, the metadata identifies the starting location of the stored data chunk and provides metadata information to the computing system for decryption and decompression processing.

Abstract: Data is encrypted by receiving a plurality of bits associated with a communications flow and compressing at least a portion of the bits in order to produce a plurality of sub-frames. The sub-frames may be assembled into a superframe and a stream cipher may be applied to the superframe in order to generate an encrypted packet.

Abstract: An apparatus for hash cryptography has a hardware structure that is capable of providing both secure hash algorithm (SHA)-1 hash calculation and SHA-256 hash calculation. The apparatus for hash cryptography generates a plurality of first message data corresponding to a plurality of first rounds when the SHA-1 hash calculation is performed and generates a plurality of second message data corresponding to a plurality of second rounds when the SHA-256 hash calculation is performed by using one memory, one first register, one XOR calculator, and one OR calculator, calculates a message digest by the SHA-1 hash calculation by using the plurality of first message data when the SHA-1 hash calculation is performed, and calculates a message digest by the SHA-256 by using the plurality of second message data when the SHA-256 hash calculation is performed.

Abstract: A method, apparatus and a data storage device are provided for implementing data confidentiality and integrity of data stored in overlapping, shingled data tracks on a recordable surface of a storage device. A unique write counter is stored for each zone written to the recordable surface of the storage device. An encryption key is used together with the write counter information and a logical block address to encrypt each sector being written, and to decrypt all sectors being read. An individual sector is decrypted, obtaining the write counter information and reading the data sector. A message authentication code is stored for each zone. All sectors of the zone are read to perform integrity check on a sector.

Abstract: A play limit is set for a media file. The play limit can be, for example a date, or a number of times that the file has been played. When the file exceeds the play limit, the quality of the file playing is degraded.

Abstract: A data processing device for playing back a digital work reduces the processing load involved in verification by using only a predetermined number of encrypted units selected randomly from multiple encrypted units constituting encrypted contents recorded on a DVD. In addition, the data processing device improves the accuracy of detecting unauthorized contents by randomly selecting a predetermined number of encrypted units every time the verification is performed.

Abstract: A controlling device provides conditional access to secured content renderable by an appliance. The controlling device transmits a data frame to the appliance and encrypts at least a part of the data frame that includes data to be used by the appliance to provide access to the secured content. At the appliance a decryption key complimentary to the encryption key is used to decrypt the received the data frame. The appliance allows the secured content to be rendered only after the appliance determines that the data in the received, decrypted data frame includes the data the appliance requires to provide access to the secured content.

Abstract: The method to reduce the bandwidth necessary for the renewal of subscription message is achieved using group messages in which each member of the group is associated with a bit of a bitmap. In order to have the maximum members in a group, the size dedicated for the bitmap is determined first by calculating the size remaining after putting the command and other necessary data into the message, and using an iterative process to determine whether the bitmap, once compressed, will fit this remaining size. The iterative process adds a new member into the group, thus increasing the bitmap size, then compresses the resulting bitmap and checks if the compressed bitmap will fit into the remaining size.

Abstract: An end user system comprises a communication interface configured to receive content in a protected state and transfer the content in the protected state, a processing system coupled to the communication interface and configured to receive the content in the protected state, process the content with a key hard coded internally to the processing system to modify the content to an unprotected state, and transfer the content in the unprotected state, and a user interface coupled to the processing system and configured to receive the content in the unprotected state and output the content.

Abstract: A method to efficiently detect, store, modify, and recreate fully or partially duplicate file forks is described. During archive creation or modification, sets of fully or partially duplicate forks are detected and a reduced number of transformed forks or fork segments are stored. During archive expansion, one or more forks are recreated from each full or partial copy.

Abstract: This invention is useful in video compression standards support a rich set of intra prediction modes. This invention a unique table creation and lookup approach to software pipeline the prediction process for all pixels within a block. The table stores constant data and pointer data into a neighbor pixel table. Indexing into the table based upon the current intra prediction mode for each pixel of a block recalls constant data and other pixel data for calculation of an intra prediction value.

Abstract: In a data structure of a multimedia file format, a movie box and a media data box are provided. In each box, a non-encrypted size field, a non-encrypted type field and box data field are provided. In box data of the movie box, information data regarding multimedia data is stored. The multimedia data is encrypted and stored in box data of the media data box. The information data is obtained by referring to the container in the movie box. This information data is held as encryption and encoding information data. By referring to the information data, a data unit of the encrypted multimedia data in the media data box is obtained, and the unit data is decrypted.

Abstract: An encryption and authentication technique that achieves enhanced integrity verification through assured error-propagation using a multistage sequence of pseudorandom permutations. The present invention generates intermediate data-dependent cryptographic variables at each stage, which are systematically combined into feedback loops. The encryption technique also generates an authentication tag without any further steps that is N times longer than the block size where N is the number of pseudorandom permutations used in the encipherment of each block. The authentication tag provides a unique mapping to the plaintext for any number of plaintext blocks that is less than or equal to N. In addition to being a stand alone encryption algorithm, the disclosed technique is applicable to any mode that uses pseudorandom permutations such as, key dependent lookup tables, S-Boxes, and block ciphers such as RC5, TEA, and AES.

Abstract: There are provided video encoders and corresponding methods for performing fast mode decision of B-frames. A video encoder for encoding video data for a B slice that is divisible into macroblocks includes an encoder (OO) for performing mode selection when encoding a current macroblock in the B slice by counting a number of neighboring macroblocks in the B slice coded in a DIRECT mode, and only checking one of the DIRECT MODE or a 16×16 mode for the current macroblock when the number of neighboring macroblocks coded in the DIRECT mode exceeds a predetermined threshold.

Abstract: The present invention relates to message encoding. In a first implementation, a message is provided. The message is transformed by a secret key. The secret key is generated by providing a plural-bit seed. The seed is randomized and then error correction encoded. We prefer tail-biting convolutional encoding for our error correction encoding. The encoded seed forms a secure key, which is used to transform the message prior to embedding.

Abstract: A control channel in a communication system transmits messages in a one or multiple-slot format. To assure consistency of a message, a content quality indicator is included in the message. Because a terminal receiving the message does not know the number of slots comprising the message, the terminal performs blind format determination by testing hypothesis for all slot formats. Unfortunately, the content of certain control messages results in control messages that appear to be valid in a sense that, the computed CRC is equal to the interpreted CRC. Consequently, the mobile station declares a valid control message, and a false-alarm event occurs. Moreover, the same control messages always result in the same false-alarm events. To prevent such repetitive incorrect determination, the content of the message is scrambled by a time-dependent scrambling sequence before transmission. Re-generating the scrambling sequence, and performing inverse to the scrambling then unscrambles the received message.

Abstract: An apparatus for compressing media content is disclosed. The apparatus divides the media content into at least three predetermined portions, compresses each of the at least three portions using one of at least three different compression algorithms and makes the at least three compressed predetermined portions publicly available. Making the portions publicly available includes, for example, transmitting the portions over a computer network such as the Internet.

Abstract: A provider side apparatus provides original digital data together with a digital signature generated by the provider side apparatus, the digital signature detecting whether the original digital data was falsified or detecting a change level given to the original digital data. Upon reception of the digital data, a receiver side apparatus can know the originality of the received digital data or a change level of the received digital data from the original digital data, in accordance with the digital signature corresponding to the digital data.

Abstract: An apparatus for compressing media content is disclosed. The apparatus divides the media content into at least three predetermined portions, compresses each of the at least three portions using one of at least three different compression algorithms and makes the at least three compressed predetermined portions publicly available. Making the portions publicly available includes, for example, transmitting the portions over a computer network such as the Internet.

Abstract: In one embodiment, a technique for enhancing the inspection of data sent from a server is provided. By modifying a client request in an effort to prevent the transformation (e.g., encoding and/or compression) of data by the server, unencoded data may be received, which can be inspected without the overhead associated with first decoding the data. Further, in the event the data is encoded despite modifying the client request to prevent such encoding, the server may be untrustworthy and one or more appropriate actions may be taken.

Abstract: In a communication network including a relay apparatus and a call control apparatus, a telephone conversation resumption system includes: a reservation unit, when a judgment unit detects communication impossibility between a portable terminal and the relay apparatus, records terminal identification data that specifies the portable terminal and an other-end terminal in a recording unit; a continuation processing unit that generates a call with the other-end terminal indicated by the terminal identification data and transmits a message to the other-end terminal; and a resumption unit that, when the judgment unit detects recovery of the communication state of the portable terminal, requests the call control apparatus to resume the telephone conversation between the portable terminal and the other-end terminal using the terminal identification data.

Abstract: A system including a pseudo-random number generator having a register to store an extended state having a reduced state and a dynamic constant, an initialization module to initialize a part of the extended state based on a Key and/or an Initial Value, a state update module to update the reduced state, an output word module to generate output words, the state update module and the output word module being adapted to operate through cyclical rounds, each round including updating the reduced state and then generating one of the output words, and an update dynamic constant module to update the dynamic constant, wherein in a majority of the rounds, updating of the reduced state and/or generation of the output word is based on the dynamic constant, and the dynamic constant is only updated in a minority of the rounds. Related apparatus and method are also described.

Abstract: A system and method provide parallel compression of a single data stream is provided. A data stream entering a storage encryption processor is split by a splitting stage into a plurality of substantially equal segments. Each of the segments is stored in one of a first set of memories in a round robin fashion. Each memory has an associated compression core that reads the segments associated with each memory and compresses the data before storing the compressed segments in a second set of memories. A merging stage reads the compressed segments from the second set of memories and creates a single compressed data stream.

Abstract: A system and method enables efficient transfer and cryptographic processing of data within a security appliance. A network adapter of the security appliance initiates a random access data transfer to a system memory that is illustratively organized into a plurality of blocks of predetermined size. Mapping circuitry of the appliance is configured to track the progress of the data transfer between the adapter and memory such that, once data is stored in a memory block, an encryption processor of the appliance may process the data or the network adapter may retrieve the processed data without having to wait for completion of the data transfer between the adapter and memory, thereby reducing processing latency in the security appliance.

Abstract: A method, system and program product for maximizing virus check coverage, while minimizing redundancy in virus checking. The method includes evaluating, using an audit checking tool, whether or not a file in a working directory to be virus checked is a compressed file and, if the file is evaluated as being a compressed file, decompressing the compressed file evaluated using a decompression tool. Further, the method includes iterating the evaluating and decompressing steps to decompress any other files contained therein using the decompression tool and deleting a respective compressed file that is fully decompressed by the decompression tool without any errors from the working directory, while saving a respective compressed file that is not fully decompressed by the decompression tool. Furthermore, the method includes virus checking the working directory, such that, the virus checking does not virus check the respective compressed file that is deleted from the working directory.

Abstract: A bit string having a predetermined length is added to a head of a data string. The data string to which the bit string is added is compressed to produce a compressed data string. A head part is taken off from the compressed data string. The head part includes from a head position of the compressed data string to a predetermined position of the bit string compressed at the compressing. The head part and a latter part of the compressed data are output separately.

Abstract: An end-user system for the blocking of recording digital content at during the rendering of encrypted digital multimedia files. Before the process of rendering of encrypted digital multimedia can be started all rendered media stream during playback are opened to ensure that this multimedia content is not recorded. This blocks the usage of the multimedia interfaces including devices and/or ports that can be used to store un-encrypted content that has been decrypted for the purposes of playing or rendering. The method also includes an exception, which allows recording with permission from the present invention.

Abstract: A mobile wireless communications device which may include a housing, an antenna carried by the housing, a wireless transceiver carried by the housing and connected to the antenna, and at least one memory for storing a compressed software file, a digest of an uncompressed version of the software file, and a digital signature of the compressed software file and the digest generated based upon a private key. The device may further include a processor carried by the housing and cooperating with the wireless transceiver for performing wireless communications. The processor may also cooperate with the at least one memory for authenticating the compressed software file based upon the digital signature and a public key corresponding to the private key. Upon authentication of the compressed software file, the processor uncompresses the compressed software file. The uncompressed software file may then be re-authenticated at a time after installation based upon the digest.

Abstract: Provided are a method and apparatus for partially encrypting speech packets, more specifically, a method and apparatus for selecting partial encryption sets used for a partial encryption technique in which compressed speech packets are partially encrypted to obtain the same effect as a full encryption technique. The method includes the steps of: (a) compressing respective speech files stored in a large-capacity speech database into the speech packets using a speech codec; (b) measuring single-bit loss distortion and sequential-bit loss distortion of the speech packets compressed in step (a); (c) generating standards for selecting partial encryption sets based on the measurement results of the single-bit loss distortion and sequential-bit loss distortion; (d) selecting the partial encryption sets according to the generated standards; and (e) encrypting the speech packets using the selected partial encryption sets.

Abstract: It is an object to provide an efficient transfer of content data. In a case of transferring the content data from a data transfer device on a primary recording medium side to a data recording device to record the content data in a secondary recording medium, a data compression system and a bit rate that are conformable to the data recording device are compared with a data compression system and a bit rate of the content data to be sent, so that a required transfer processing is brought into realization according to a result of the comparison. For instance, when both the data compression systems are equal, and the bit rate of the content data is not more than the bit rate that is conformable to the data recording device, the content data is sent as it is in an encrypted compressed data state.