Matsushita Electric Industrial Co., Ltd.

Panasonic Corporation

Gregory Michael Perkins

David Alan Braun

Laszlo Hars

Sathya Narayanan

Prabir Bhattacharya

Methods and apparatus to limit access to a secure personal network are provided. The method includes receiving an Internet protocol (IP) packet of a device including a confirmation value associated with the SPN. The method compares the confirmation value to a predetermined confirmation value and allows access to the SPN when the confirmation value matches the predetermined confirmation value. The IP packet is dropped otherwise. The confirmation value and the predetermined confirmation value are generated by an algorithm including a pseudorandom number generator, a hash function and a one-time password.

Method for secure packet identification

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.

Using hardware to secure areas of long term storage in CE devices

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.

System for inhibiting installing a radio configuration file onto a software defined radio device unless the file is compatible with the device

A data structure to be used for representing the problem is selected. An instance of the problem is represented with the data structure. The data is encrypted with a sequence which is obtained by solving the problem. Alternatively, in an alternative embodiment of the present invention, a program for heuristically solving an NP-hard problem is received. A data structure that represents an instance of the problem is received. The program is applied to the instance of the problem to obtain a sequence. The data is decrypted with the sequence.

Method and apparatus for protecting data

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.

Table driven method for calculating arithmetic inverse for use in cryptography

A method for calculating greatest common divisors uses an approximate division in its reduction step. The result of this approximate division is then compared to determine if it is valid. If not, then the method applies a correction to the first approximate division to determine corrected values that have a reduced number of bits. If, during this correction step, the result is again not valid, then another method is applied to reduce the number of bits in the values. The approximate division is applied only when the number of significant bits in the two values differ by at least a predetermined number. When the number of bits in the two values differ by less than this number, an alternative GCD algorithm is applied but only to reduce the number of bits in the intermediate values.

Efficient greatest common divisor algorithm using multiprecision arithmetic

A method for calculating greatest common divisors and modular inverses using the extended Jebelean GCD algorithm keeps track of the number of times that U3 and V3 have been divided by two in the process of calculating the greatest common divisor and correct the modular inverse for these divisions. The shifting of the binary values representing U3 that occurs during the calculation of the GCD is accomplished by changing the position of respective pointers to bit positions in the binary values rather than implementing a shifting operation.

Growing community of inventors

Pennington, NJ, United States of America

Gregory Michael Perkins