Abstract: Authentication is performed to a confidence level (CL) desired by a verifier (220). A prover (210) picks and sends certain same size, square matrices to the verifier (220). A random request bit is sent (234) from the verifier (220) to the prover (210) after the receipt of a certain square matrix. Depending on the request bit, calculations are made (244, 264) by the verifier (220) to determine if the matrices sent from the prover are verifiable. The prover (210) is iteratively authenticated by the verifier (220). Iterations are continued until (320) a count of the iterations (IL) reaches a number sufficient to achieve the desired confidence level (CL). After a delay, more iterations can achieve a higher confidence level by building on previous result of authentication without having to begin at zero. During this delay, the verifier (220) can perform tasks in reliance on the result of authentication. Digital logic can perform the authentication.

Abstract: A scrambling method (510) divides a set of data (200) into a first portion and a second portion. A first scrambling method is performed on the first portion of the set of data to create a scrambled first portion of the data. The second portion of the set of data is modified with the scrambled first portion of the set of data to create a modified second portion of the set of data. A second scrambling method is performed on the modified second portion of the set of data to create a scrambled second portion of the set of data. The scrambled first portion of the set of data is modified with the scrambled second portion of the set of data to create a scrambled set of data (220). A descrambling method (520) reverses the scrambling method (510) to create a descrambed set of data (200).

Abstract: In order to address the need for detection of fraudulent items, a method, apparatus, and system for detection of fraudulent items is provided herein. Special anti-forgery Radio-Frequency identification (RFID) tags are utilized with additional measures to thwart would-be forgers. Each anti-forgery RFID tag comprises a unique, or semi-unique number that, along with a private key possessed by only the legitimate product manufacturer, determines a signature that is preferably printed on the product packaging. Utilizing the unique number on the anti-forgery RFID and a public key corresponding to the private key, the signature is verified by standard public-key cryptographic methods. The validation of the signature identifies the product's authenticity.

Abstract: A method and apparatus for linking an advertisement and digital content are provided herein. The linkage is such that any attempt to render the desired digital content must first render the advertisement before the digital content can be accessed. The procedure is typically to prepend the advertisement to the digital content and to use a hash of the advertisement as a Content Encryption Key (CEK) which is needed to decrypt the digital content.

Abstract: To address the need for a communicating electronic device (102) to identify other trusted devices (103) and allow for applications, such as digital-rights management, and the easy transfer of content and commands (217) among devices, a method and apparatus for identifying trusted devices (103) is disclosed herein. Each electronic device wishing to share digital content will comprise a database (209) containing a list of trusted and/or non-trusted devices. The list of trusted and non-trusted devices is similar to a master list of trusted and non-trusted devices that exists at the certificate authority or an equivalent trusted server. However, in order to limit the size of the database existing on the electronic device, only a portion of the master list will be stored locally.

Abstract: A cipher encryption and decryption method and apparatus which uses a plurality of rounds (221). Each round contains a plurality of s-box subrounds (100), a matrix convolution (250) and an XOR with a key. Each s-box subround has a permutation polynomial (430), modulo reduction (435) and a hilo swap (450). Processor efficiency is favored in a forward operation over an inverse operation.

Abstract: A method of authenticating digital content of a digital object. Content is divided into portions or chunks. A chunk hash of each chunk is calculated to provide chunk hashes that are stored as entries in a hash table. The chunk hash entries of the hash table are in turn hashed to create an overall hash of the hash table. Verification of the content first includes determining whether a recalculated overall hash of the hash table matches the previously calculated overall hash of the hash table. If the recalculated overall hash does match, this indicates that the hash table is authenticated and that the authenticity of the individual chunks can be verified. Verification of the authenticity of an individual chunk, which may be performed concurrently with the processing of the individual chunk, allows the content of the digital object to be incrementally rendered, chunk by chunk, resulting in a much faster and efficient rendering of the verified digital content.

Abstract: A scrambling method (510) divides a set of data (200) into a first portion and a second portion. A first scrambling method is performed on the first portion of the set of data to create a scrambled first portion of the data. The second portion of the set of data is modified with the scrambled first portion of the set of data to create a modified second portion of the set of data. A second scrambling method is performed on the modified second portion of the set of data to create a scrambled second portion of the set of data. The scrambled first portion of the set of data is modified with the scrambled second portion of the set of data to create a scrambled set of data (220). A descrambling method (520) reverses the scrambling method (510) to create a descrambed set of data (200).