# US 2025/0158803 A1 · Encryption Cloaking with a Modified Radix-n Function for Enhanced Security

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

- Number: US 2025/0158803 A1
- Document ID: US20250158803A1
- Status: Published application
- Kind: A1
- Application number: 18/908,321
- Filed: 2024-10-07
- Published: 2025-05-15
- Earliest claimed: 2023-11-11
- Inventors: Peter Lablans
- Web page: https://patentgrep.com/patent/US20250158803A1

## CPC

- H04L 9/0631: {Substitution permutation network [SPN], i.e. cipher composed of a number of stages or rounds each involving linear and nonlinear transformations, e.g. AES algorithms}
- G09C 1/00: Apparatus or methods whereby a given sequence of signs, e.g. an intelligible text, is transformed into an unintelligible sequence of signs by transposing the signs or groups of signs or by replacing them by others according to a predetermined system (cryptographic typewriters G09C3/00)
- 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: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G09C: CIPHERING OR DECIPHERING APPARATUS FOR CRYPTOGRAPHIC OR OTHER PURPOSES INVOLVING THE NEED FOR SECRECY

## Abstract

A cryptographic computer processes a word of p bits in an electronic message as a set of k n-state elements with n an integer greater than 2 and 2{circumflex over ( )}p>n and k>1, with the p bits being characterized as a word of k n-state elements. The computer processes two words of k n-state elements as an radix-n operation that includes a 2 operand reversible n-state operation of which an output is a residue and a 2 operand n-state transition function of which an output is an n-state transition element. An output of the radix-n operation is a word of k n-state elements. The radix-n operation is preferably not reversible and is part of an operation that generates a cryptographic message. A standard cryptographic operation is modified by applying the radix-n operation. The cryptographic message is transmitted over a physical channel.

## Claims

### Claim 1

A cryptographic device, comprising:
a memory in a first computing device enabled to store data in and to retrieve data from, including instructions;
a processor in the first computing device configured to retrieve instructions from the memory to perform the steps:
implementing an n-state reversible 2 operand function and an n-state 2 operand transition function;
processing as a radix-n operation upon two series of p bits as two words of k n-state elements, the radix-n operation generating with the n-state reversible 2 operand function an n-state residue element and with the n-state 2 operand transition function an n-state transition element, with n an integer greater than 3, k an integer greater than 1 and p an integer being 16 or greater;
generating with the n-state reversible 2 operand function with as input operands the n-state residue element and the n-state transition element an n-state output element in an output word of k n-state elements, wherein the radix-n operation is a non-reversible operation;
generating a cryptographic message from the output word of k n-state elements in an encryption or a hashing of an electronic message; and
outputting the cryptographic message on a physical transmission channel to a second computing device.

### Claim 2 (depends on 1)

The cryptographic device of claim 1, wherein n=2{circumflex over ( )}k.

### Claim 3 (depends on 2)

The cryptographic device of claim 2, wherein the n-state reversible 2 operand function is characterized as an addition over GF(n), with GF(n) being a finite field of n different elements.

### Claim 4 (depends on 2)

The cryptographic device of claim 2, wherein the n-state reversible 2 operand function is a commutative involution that is not characterized as an addition over GF(n), with GF(n) being a finite field of n different elements.

### Claim 5 (depends on 1)

The cryptographic device of claim 1, wherein the n-state 2 operand transition function is characterized by an n by n n-state lookup table, with no more than n+n/2 and not fewer than n/2 of each n-state element.

### Claim 6 (depends on 1)

The cryptographic device of claim 1, wherein the k n-state elements are part of a state array in an Advanced Encryption Standard—Galois Counter Mode (AES-GCM) encryption and at least one round in an AES-GCM keystream generation is modified by replacing a bitwise XOR of the two words of p bits in the state array by the radix-n operation on k n-state elements.

### Claim 7 (depends on 1)

The cryptographic device of claim 1, wherein the k n-state elements are part of a state array in an ChaCha20 encryption and at least one quarter-round in a ChaCha20 keystream generation is modified by replacing a bitwise XOR of the two words of p bits in the state array by the radix-n operation on k n-state elements.

### Claim 8 (depends on 7)

The cryptographic device of claim 7, wherein the k n-state elements are part of a state array in an ChaCha20 encryption and at least one quarter-round in a ChaCha20 keystream generation is modified by replacing an addition modulo-2{circumflex over ( )}32 of two words of p bits in the state array by the radix-n operation on k n-state elements.

### Claim 9 (depends on 1)

The cryptographic device of claim 1, wherein the n-state reversible 2 operand function is an FLTed version of another n-state reversible 2 operand function.

### Claim 10 (depends on 1)

The cryptographic device of claim 1, wherein n-state 2 operand transition function is an FLTed version of another n-state 2 operand transition function.

### Claim 11

A computer implemented operation, comprising:
implementing an n-state reversible 2 operand function and an n-state 2 operand transition function on the computer;
processing a radix-n operation on two series of p bits as two words of k n-state elements, the radix-n operation generating with the n-state reversible 2 operand function an n-state residue element and with the n-state 2 operand transition function an n-state transition element, with n an integer greater than 3, k an integer greater than 1 and p an integer being 16 or greater;
generating with the n-state reversible 2 operand function with the n-state residue element and the n-state transition element as input operands an n-state output element in an output word of k n-state elements, wherein the radix-n operation is a non-reversible operation;
generating a cryptographic message from the output word of k n-state elements in an encryption or a hashing of an electronic message; and
outputting the cryptographic message on a physical transmission channel to a second computing device.

### Claim 12 (depends on 11)

The computer implemented operation of claim 11, wherein n=2{circumflex over ( )}k.

### Claim 13 (depends on 12)

The computer implemented operation of claim 12, wherein the n-state reversible 2 operand function is characterized as an addition over GF(n), with GF(n) being a finite field of n different elements.

### Claim 14 (depends on 12)

The computer implemented operation of claim 12, wherein the n-state reversible 2 operand function is a commutative involution not characterized as an addition over GF(n), with GF(n) being a finite field of n different elements.

### Claim 15 (depends on 12)

The computer implemented operation of claim 12, wherein the n-state 2 operand transition function is characterized by an n by n n-state array, with no more than n+n/2 and not fewer than n/2 of each n-state element.

### Claim 16 (depends on 11)

The computer implemented operation of claim 11, wherein the k n-state elements are part of a state array in an Advanced Encryption Standard—Galois Counter Mode (AES-GCM) encryption and at least one round in an AES-GCM keystream generation is modified by replacing a bitwise XOR of the two words of p bits in the state array by the radix-n operation on k n-state elements.

### Claim 17 (depends on 11)

The computer implemented operation of claim 11, wherein the k n-state elements are part of a state array in an ChaCha20 encryption and at least one quarter-round in a ChaCha20 keystream generation is modified by replacing a bitwise XOR of the two words of p bits in the state array by the radix-n operation on k n-state elements.

### Claim 18 (depends on 11)

The computer implemented operation of claim 11, wherein the k n-state elements are part of a state array in an ChaCha20 encryption and at least one quarter-round in a ChaCha20 keystream generation is modified by replacing an addition modulo-2{circumflex over ( )}32 of two words of p bits in the state array by the radix-n operation on k n-state elements.

### Claim 19 (depends on 11)

The computer implemented operation of claim 11, wherein the n-state reversible 2 operand function is an FLTed version of another n-state reversible 2 operand function.

### Claim 20 (depends on 11)

The computer implemented operation of claim 11, wherein n-state 2 operand transition function is an FLTed version of another n-state 2 operand transition function.
