Abstract: According to one aspect of the present disclosure, a method and technique for domain based user mapping of objects is disclosed. The method includes: responsive to determining that an operation is being attempted on an object identified with an object identifier, determining a domain identifier associated with a user attempting the operation; determining whether the operation can proceed on the object based on domain isolation rules, the domain isolation rules indicating rules for allowing or disallowing operations to proceed on objects based on object identifiers and domain identifiers; responsive to determining that the operation on the object can proceed based on the domain isolation rules, accessing user mapping rules that map specified users allowed to perform a specified operation to a specified object; and determining whether the operation can proceed on the object by the user based on the user mapping rules.

Abstract: 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.

Abstract: Systems and computer program products provide computerized searching of a data set. A computer system, for determining the location of an item in a contiguous data set including a plurality of items, the data set stored in the computer system, includes assigning a numeric value to each of the plurality of items in the data set. A least square polynomial may be created for the data set using ordered pairs of (x, y), wherein x is the assigned numeric value of the item the data set and y is the location of the item in the data set.

Abstract: A method provides computerized searching of a data set. A method determines the location of an item in a contiguous data set including a plurality of items, the data set is stored in a computer system, and the method assigns a numeric value to each of the plural items in the data set. A least squares polynomial may be created for the data set using ordered pairs of (x, y), wherein x is the assigned numeric value of the item the data set and y is the location of the item in the data set. A command is received to search for the location of a target item in the data set, and a calculated target item location in the data set is generated using a target item assigned numeric value and the least squares polynomial.

Abstract: 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.

Abstract: 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.

Abstract: 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?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.