# US 12,217,224 B2 · Method and system for efficient transfer of cryptocurrency associated with a payroll on a blockchain that leads to an automated payroll method and system based on smart contracts

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 12,217,224 B2
- Document ID: US12217224B2
- Status: Granted
- Kind: B2
- Application number: 18/389,584
- Filed: 2023-11-14
- Published: 2024-04-11
- Granted: 2025-02-04
- Earliest claimed: 2016-02-23
- Assignees: nChain Licensing AG
- Applicants: nChain Licensing AG
- Inventors: Craig Steven Wright; Stephane Savanah
- Web page: https://patentgrep.com/patent/US12217224B2

## CPC

- G06Q 20/0658: {e-cash managed locally}
- G06Q 20/3829: {involving key management}
- H04L 9/0637: {Modes of operation, e.g. cipher block chaining [CBC], electronic codebook [ECB] or Galois/counter mode [GCM]}
- H04L 9/0643: {Hash functions, e.g. MD5, SHA, HMAC or f9 MAC}
- H04L 9/0841: {involving Diffie-Hellman or related key agreement protocols}
- H04L 9/14: using a plurality of keys or algorithms
- H04L 9/3066: {involving algebraic varieties, e.g. elliptic or hyper-elliptic curves}
- H04L 9/3073: {involving pairings, e.g. identity based encryption [IBE], bilinear mappings or bilinear pairings, e.g. Weil or Tate pairing}
- G06Q 2220/00: Business processing using cryptography
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L 2209/56: Financial cryptography, e.g. electronic payment or e-cash
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Techniques are presented for securely transmitting a output script or information associated with a payroll and a user between a first node and a second node. The method comprises: determining a symmetric-key based on a common secret, based on a first node second private key and a second node second private key, wherein the second node has the same common secret based on a first node second public key and a second node second private key; encrypting at least part of the output script or information associated with the payroll and the second node with the symmetric-key, to an encrypted output script or encrypted information associated with the payroll and the second node; and sending the encrypted output script or encrypted information associated from the first node to the second node.

## Claims

### Claim 1

A method of securely transmitting a output script or information associated with a payroll and a user between a first node and a second node with symmetric-key algorithm, wherein the method comprises:
determining a symmetric-key based on a common secret, wherein the symmetric key is determined using a generator value, wherein the generator value is used to determine the common secret based on a first node second private key and a second node second private key, wherein the second node has the same common secret based on a first node second public key and a second node second private key, and wherein the second node second private key forms a cryptographic pair with a second node second public key, wherein the second node second public key is based on a second node second master public key and the generator value;
encrypting at least part of the output script or information associated with the payroll and the second node with the symmetric-key, to an encrypted output script or encrypted information associated with the payroll and the second node; and
sending, over a communications network, the encrypted output script or encrypted information associated with the payroll and the second node from the first node to the second node.

### Claim 2 (depends on 1)

The method of claim 1, wherein the first node second private key forms a cryptographic pair with a first node second public key.

### Claim 3 (depends on 2)

The method of claim 2, wherein the first node second public key is determined based on a first node master public key and the generator value.

### Claim 4 (depends on 1)

The method of claim 1, wherein a first token is associated with a quantity of cryptocurrency.

### Claim 5 (depends on 4)

The method of claim 4, wherein the first token comprises information associated with employment rights and benefits of the first node or second node.

### Claim 6 (depends on 4)

The method of claim 4, wherein the first token is transferred from the first node to the second node.

### Claim 7 (depends on 1)

The method of claim 1, wherein the generator value is determined based on a string associated with a first node.

### Claim 8 (depends on 1)

The method of claim 1, wherein the generator value is determined based on a Unix time and a nonce.

### Claim 9 (depends on 1)

A non-transitory computer-readable medium comprising machine-readable instructions that when executed by a processor, cause the processor to perform the method of claim 1.

### Claim 10 (depends on 1)

A device comprising:
one or more processors; and
memory storing computer executable instructions that are executable by the one or more processors to cause the device to perform the method of claim 1.