Method for encrypting and decrypting messages based on boolean matrices, and data communication system
AssigneeSony Corporation
InventorsMiodrag Mihaljevic, Ryuji Kohno
Life of this patent
Estimating the term…
Abstract
This invention provides a method for executing an improved Boolean matrices based encryption, and a data communication system. In a data communication system, a server generates a series of encrypted data message blocks C1, C2, . . . , Cn from plain data blocks P1, P2, . . . , Pn, by computing Ci=K(Pi+KVKi)Kn+i+KVKi. A client receives the encrypted data and generates a series of plain data message blocks P1, P2, . . . , Pn; by computing Pi=K−1(Ci+KVKi)K−(n+i)+KVKi.
Claims14
A method of encrypting a data message, comprising the steps of:
- (a) dividing a data message into a series of blocks P1, P2, . . . , Pn, wherein block number is n;
- (b) generating a series of encrypted data message blocks C1, C2, . . . , Cn;
- by computing the following equation,
- Ci=K(Pi+KVKi)Kn+1+KVKi
- K:
- Session key in form of an n×n binary matrix
- V:
- initial n×n binary matrix.
A method of decrypting an encrypted data message, comprising the steps of:
- (a) generating a series of plain data message blocks P1, P2, . . . , Pn;
- by computing the following equation,
- Pi=K−1(Ci+KVKi)K−(n+1)+KVKi.
- K:
- Session key in form of an n×n binary matrix
- V:
- initial n×n binary matrix
- K−1:
- inverse of K.
A data communication-system comprising a server device and a client device wherein:
- said server device comprises a data enciphering means which executes a process of dividing a data message into a series of blocks P1, P2, . . . , Pn, wherein block number is n;
- and a process of generating a series of encrypted data message blocks C1, C2, . . . , Cn;
- by computing the following equation,
- Ci=K(Pi+KVKi)Kn+i+KVKi
- K:
- Session key in form of an n×n binary matrix
- V:
- initial n×n binary matrix;
- Said client device comprises a data deciphering means which executes a process of generating a series of plain data message blocks P1, P2, . . . , Pn;
- by computing the following equation,
- Pi=K−1(Ci+KVKi)K−(n+i)+KVKi.
- K:
- Session key in form of an n×n binary matrix
- V:
- initial n×n binary matrix
- K−1:
- inverse of K.
Dependencies are inferred from the claim text.