Some examples include sending, to a secure environment, coordinates for certain touch events made to a touchscreen of an electronic device. As one example, an import address table that is accessed by an event loop of the electronic device may be modified. For instance, only those touch events that are performed within the bounds of a user interface area may ...

Methods, systems, and computer-readable media for anonymizing electronic documents. In accordance with one or more embodiments, structurally-similar electronic documents can be identified among a group of electronic documents (e. G., e-mail messages, documents containing html formatting, etc.). A hash function can be specifically tailored to identify the similarly structured documents. The structurally-similar electronic documents can be grouped into a same ...

Methods, systems, and computer-readable media for mapping entities to social profile data. Social data regarding an entity (e. G., a notable entity, celebrity, movie, famous brand, etc.) is filtered from one or more open knowledge databases to produce filtered social data regarding the entity (or entities). The filtered social data is clustered and classified with respect to the entity according ...

A method, and system for implementing enhanced fast full synchronization for remote disk minoring in a computer system. A source backup copy is made locally available to a target for remote disk mirroring. Sectors are identified that are different between the source and target. A hash function is used over a block to be compared, with an adaptive number of ...

A system and method for generating pseudorandom numbers by initializing a counter value for a call-counter, sending a bit-wise form of the counter value from the counter to a mixing function, and mixing the counter value to generate the pseudorandom number. The mixing function may be a xor tree, substitution-permutation, or double-mix feistel. The pseudorandom number generator can operate by ...

The present disclosure involves systems, software, and computer implemented methods for calculating hashes of archive files and their file entries. In one example, a method may include receiving an archive file which includes at least one compressed file, storing the archive file by sending a first copy of the archive file stream to a first processing thread which stores the ...

A hashing system can use a set of multiple numbers that are co-prime to the size of a hash table to select a probe offset when collisions occur. Selecting a probe offset that is co-prime to the hash table size ensures that each hash table slot is available for any insert operation. Utilizing different co-prime numbers for different keys helps ...

An infusion pump and server computer have improved network access security. The infusion pump has a network interface circuit to provide communications over a network and a processing circuit that generates infusion pump data for transmission to a remote server computer. The processing circuit generates a header portion of a request message having at least one field, hashes the header ...

Methods, software, and hardware are disclosed for providing verified real time price quotes in an over-the-counter financial market. Systems are described that can comprise methods, software, and/or hardware to provide verified real time price information for securities traded over-the-counter. Verification methods of the invention include identifying suspect source data, wherein the suspect source data includes information about the price ...

A method of non-identical feature matching in a search system, the search system having a set of data points. The method includes determining a threshold error and expanding the set to create an expanded set by including all data points as data elements of the expanded set and, for every data point in the set, finding all data elements within ...

Methods, apparatus, systems, devices, and computer program products directed to enabling federation 200 of multiple independent networks 204a, 204b, 204c, 204d through hash-routing based peering (hrp) and/or summary-routing based peering (srp) are provided. Pursuant to new methodologies and/or technologies provided herein the multiple independent networks self-organize, or otherwise assemble, as a federation of network peers. The network peers 204a, 204...

Disclosed are a system and method of a large-scale simultaneous digital signature service based on a hash function. According to the system and method, the main agent that requires the generation of a digital signature does not itself generate the digital signature, and digital signatures may be simultaneously and stably generated for large-scale data such as multiple electronic documents and ...

A system and process for securing digital media file content for persistence is disclosed. Aspects of the system and process protect content from being altered or embedded with malicious code during distribution through a network. A digital media file is embedded with a hash function. In some embodiments, successive frames may be hashed. A copy of the hash function may ...

A method of providing a hash value for a piece of data is disclosed, where the hash value provides for a time-stamp for the piece of data upon verification, for limiting a risk of collisions between hash values. The method comprises collecting one or more root time-stamps for a root of a hash tree structure defining a hash function, wherein ...

Creating hash values based on bit values of an input vector. An apparatus includes a first and a second hash table, a first and second hash function generator adapted to configure a respective hash function for a creation of a first and second hash value based on the bit values of the input vector. The hash values are stored in ...

An infrastructure delivery platform provides a rsa proxy service as an enhancement to the tls/ssl protocol to off-load, from an edge server to an external cryptographic server, the decryption of an encrypted pre-master secret. The technique provides forward secrecy in the event that the edge server is compromised, preferably through the use of a cryptographically strong hash function that ...

A system of λ≧2 servers is provided. The server system comprises an access control server for communication with user computers via a network and controlling access by the user computers to a resource in dependence on authentication of user passwords associated with respective user ids, and a set of authentication servers for communication with the access control server ...

Embodiments of the present invention provide methods, systems, and computer program products for data deduplication. In one embodiment, for a data chunk, it is determined whether a hash value of the data chunk generated by a first hash function is present in a hash table. Once a threshold size of the hash table is reached, it is determined whether there ...

Input data can be split into data components that can each have a length equal to a machine word size of a processor capable of parallel processing. Hash components can be selected to have a length equal to the length of the data components. A bitwise hashing function can be performed, in which each data component is hashed with a ...

Information describing changes to a collection of items maintained by a database may be stored in a log file. The information in the log file may be converted into a stream of records describing the changes. The records may be directed to a computing node selected for performing a trigger function in response to the change, based on applying a ...

There is provided a method of providing a hash value for a piece of data, where the hash value provides for a time-stamp for the piece of data upon verification. The method comprises deriving one-time signing keys of signer's one-time signing key hash chain by a one-way function of a secret key of the signer and a function of an ...