Abstract: In a method for operating a conditional access system for broadcast applications, the conditional access system comprising a number of subscribers and each subscriber having a terminal including a conditional access module and a secure device for storing entitlements, a source signal is encrypted using a first key (CW). The encrypted source signal is broadcasted for receipt by the terminals, wherein entitlement control messages (ECM's) are sent to the secure devices, the ECM's comprising the first keys (CW) encrypted using a service key (PT). Entitlement management messages (EMM's) are sent to the secure devices providing the service key (PT) required to decrypt encrypted first keys (CW). A cracked secure device which is used in an unauthorized manner is traced by sending different keys required to obtain the first keys to different terminals or groups of terminals and monitoring the key information provided by a pirate.

Abstract: The invention is directed to a method and apparatus for preventing software piracy. A license enforcement server may be integrated with an operating system running on a network-critical machine. As such, other computational devices connected to the network may obtain permission to perform licensed activities. These computational devices may have an instruction set for communicating with the license enforcement server. Further, the license enforcement server may communicate with a licensing organization. The license enforcement server may utilize a namespace tree to organize licenses and uniquely identify licensed activities. In this manner, a universal license enforcement system may be achieved in which disabling of the license enforcement mechanisms would adversely effect a network.

Abstract: A random number that is co-prime with a set of prime numbers is generated, without having to calculate the greatest common denominator of the numbers. The value of 1?x?(mod ?), where x is a randomly generated value and ? is the Carmichael function, is tested to determine whether it is non-zero. If it equals zero, x is chosen as the random number of interest. Otherwise the value for x is updated, and the procedure is repeated. Due to the minimal amount of computation resources required to select x, the process is particularly well suited for generating cryptographic keys in portable electronic devices, such as smart cards.

Abstract: A method and system for simultaneous and concurrent processing of parameters associated with an electronic document is described. The method comprises the sharing of a memory location between the processing steps that examine each of the parameters, such that if any parameter is marked as invalid, a termination of examination of the other parameters is effected.

Abstract: A method for calculating the arithmetic inverse of a number V modulo U, where U is a prime number, that may be used in cryptography, uses a modified extended greatest common divisor (GCD) algorithm that includes a plurality of reduction steps and a plurality of inverse calculations. In this algorithm, the values U and V are assigned to respective temporary variables U3 and V3 and initial values are assigned to respective temporary variables U2 and V2. The algorithm then tests a condition and, if the condition tests true, combines multiple ones of the plurality of reduction steps and multiple ones of the inverse calculations into a single iteration of the GCD algorithm.

Abstract: A system, method and computer program product are provided for accelerated scanning. Initially, a file access pattern associated with data is identified. The data is subsequently read based on the file access pattern. A virus scan is then performed on the data.