# US 2012/0250856 A1 · Method And System For Encryption With Bidirectional Difference Propagation

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

- Number: US 2012/0250856 A1
- Document ID: US20120250856A1
- Status: Published application
- Kind: A1
- Application number: 13/423,695
- Filed: 2012-03-19
- Published: 2012-10-04
- Earliest claimed: 2011-03-30
- Assignees: Nagravision S.A.
- Inventors: Sylvain Pasini; Jean-Philippe Aumasson
- Web page: https://patentgrep.com/patent/US20120250856A1

## CPC

- H04L 9/0618: {Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation}
- H04L 9/06: the encryption apparatus using shift registers or memories for block-wise {or stream} coding, e.g. DES systems {or RC4; Hash functions; Pseudorandom sequence generators}
- H04L 9/0637: {Modes of operation, e.g. cipher block chaining [CBC], electronic codebook [ECB] or Galois/counter mode [GCM]}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

An encryption method is disclosed, including two passes over a sequence of N input digital data X1, . . . XN blocks where the first pass executes iterative linear algebraic operations from the last input block XN to the first input block X1 to obtain a sequence of intermediary resulting YN . . . Y1 blocks. The second pass executes a block ciphering in a chaining mode from the first intermediary resulting Y1 block to the last one YN to obtain a sequence of encrypted output Z1 . . . ZN blocks. The decryption is carried out only in one pass from the first input encrypted Z1 block to the last input encrypted block ZN. The deciphering operations are executed in an iterative loop of inverse linear algebraic operations after deciphering the first input encrypted Z1 block to obtain an output sequence of decrypted X1, . . . XN blocks.

## Claims

### Claim 1

A method for encrypting digital data, said data being divided into a sequence of N blocks of a same length of n bits each, comprising steps of:
a) inputting the sequence of N blocks into a pre-processing module comprising a processor, registers, multiplier modules, addition modules, inverter modules, and a memory containing a set of N invertible elements, the N blocks and the N elements of the set being within a predetermined algebraic structure,
b) multiplying, by a multiplier module, each block by an element of the set to obtain a sequence of N intermediary blocks composed by a first block multiplied by a first element, a second block multiplied by a second element, a third block multiplied by a third element and so on until a last intermediary block composed by a last block multiplied by a last element,
c) adding, by an addition module, the last intermediary block to the immediately preceding intermediary block to obtain a resulting block, the last intermediary block corresponding to the last resulting block,
d) adding the previously obtained resulting block to the immediately preceding intermediary block to obtain a further resulting block,
e) repeating step d) until the step of adding the second resulting block to the first resulting block, said first resulting block being formed by the addition of all N intermediary blocks.
f) outputting a sequence of N resulting blocks, each having a length identical to a corresponding block of the input sequence of N blocks, and
g) ciphering each resulting blocks of the sequence, by a ciphering module, with a block cipher in a chaining mode from the first resulting block to the last resulting block with a ciphering algorithm to produce a sequence of N encrypted blocks, said encrypted blocks having each a same length.

### Claim 2 (depends on 1)

The method according to claim 1 wherein the N invertible elements of the set are all equal to a value corresponding to the multiplicative identity of the predetermined algebraic structure.

### Claim 3 (depends on 2)

The method according to claim 2, wherein the N blocks of the input sequence and the N resulting blocks are elements of a finite Gallois ring including binary elements of n bits where multiplication corresponds to logical AND operation and addition corresponds to logical XOR operation carried out bitwise.

### Claim 4 (depends on 2)

The method according to claim 2 wherein the N invertible elements of the set are all equal to a value corresponding to the multiplicative identity of the predetermined algebraic structure and wherein the N blocks and the N resulting blocks are elements of a finite Gallois ring including binary elements of n bits where multiplication corresponds to logical AND operation and addition corresponds to logical XOR operation carried out bitwise, comprising steps of:
a) inputting the sequence of N blocks into the pre-processing module,
b) executing bitwise XOR operation with the last block and the immediately preceding block to obtain a resulting block, the last block corresponding to the last resulting block,
c) executing bitwise XOR operation with the previously obtained resulting block and the immediately preceding block to obtain a resulting block,
d) repeating step c) until the step of executing bitwise XOR operation with the second resulting block and the first resulting block, said first resulting block being formed by the bitwise XOR operation executed with all N blocks.
e) outputting a sequence of N resulting blocks, each having a length equivalent to a corresponding block of the input sequence of N blocks, and
f) ciphering each resulting blocks with a block cipher in a chaining mode from the first resulting block to the last resulting block with a ciphering algorithm to produce a sequence of N encrypted blocks.

### Claim 5 (depends on 1)

The method for decrypting digital data encrypted according to the method of claim 1, said data being divided into a sequence of N encrypted blocks of a same length of n bits each, comprising steps of:
a) deciphering by a deciphering module the first encrypted block with a deciphering algorithm to obtain a first deciphered intermediate resulting block,
b) deciphering, by the deciphering module, the immediately following encrypted block to obtain a following deciphered intermediate resulting block,
c) inputting the first deciphered intermediate resulting block into a pre-processing module comprising a processor, registers, multiplier modules, addition modules, inverter modules, and a memory containing a set of N invertible elements within a predetermined algebraic structure,
d) calculating by the addition, multiplier and inverter modules, a first decrypted resulting block by subtracting to the first intermediate deciphered resulting block the immediately following intermediate deciphered resulting block and by dividing the result of the subtraction by the first invertible element of the set of N elements,
e) repeating the steps b) to d) with each following encrypted block, until step of obtaining the penultimate decrypted resulting block by subtracting to the penultimate intermediate deciphered resulting block the last intermediate deciphered resulting block and by dividing the result of the subtraction by the penultimate element of the set of N elements.
f) dividing the last intermediate deciphered resulting block by the last element of the set of N elements to obtain the last decrypted resulting block and,
g) outputting a sequence of N decrypted resulting blocks said N decrypted resulting blocks having each a same length.

### Claim 6 (depends on 5)

The method according to claim 5 wherein the N invertible elements of the set are all equal to a value corresponding to the multiplicative identity of the predetermined algebraic structure.

### Claim 7 (depends on 6)

The method according to claim 6, wherein the N decrypted resulting blocks and the N intermediate deciphered resulting blocks are elements of a finite Gallois ring including binary elements of n bits where multiplication corresponds to logical AND operation and addition corresponds to logical XOR operation carried out bitwise.

### Claim 8 (depends on 6)

The method according to claim 6, wherein the N invertible elements are all equal to a value corresponding to the multiplicative identity of the predetermined algebraic structure and wherein the N decrypted resulting blocks and the N intermediate deciphered resulting blocks are elements of a finite Gallois ring including binary elements of n bits where multiplication correspond to logical AND operation and addition correspond to logical XOR operation carried out bitwise, comprising steps of:
a) deciphering by a deciphering module the first encrypted block with a deciphering algorithm to obtain a first intermediate deciphered resulting block,
b) deciphering, by the deciphering module, the immediately following encrypted block to obtain a following intermediate deciphered resulting block,
c) inputting the first intermediate deciphered resulting block into the pre-processing module,
d) calculating a first resulting decrypted block by executing bitwise XOR operation with the first intermediate deciphered resulting block and the immediately following intermediate deciphered resulting block,
e) repeating the steps b) to d) with each following encrypted block, until step of obtaining the penultimate decrypted resulting block by executing bitwise XOR operation with the penultimate intermediate deciphered resulting block and the last intermediate deciphered resulting block, said last intermediate deciphered resulting block corresponding to the last decrypted resulting block, and
f) outputting a sequence of N decrypted resulting blocks said N decrypted resulting blocks having each a same length.

### Claim 9

A system configured to encrypt digital data, said data being divided into a sequence of N blocks of a same length of n bits each, comprising:
a) a pre-processing module comprising a processor, registers, multiplier modules, addition modules, inverter modules, and a memory containing a set of N invertible elements, the N blocks and the N elements of the set being within a predetermined algebraic structure, the pre-processing module being adapted to receive the sequence of N blocks at an input,
b) the multiplier modules being configured to multiply each block by an element of the set to obtain a sequence of N intermediary blocks composed by a first block multiplied by a first element, a second block multiplied by a second element, a third block multiplied by a third element and so on until a last intermediary block composed by a last block multiplied by a last element,
c) the addition modules being configured to add the last intermediary block to the immediately preceding intermediary block to obtain a resulting block, the last intermediary block corresponding to the last resulting block,
d) the addition modules being further configured to add the previously obtained resulting block to the immediately preceding intermediary block to obtain a further resulting block,
e) the addition modules being further configured to repeat the preceding addition operation until adding the second resulting block to the first resulting block, said first resulting block being formed by the addition of all N intermediary blocks.
f) the pre-processing module being adapted to output a sequence of N resulting blocks, each having a length identical to a corresponding block of the input sequence of N blocks, and
g) a ciphering module configured to cipher each resulting blocks of the sequence with a block cipher in a chaining mode from the first resulting block to the last resulting block with a ciphering algorithm and to produce a sequence of N encrypted blocks, said encrypted blocks having each a same length.

### Claim 10 (depends on 9)

The system according to claim 9 wherein the N invertible elements of the set are all equal to a value corresponding to the multiplicative identity of the predetermined algebraic structure.

### Claim 11 (depends on 10)

The system according to claim 10, wherein the N blocks of the input sequence and the N resulting blocks are elements of a finite Gallois ring including binary elements of n bits where multiplication corresponds to logical AND operation and addition corresponds to logical XOR operation carried out bitwise.

### Claim 12 (depends on 10)

The system according to claim 10 wherein the N invertible elements of the set are all equal to a value corresponding to the multiplicative identity of the predetermined algebraic structure and wherein the N blocks and the N resulting blocks are elements of a finite Gallois ring including binary elements of n bits where multiplication corresponds to logical AND operation and addition corresponds to logical XOR operation carried out bitwise, comprising:
a) the pre-processing module being configured to receive the sequence of N blocks at an input,
b) the addition modules being configured to execute bitwise XOR operation with the last block and the immediately preceding block to obtain a resulting block, the last block corresponding to the last resulting block,
c) the addition modules being further configured to execute bitwise XOR operation with the previously obtained resulting block and the immediately preceding block to obtain a resulting block,
d) the addition modules being configured to repeat the preceding bitwise XOR operation until executing the bitwise XOR operation with the second resulting block and the first resulting block, said first resulting block being formed by the bitwise XOR operation executed with all N blocks.
e) the pre-processing module being adapted to output a sequence of N resulting blocks, each having a length equivalent to a corresponding block of the input sequence of N blocks.
f) the ciphering module being configured to cipher each resulting blocks with a block cipher in a chaining mode from the first resulting block to the last resulting block with a ciphering algorithm and to produce a sequence of N encrypted blocks.

### Claim 13 (depends on 9)

The system configured for decrypting digital data encrypted by the system according to claim 9, said data being divided into a sequence of N encrypted blocks of a same length of n bits each, comprising:
a) a deciphering module configured to decipher the first encrypted block with a deciphering algorithm to obtain a first deciphered intermediate resulting block,
b) the deciphering module being further configured to decipher the immediately following encrypted block to obtain a following deciphered intermediate resulting block,
c) a pre-processing module comprising a processor, registers, multiplier modules, addition modules, inverter modules, and a memory containing a set of N invertible elements within a predetermined algebraic structure, the pre-processing module being adapted to receive the first deciphered intermediate resulting block at an input,
d) the addition modules, the multiplier and the inverter modules being configured to calculate a first decrypted resulting block by subtracting to the first intermediate deciphered resulting block the immediately following intermediate deciphered resulting block and by dividing the result of the subtraction by the first invertible element of the set of N elements,
e) the deciphering module, the addition modules, the multiplier and the inverter modules being further configured to repeat deciphering and calculating operations with each following encrypted block, until obtaining the penultimate decrypted resulting block by subtracting to the penultimate intermediate deciphered resulting block the last intermediate deciphered resulting block and by dividing the result of the subtraction by the penultimate element of the set of N elements.
f) the inverter modules being further configured to divide the last intermediate deciphered resulting block by the last element of the set of N elements to obtain the last decrypted resulting block,
g) the pre-processing module being adapted to output a sequence of N decrypted resulting blocks said N decrypted resulting blocks having each a same length.

### Claim 14 (depends on 13)

The system according to claim 13 wherein the N invertible elements of the set are all equal to a value corresponding to the multiplicative identity of the predetermined algebraic structure.

### Claim 15 (depends on 14)

The system according to claim 14, wherein the N decrypted resulting blocks and the N intermediate deciphered resulting blocks are elements of a finite Gallois ring including binary elements of n bits where multiplication corresponds to logical AND operation and addition corresponds to logical XOR operation carried out bitwise.

### Claim 16 (depends on 14)

The system according to claim 14, wherein the N invertible elements are all equal to a value corresponding to the multiplicative identity of the predetermined algebraic structure and wherein the N decrypted resulting blocks and the N intermediate deciphered resulting blocks are elements of a finite Gallois ring including binary elements of n bits where multiplication correspond to logical AND operation and addition correspond to logical XOR operation carried out bitwise, comprising:
a) the deciphering module being configured to decipher the first encrypted block with a deciphering algorithm to obtain a first intermediate deciphered resulting block,
b) the deciphering module being further configured to decipher the immediately following encrypted block to obtain a following intermediate deciphered resulting block,
c) the pre-processing module being adapted to receive the first deciphered intermediate resulting block at an input,
d) the addition modules being configured to calculate a first resulting decrypted block by executing bitwise XOR operation with the first intermediate deciphered resulting block and the immediately following intermediate deciphered resulting block,
e) the deciphering module and the addition modules being further configured to repeat deciphering and bitwise XOR operations with each following encrypted block, until obtaining the penultimate decrypted resulting block by executing bitwise XOR operation with the penultimate intermediate deciphered resulting block and the last intermediate deciphered resulting block, said last intermediate deciphered resulting block corresponding to the last decrypted resulting block,
f) the pre-processing module being adapted to output a sequence of N decrypted resulting blocks said N decrypted resulting blocks having each a same length.
