# US 2006/0153377 A1 · Traceable method and system for encrypting and/or decrypting data, and recording media therefor

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

- Number: US 2006/0153377 A1
- Document ID: US20060153377A1
- Status: Published application
- Kind: A1
- Application number: 10/560,429
- Filed: 2004-06-02
- Published: 2006-07-13
- Earliest claimed: 2003-06-17
- Assignees: France Telecom
- Inventors: David Arditti Modiano
- Web page: https://patentgrep.com/patent/US20060153377A1

## CPC

- H04L 9/0618: {Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation}
- H04L 9/3093: {involving Lattices or polynomial equations, e.g. NTRU scheme}
- H04L 2209/606: Traitor tracing
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A traceable method for encrypting and/or decrypting data broadcast by at least one transmitter towards several decoders includes the steps: during encryption of broadcast data, the transmitter implements (in 86) at least one first secret function to transform an unencrypted message into an encrypted message; and during decryption of the broadcast data, all the decoders implement (in 92) at least one common second secret function, each decoder using therefor a mathematical description of the second function stored in a memory (21), the mathematical description of the second function being different from one decoder to another or from one group of decoders to another such that the mathematical description used identifies exclusively the particular decoder or group of decoders.

## Claims

### Claim at position 1

1-15. (canceled)

### Claim 16

Traceable method for encrypting and/or decrypting data broadcast by at least one transmitter towards several decoders, this method enabling the identification of a traitor, amongst different lawful users of the decoders, who has communicated secret data to a non-authorized third party so that this third party is able to encrypt and/or decrypt data broadcast by the transmitter,
in which:
during encryption of the broadcast data, the transmitter applies at least a first secret cryptographic function, and
during decryption of said broadcast data, all the decoders apply at least one same second secret cryptographic function identical to said first function or its inverse, each decoder having recourse for this purpose to a mathematical description of said second function recorded in a memory,
wherein during the application of the second function the mathematical description of this second function, to which each decoder has recourse, is different from one decoder to another or from one group of decoders to another so that the mathematical description to which recourse is made exclusively identifies the particular decoder or group of decoders among all the decoders.

### Claim 17 (depends on 16)

Method as in claim 16, wherein the second cryptographic function is able to process non-redundant data.

### Claim 18 (depends on 16)

Method as in claim 16, wherein said mathematical description (FKj) recorded in the memory of each decoder is formed of several elementary functions (Gi,j) which must be composed with each other in a determined order to form said second secret function.

### Claim 19 (depends on 18)

Method as in claim 18, wherein each elementary function (Gi,j) is equal to the composite of at least three functions as per one of the following equations:
G1,j=f′1,jogσj (1)oS
G2,j=f′2,jogσj (2)of1,j
. . .
Gr-1,j=f′r-1,jogσj (r-1)ofr-2,j
Gr,j=Togσj (r)ofr-1,j
in which:
Gi,j is the −th elementary function of decoder j, j being the index identifying a decoder or group of decoders,
functions fi,j and f′i,j are predefined functions able to render the elementary functions Gi,j non-commutative between each other,
σj is a permutation of all indices {1; . . . ; r}unique to each decoder or group of decoders,
gσj(t) is the σj(t)-th function of a predefined whole formed of r non-linear predefined functions gi commutative between each other, and
S and T are predefined functions able to render difficult the cryptanalysis of elementary functions G1,j and Gr,j respectively,

### Claim 20 (depends on 19)

Method as in claim 19, wherein each function f′i,j is equal to the inverse f of function fi,j.

### Claim 21 (depends on 19)

Method as in claim 19, wherein the functions f1,j are linear functions of a set (Ln) of the tuples of elements of a finished body (L) on itself.

### Claim 22 (depends on 19)

Method as in claim 19, wherein the functions S and T are invertible.

### Claim 23 (depends on 19)

Method as in claim 19, wherein the functions S and T are linear functions of a set (Ln) of the tuples of elements of a finished body (L) towards itself.

### Claim 24 (depends on 19)

Method as in claim 19, wherein the functions gi are chosen so that each elementary function Gi,j corresponds to an encryption block of a multivariate encryption algorithm.

### Claim 25 (depends on 19)

Method as in claim 19, wherein each function gi is of the form gi(a)=aei in which a is an element of an L′ extension of degree n of a basic body L with q elements, and ei is a predefined exponent.

### Claim 26 (depends on 25)

Method as in claim 25, wherein the exponent ei is of the form:
1+qθ1+ . . . +qθ1+ . . . +qθd-1, in which the exponents θi are predefined integers.

### Claim 27 (depends on 16)

Data recording medium, wherein it comprises instructions for the execution of a traceable encryption and/or decryption method according to claim 16, when these instructions are executed by a decoder.

### Claim 28 (depends on 16)

Data recording medium, wherein it comprises instructions for the execution of a traceable data encryption and/or decryption method as in claim 16, when said instructions are executed by a transmitter.

### Claim 29

Traceable system for encrypting and/or decrypting broadcast data capable of identifying a traitor, among different lawful users, who has communicated secret data to a non-authorized third party so that this third party is able to encrypt and/or decrypt the broadcast data, this system comprising:
a transmitter able to encrypt broadcast data, this transmitter being capable of applying at least a first secret cryptographic function, to directly process a message, then of broadcasting the message,
several decoders able to decrypt broadcast data, all the decoders being able to apply a second secret cryptographic function identical to said first function or to its inverse for the direct processing of said broadcast message, each decoder for this purpose being equipped with a memory in which a mathematical description of said second function is recorded;
wherein the memory of each decoder contains a mathematical description of said second function different from the one recorded in the memory of the other decoders or in the memory of the other groups of decoders so that this mathematical description exclusively identifies the particular decoder or group of decoders among all the decoders.

### Claim 30 (depends on 28)

Memory intended to be associated with a decoder of a traceable data encryption and/or decryption system according to claim 28, wherein it comprises a mathematical description equivalent to said second secret function able to be used by the decoder, this mathematical description consisting of several elementary functions (Gi,j) each of which is equal to the composite of at least three functions as per one of the following equations:
G1,j=f′1,jogσj (1)oS
G2,j=f′2,jogσj (2)of1,j
. . .
Gr-1,j=f′r-1,jogσj (r-1)ofr-2,j
Gr,j=Togσj (r)ofr-1,j
in which:
Gi,j is the −th elementary function of decoder j, j being the index identifying a decoder or group of decoders,
functions fi,j and f′i,j are predefined functions able to render the elementary functions Gi,j non-commutative between each other,
σj is a permutation of all indices {1; . . . ; r} unique to each decoder or group of decoders,
gσj(t) is the σj(t)-th function of a predefined whole formed of r non-linear predefined functions gi commutative between each other, and
S and T are predefined functions able to render difficult the cryptanalysis of elementary functions Gi,j and Gr,j respectively.

### Claim 31 (depends on 17)

Data recording medium, wherein it comprises instructions for the execution of a traceable data encryption and/or decryption method as in claim 17, when said instructions are executed by a transmitter.

### Claim 32 (depends on 18)

Data recording medium, wherein it comprises instructions for the execution of a traceable data encryption and/or decryption method as in claim 18, when said instructions are executed by a transmitter.

### Claim 33 (depends on 19)

Data recording medium, wherein it comprises instructions for the execution of a traceable data encryption and/or decryption method as in claim 19, when said instructions are executed by a transmitter.

### Claim 34 (depends on 20)

Data recording medium, wherein it comprises instructions for the execution of a traceable data encryption and/or decryption method as in claim 20, when said instructions are executed by a transmitter.

### Claim 35 (depends on 21)

Data recording medium, wherein it comprises instructions for the execution of a traceable data encryption and/or decryption method as in claim 21, when said instructions are executed by a transmitter.
