# US 9,002,000 B2 · Method for conversion of a first encryption into a second encryption > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 9,002,000 B2 - Document ID: US9002000B2 - Status: Granted - Kind: B2 - Application number: 13/386,048 - Filed: 2010-07-21 - Published: 2012-12-20 - Granted: 2015-04-07 - Earliest claimed: 2009-07-23 - Assignees: Orange - Applicants: Yannick Seurin; Henri Gilbert - Inventors: Yannick Seurin; Henri Gilbert - Web page: https://patentgrep.com/patent/US9002000B2 ## CPC - 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 2209/08: Randomization, e.g. dummy operations or using noise - H04L 2209/34: Encoding or coding, e.g. Huffman coding or error correction - H04L 2209/76: Proxy, i.e. using intermediary entity to perform cryptographic operations - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) ## Abstract A method for converting, by means of a conversion entity, a first digit into a second digit, the first cipher corresponding to the result of a symmetric probabilistic encryption of an plain message element using a first secret matrix parameterized by a random vector, the second digit corresponding to the result of a symmetric probabilistic encryption of the plain message element using a second secret matrix that is parameterized by the random vector, characterized in that the method includes a step of: calculating the second digit by encrypting the first digit using a secret conversion matrix which is a function of the first and second secret matrices, and which is parameterized by the random vector. ## Claims ### Claim 1 A method comprising the steps: conversion by a conversion device of a first ciphertext into a second ciphertext, the first ciphertext corresponding to a result of a symmetrical probabilistic encryption of a plaintext message element by means of a product of a first secret matrix and of a random vector, the second ciphertext corresponding to a result of a symmetrical probabilistic encryption of the plaintext message element by means of a product of a second secret matrix and of the random vector; and calculation, by the conversion device, of the second ciphertext by encryption of the first ciphertext by means of a product of a secret conversion matrix, the secret conversion matrix being obtained by the conversion device from a confidence entity which calculates the conversion matrix by means of the first and second secret matrices respectively transmitted by the first and the second communication devices, said second secret matrix being different from the first secret matrix. ### Claim 2 (depends on 1) The method of conversion as claimed in claim 1, further comprising the steps: reception of the first ciphertext coupled with the random vector coming from a first communication device, transmission of the second ciphertext coupled with the random vector to a second communication device. ### Claim 3 (depends on 1) The method as claimed in claim 1, wherein the secret conversion matrix is calculated by an EXCLUSIVE OR operation between the first and the second secret matrices. ### Claim 4 (depends on 1) The method as claimed in claim 1, wherein the conversion matrix is a Toeplitz matrix. ### Claim 5 A conversion device comprising: a processing unit; a non-transitory memory for storage of a secret conversion matrix; and means for calculating the second ciphertext, designed to calculate the second ciphertext by encryption of the first received ciphertext by means of a product of the secret conversion matrix, said secret conversion matrix being obtained by the conversion device from a confidence entity which calculates the conversion matrix by means of the first and second secret matrices respectively transmitted by the first and the second communication devices, said second secret matrix being different from the first secret matrix; and means for converting a first ciphertext into a second ciphertext, the first ciphertext corresponding to a result of a symmetrical probabilistic encryption of a plaintext message element by means of a product of a first secret matrix and of a random vector, the second ciphertext corresponding to a result of a symmetrical probabilistic encryption of the plaintext message element by means of a product of a second secret matrix and of the random vector. ### Claim 6 (depends on 5) The conversion device as claimed in claim 5, further comprising: reception means designed to receive the first ciphertext coupled to a random vector, transmission means designed to send the second ciphertext coupled with the random vector. ### Claim 7 A conversion system comprising: a conversion device designed to convert the first ciphertext into the second ciphertext, the conversion device comprising a processing unit, a non-transitory memory for storage of a secret conversion key, and means for calculating the second ciphertext, wherein means are designed to calculate the second ciphertext by encryption of the first received ciphertext by means of a product of a secret conversion matrix being obtained by the conversion device from a confidence entity which calculates the conversion matrix by means of the first and second secret matrices respectively transmitted by the first and the second communication devices, said second secret matrix being different from the first secret matrix; and means for converting a first ciphertext into a second ciphertext, the first ciphertext corresponding to a result of a symmetrical probabilistic encryption of a plaintext message element by means of a product of a first secret matrix and of a random vector, the second ciphertext corresponding to a result of a symmetrical probabilistic encryption of the plaintext message element by means of a product of a second secret matrix and of the random vector; and a confidence entity designed to calculate the conversion matrix starting from the secret matrices. ### Claim 8 (depends on 1) A non-transitory computer program product designed to be installed in a non-transitory memory of an intermediate entity, comprising instructions for implementing the steps of the conversion method as claimed in claim 1, when the program is executed by a processor. ### Claim 9 (depends on 1) A non-transitory data media on which a computer program product designed to be installed in a non-transitory memory of an intermediate entity, comprising instructions for implementing the steps of the conversion method as claimed in claim 1, when the program is executed by a processor is recorded.