International Business Machines Corporation

Lakshmanan Velusamy

Arun C Ramachandran

Subramaniyam Chandrasekaran

Puvichakravarthy Ramachandran

Shunmugam Murugan

Vidya Ranganathan

Savitri Hunasheekatti

Uma M Chandolu

Divakar Adari

Vinodh Kumar Venkatesan

A confidential information exchange between a sender and a receiver may be conducted without the use of encryption keys. The information is coded with a Challenge-Response Table that is shared between the sender and the receiver. Rather than sending a challenge and then waiting for a response, the challenge and response are both sent by the sender of the information. The information sent comprises an index with a challenge and a response from the Challenge-Response Table. Upon receiving the coded information, the receiver uses the Challenge-Response Table to decode the information by using the index to locate the challenge and its valid response. Upon determining that the challenge and the response are correct, a first decoded answer is determined. Upon determining that either the challenge or the response, or both, are incorrect, a second decoded answer is determined.

Keyless challenge and response system

The disclosed technology generates two relative prime numbers and, then, using the relative prime numbers converts a super-increasing (SI) knapsack into a non-super-increasing (NSI) knapsack. The NSI knapsack becomes a public key and the corresponding SI knapsack, along with the two relative prime numbers, becomes a private key. A message is encrypted using a subset S of the private key that totals a number N. The message, the public key and the number N are transmitted to a recipient, who knows the value of the two relative prime numbers. The recipient uses the relative prime numbers to convert the public key into the private key and, then, generates the subset S by solving the private key with respect to the number N. Using the subset, the message is decrypted.

Generation of relative prime numbers for use in cryptography

The disclosed technology generates two relative prime numbers and, then, using the relative prime numbers converts a super-increasing (SI) knapsack into a non-super increasing (NSI) knapsack. The NSI knapsack becomes a public key and the corresponding SI knapsack, along with the two relative prime numbers, becomes a private key. A message is encrypted using a subset S of the private key that totals a number N. The message, the public key and the number N are transmitted to a recipient, who knows the value of the two relative prime numbers. The recipient uses the relative prime numbers to convert the public key into the private key and, then, generates the subset S by solving the private key with respect to the number N. Using the subset, the message is decrypted.

According to one aspect of the present disclosure, a method and technique for domain based partition and resource group management is disclosed. The method includes: responsive to determining that an operation is being attempted on an object, determining a partition identifier associated with the object; determining a domain identifier associated with a user attempting the operation; determining whether the operation can proceed on the partition based on domain isolation rules, the domain isolation rules indicating rules for allowing or disallowing operations to proceed on the partition based on partition identifiers and domain identifiers; and responsive to determining that the operation on the partition can proceed based on the domain isolation rules, permitting the operation.

Domain based management of partitions and resource groups

Disclosed herein are methods, systems, and computer program products for managing data within a file system. In embodiments, the method includes determining the location of data within a file to be modified, modifying the data within the file, and adjusting a pointer to point to the data block containing the modified data. The data within a file may be modified by deleting data from the file or inserting new data into the file. New data may be inserted into a file by writing the data into new data blocks and then adjusting the pointers to point to the location of the new data blocks. An example method may also include determining whether data blocks are incomplete blocks and identifying the incomplete blocks by negating the value of the pointers to those blocks.

Modification of data within a file

The invention includes a method for encrypting and transmitting a message M from a first location to a second location. Random numbers P and Q are initially selected, each of them being either a prime or a non-prime number. P and Q are both furnished to a sender and a recipient at the first and second locations, respectively. A client at the first location generates an encrypted message E, which is the remainder left when a modulus operator divides a first quantity, equal to M multiplied by P to the i power, where i is a selected number, by a second quantity equal to (PQ&#x2212;1). A tuple comprising E and i is transmitted from the first location to the second location, and a second data processing system at the second location to determines the message M from E, i and Q.

Use of a private key to encrypt and decrypt a message

An Eroot unit is configured to compute an Eroot of a number A with a machine. The Eroot unit locates a value E, which is even, in a first entry of a plurality of entries of a structure. The Eroot unit is configured to read a product of the pair of prime numbers from the first entry. The Eroot unit is configured to read a second of the pair of key values in the first entry. The Eroot unit is configured to encrypt the number A using the product of the pair of prime numbers to generate an encrypted value. The Eroot unit is configured to apply a decryption operation to the encrypted value using the second of the pair of key values to generate an intermediate value. The Eroot unit is configured to compute a square root of the intermediate value.

Growing community of inventors

Tamil Nadu, India

Lakshmanan Velusamy