Technologies for executing a serial data processing algorithm on a single variable length data buffer includes streaming segments of the buffer into a data register, executing the algorithm on each of the segments in parallel, and combining the results of executing the algorithm on each of the segments to form the output of the serial data processing algorithm.

Managing policies for a chain of administrative domains, from end-to-end, includes receiving, at a network device associated with an administrative domain that is part of a chain of administrative domains provisioning an Internet-based application or an Internet-based service to a network, a root block for a blockchain. The root block is generated by a network device in the network and includes a request for a specific network parameter over a specific time period. The network device associated with the administrative domain appends a first block to the blockchain including the root block to accept the request and configures the administrative domain in accordance with the specific network parameter when an end-to-end path in the chain of administrative domains accepts the request. The network device associated with the administrative domain also generates blockchain transactions that append network status updates to the blockchain during the specific time period.

A method for data encryption may include receiving input data, finding a delimiter in the input data, generating, based on a position of the delimiter in the input data, a portion of data using a part of the input data, and encrypting the portion of data. The input data may include a record, the delimiter indicates a boundary of the record, and the portion of data may include the record. The position of the delimiter may be in the part of the input data. Generating the portion of data may include generating the portion of data based on a subset of the part of the input data. The part of the input data may be a first part of the input data, and the position of the delimiter may be in a second part of the input data.

Devices and circuitry for computing hash values.

Method and apparatus are disclosed for remote keyless entry authentication. An example remote keyless entry system includes a key fob and a vehicle. The key fob generates a secured message with a plaintext space and a ciphertext space. The vehicle (i) determines whether the key fob may be authorized based on first information in the plaintext space, (ii) decrypts an encrypted value in the ciphertext space based on a predicted full counter value, and (iii) determines whether the key fob is authorized based on second information in the encrypted value.

A method of providing a signed bitstream, performed in association with a process of capturing an audio signal and encoding it as a bitstream, which includes a sequence of data units representing time segments of the audio signal. The method comprises: assigning a score to each data unit; monitoring an accumulated score of data units back to a reference point; when the accumulated score reaches a threshold, inserting into the bitstream a signature unit including a digital signature of fingerprints of a subsequence of the data units back to the reference point; and resetting the reference point. The score is based on a) a detected content of the time segment of the audio signal corresponding to the data unit, b) contextual information relating the time segment to a history of the audio signal, and/or c) information relating to the conditions of capturing the time segment.

A computerized process is described for improving a computer's digital signing capabilities that results in digital signatures that are substantially more secure with enhanced proof of data integrity, signatory authentication, and signatory non-repudiation without modification to underlying signature algorithms. The process utilizes computing resources, plaintext to be signed, and eight asymmetric cryptography digital signature algorithms each utilizing a specified hash algorithm and different private key from a public-private key pair. A novel mechanism is described that copies bit values from common bit positions of plaintext bytes into eight partitions. Each partition of bytes is independently signed using a signature algorithm and the resulting partitions of signed bytes are combined to form a digital signature. As the digital signature verification requires eight signature algorithms each utilizing a specified hash algorithm and a public key from the public-private key pair used for signing, such digital signature is significantly improved over signing with a single signature algorithm utilizing a hash algorithm and key.

A method and system to securely split a digital promise that is recorded in a blockchain. A digital promise represents a promise by a promisor to pay a promisee an asset when a specified condition is satisfied. The specified condition may be fulfillment of a digital contract, also recorded in the blockchain, to which the digital promise is linked. When splitting a digital promise, a split transaction is recorded indicating a split into a first child digital promise and a second child digital promise. In each child digital promise, the promisor promises to pay a child promisee a portion of the asset when a specified child condition is satisfied. When a digital promise is split, the digital promise itself is no longer payable, but the child digital promises are payable when both the specified condition and the specified child condition for the child digital promise are satisfied.

Confidential, secret data may be shared via one or more blockchains. Mortgage applications, medical records, financial records, and other electronic documents often contain social security numbers, names, addresses, account information, and other personal data. A secret sharing algorithm is applied to any secret data to generate shares. The shares may then be integrated or written to one or more blockchains for distribution.

A machine-implemented method of encoding/decoding data is described. The encoding method comprises steps of receiving a message of a given size, the message being represented by a series of units of data, configuring multiple encoding elements (50) in an arrangement having a given frame size, and encoding the message by passing each unit of data through the arrangement so that each unit is processed by at least one of the encoding elements. The frame size of the arrangement is the maximum number of units of data that can pass through the arrangement without any unit of data passing through the arrangement and being processed in the same way as another unit of data. The configuring of the arrangement defines how each unit of data is processed by the encoding elements and creates an arrangement corresponding to a frame size that is dependent upon the number of units of data in the series, for example so that the frame size of the arrangement is guaranteed to be greater than the number of units of data in the series.