Abstract: A system is provided for composition trust binding in a peer-to-peer network environment. The system includes: a service requestor (21) residing on a peer (22) in the network and able to invoke a service (23) residing on another peer (24) in the network. The service requestor is also able to communicate a composition trust binding to the peer hosting the service, where the composition trust binding i a set of rules that define a collection of allowable software components which may be invoked by the service. A validation agent (25) ensures that the service executes in accordance with the binding.

Abstract: A system includes long-term storage (e.g., flash memory) for storing sensitive data and critical components of a consumer electronic (CE) device such as an operating system (OS) kernel, private cryptographic key values, security applications, and firmware configurations, for example. Security hardware/software designates and restricts access to secured portions of long-term storage that contain the critical components. Requests for access to these secured portions are addressed by the security hardware/software, which authenticates a cryptographic authorization code received with the request. Read-write access to the secured portions is allowed for download and installation of, for example, a software or firmware upgrade if the cryptographic authorization code is authenticated.

Abstract: A method for securely connecting a software defined radio (SDR) to a server through a network is presented. A request to download a radio configuration (R-CFG) file is sent from the SDR device to the server. A determination is made that the R-CFG file is configured to control a plurality of radio frequency parameters for the SDR device solely within levels permitted by a regulatory agency. The R-CFG is then downloaded to the SDR device.

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 multi-precision exponentiation method and apparatus for use in an encryption/decryption system is disclosed. The encryption/decryption operation uses a computer architecture that includes a central processing unit and a co-processor. The exponent may be represented by a binary data string. The method includes generating an initial look-up table that is indexed by a set of predetermined values. Each predetermined value represents the base raised to a respectively different exponential power. The co-processor calculates the base value raised to the exponent according to a predetermined exponential algorithm. The calculation includes retrieving a sequence of the predetermined values from the look-up table, each of the predetermined values corresponding to one of a plurality of sub-strings of the exponent data string.

Abstract: A secure cryptographic function is generated from a template containing static program code that is the same for all mobile agents and dynamic program code which differs for each function. The dynamic code implements a stream cipher encryption algorithm that is used to encrypt messages processed by the function. The dynamic code may also generate a message digest that is attached to each message. The message digest may be a hash function applied to the dynamic code and, optionally, to the message. Each function may be assigned a limited lifetime, either by assigning it a fixed termination time, a maximum number of messages that it may send or, if the cryptographic function is used with a mobile agent, a maximum number of hosts that it may visit. Any received messages that have been processed by the encryption algorithm after the expiration of its lifetime are ignored.

Abstract: An apparatus and method for secure data handling in a distributed network is implemented by a secure agent connected by a secure channel to a primary communication unit, secondary communication unit, and clients. The primary communication unit and secondary communication units are connected to separate key-stores having keys. A method using distributed keys for encryption and decryption is disclosed. Another method utilizes multiple-time keys.

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 method and system for providing access to a data file enables predetermination of the number of times the file is accessible. The data file is encrypted with a master key, and one or more dual-encrypted blocks are generated based on a set of secondary keys. The dual-encrypted blocks are contained within the encrypted data file. The method further provides for providing the encrypted data file and an attachment file to an authorized user, where the attachment file enables a device to access the data file content once for each secondary key. The file is accessed by decrypting single-encrypted blocks of the data file with a master key. Dual-encrypted blocks of the data file are decrypted with the master key and a secondary key. The decryption steps are repeated for a set of secondary keys such that the device is able to access the data file content once for each secondary key in the set.