System to secure encoding and mapping on elliptic curve cryptography (ECC)

Abstract

A system in Elliptic Curve Cryptography (ECC) that offers secure encoding and mapping of a message to the curve E against encryption attacks, such as Chosen Plaintext Attack (CPA) and Ciphertext Only Attack (COA). The system includes, a method to convert the text message to numerical values with manipulation using Initial Vector IV. In addition, the system provides, a method to revert the manipulated values to their original value.

Claims

1. A method for securing encoding and mapping in Elliptic Curve Cryptography (ECC) that is secured against several encryption attacks including chosen plaintext attack (CPA) and ciphertext only attack (COA), the method comprising: obtaining a plaintext message; dividing the plaintext message into a set of s characters, wherein a block size and a number of blocks is obtained from s; dividing the message to a set of blocks; encoding and manipulating each block with an initial vector (IV) to secure each block to obtain encoded and manipulated blocks; mapping the encoded and manipulated block to an elliptic curve (E) to obtain a first mapped point; XORing the next block with the first mapped point to obtain a next encoded and manipulated block then map it to the elliptic curve (E); repeating the XORing procedure between the next mapped points and the next encoded and manipulated blocks until all blocks have been secured and manipulated; encrypting the mapped points using a secret key to obtain encrypted points; decrypting the encrypted points using the secret key to obtain the mapped points; decoding the first mapped point by performing an XOR operation between the first block and the initial vector (IV); repeating the XORing procedure between the secured and manipulated block and each corresponding mapped point to produce the original nonmanipulated mapped points; converting the mapped points to binary values; and converting the binary values and grouping 8 bits of these values to convert to its corresponding character, wherein the plaintext message is all characters grouped in one set.

2. The method of claim 1, wherein dividing the message to the set of blocks comprises steps including: obtaining a size of prime number p in bit using an equation used for obtaining a block size (Bs), wherein the equation is BS=[(p−8)/8]; obtaining the block size based on the size of the prime number p; obtaining a the number of blocks based on the block size and the value of s; and grouping each set of characters presented in binary values to the set of blocks.

3. The method of claim 2, wherein the initial vector (IV) is obtained with the same size of the prime number p.

4. The method of claim 1, wherein mapping the encoded and manipulated blocks to the elliptic curve (E) includes converting the binary values to decimal values and mapping it to the elliptic curve (E) to obtain the mapped point.

5. The method of claim 1, wherein the mapped points are encrypted by performing an addition operation between the mapped points and the secret key.

6. The method of claim 1, wherein the encrypted points are decrypted by performing a subtraction operation between the encrypted points and the secret key.

7. A system to secure encoding and mapping in Elliptic Curve Cryptography (ECC) that is secured against several encryption attacks including chosen plaintext attack (CPA) and ciphertext only attack (COA), the system comprising: circuitry configured to: obtaining a plaintext message; dividing the plaintext message into a set of s characters, wherein a block size and a number of blocks is obtained from s; dividing the message to a set of blocks; encoding and manipulating each block with an initial vector (IV) to secure each block to obtain encoded and manipulated blocks; mapping the encoded and manipulated blocks to an elliptic curve (E) to obtain a first mapped points; XORing the next block with the first mapped point to obtain a next encoded and manipulated block then map it to the elliptic curve (E); repeating the XORing procedure between the next mapped points and the next encoded and manipulated blocks until all blocks have been secured and manipulated; encrypting the mapped points using a secret key to obtain encrypted points; decrypting the encrypted points by using the secret key to obtain the mapped points; decoding the first mapped point by performing an XOR operation between the first block and the initial vector (IV); repeating the XORing procedure between the secured and manipulated block and each corresponding mapped point to produce the original nonmanipulated mapped points; converting the mapped points to binary values; and converting the binary values and grouping 8 bits of these values to convert to its corresponding character, wherein the plaintext message is all characters grouped in one set.

8. The system of claim 7, wherein the circuitry is further configured to: obtain a size of prime number p in bit using an equation used for obtaining a block size (Bs), wherein the equation is BS=[(p−8)/8]; obtain the block size based on the size of the prime number p; obtain number of blocks based on the block size and the value of s; and group each set of characters presented in binary values to the set of blocks.

9. The system of claim 8, wherein the initial vector (IV) is obtained with the same size of the prime number p.

10. The system of claim 7, wherein the circuitry is further configured to convert the binary values to decimal values and map it to the elliptic curve (E) to obtain the mapped points.

11. The system of claim 7, wherein the circuitry is further configured to encrypt the mapped points by performing an addition operation between the mapped points and the secret key.

12. The system of claim 7, wherein the circuitry is further configured to decrypt the encrypted points by performing a subtraction operation between the encrypted points and the secret key.

Description

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

(1) FIG. 1 is a flowchart describes steps to secure messages by encoding and mapping the plaintext using ECC according to an embodiment of the invention.

(2) FIG. 2 is a diagram describes the step 102 in FIG. 1, the encoding and the converting of a plaintext to set of binary values and grouping them in a set of blocks B.sub.n.

(3) FIG. 3 is a diagram describes the step 104 in FIG. 1, the process of securing the set of blocks B.sub.n from FIG. 2, which results to set of secured blocks B′.sub.n. This figure described in algorithm 1.

(4) FIG. 4 is a diagram describes the step 106 in FIG. 1, the process of mapping phase which is the steps to convert the secured blocks values B′.sub.n from FIG. 3 to decimal values and map it to EC E which results to set of (x.sub.i, y.sub.i).

(5) FIG. 5 is a diagram describes the step 108 in FIG. 1, the encryption mechanism to convert the mapped points (x.sub.i, y.sub.i) from FIG. 4 to cipher text.

(6) FIG. 6 is a diagram describes the step 110 in FIG. 1, the reverse process of encryption step which is the decryption step to convert the cipher text from FIG. 5 to plain mapped points (x.sub.i, y.sub.i).

(7) FIG. 7 is a diagram describes the step 112 in FIG. 1, the decoding step to decode the x.sub.i value from FIG. 6 to set of binary values. This figure described in algorithm 2.

(8) FIG. 8 is a diagram describes the step 114 in FIG. 1, the steps needed to convert the binary value from FIG. 7 to the original message.

DETAILED DESCRIPTION OF THE INVENTION

(9) The inventor provides a secure encoding and mapping step in the ECC to enable the ciphertext to resist encryption attacks such as CPA and COA attacks. The present invention is described in enabling detail in the following examples, which may represent more than one embodiment of the present invention.

(10) FIG. 1 is a flowchart 100 describes the steps to secure messages by encrypting the plaintext using ECC according to an embodiment of the invention. Flowchart 100 is in this example a flowchart to enhance the ciphertext resistance to encryption attacks produced by ECC. Flowchart 100 has 7 steps, they are step 102, 104, 106, 108, 110, 112 and 114. These steps described as following, Step 102: System obtains a plaintext message M, and divide it to set of blocks {B.sub.1, B.sub.2, . . . , B.sub.n}, each size of block is based on the size of p. The detail process of this step depicted on FIG. 2. Step 104: The process of encoding and manipulating each block {B.sub.1, B.sub.2, . . . , B.sub.n} that produced from step 102, with Initial Vector IV and it result with set of manipulated blocks {B′.sub.1, B′.sub.2, . . . , B′.sub.n}. These blocks are secured and resisted the encryption attacks such as CPA and COA. These steps are described in details in FIG. 3.

(11) Step 106: The process of converting the blocks {B′.sub.1, B′.sub.2, . . . , B′.sub.n} to numerical values as ECC deals only with numbers. Thus, these blocks converted to numerical values to map them to ECC and secure them. Each numerical value is assigned to x.sub.i and then mapped to EC by finding the value of y.sub.i that satisfy the EC equation. The mapping to EC may need more than one rounds, therefore x.sub.i is multiplied by 31 to increase the number of rounds to 32. These steps are described in details in FIG. 4. Step 108: shows the encryption process by the addition+operation between the mapped points (x.sub.i, y.sub.i) from step 106 and the shared key S.sub.key which known only by the sender and the recipient. The addition operation results the encrypted points (C.sub.xi, C.sub.yi). These steps are described in details in FIG. 5.

(12) Step 110: shows the decryption process which is the reverse way of encryption. The step to decrypt the received points (C.sub.xi, C.sub.yi) is by subtract it from the shared S.sub.key. The result is the mapped points (x.sub.i, y.sub.i) that used to decode the message. These steps are described in details in FIG. 6. Step 112: shows the decoding process to convert the mapped points (x.sub.i, y.sub.i) to plaintext. This done by dividing the x.sub.i and converting it to its binary value. Following that, the first binary block is XORed ⊕ with the IV, while the rest of blocks are ⊕ with its previous x.sub.i value. These steps are described in details in FIG. 7. Step 114: shows the converting process of the binary values from previous step and group each 8 bits of these values to convert it to its corresponding character where the plaintext is all characters grouped in one set. These steps are described in details in FIG. 8.

(13) FIG. 2 is a diagram 200 describes the step 102 in FIG. 1, an encoding and a converting of a plaintext to set of binary values and grouping them in a set of blocks B.sub.n. Step 202: Obtain a plaintext message M. Step 204: Divide the M to set of {c.sub.1, c.sub.2, . . . , c.sub.s}. The value of s is the represented as the number of characters in the message M. Step 206: Obtain the size of the prime number p and obtain the block size B.sub.s by the equation

(14) $B_s=.Math.\frac{p-8}{8}.Math.$
and the number of blocks n that used to group the set of characters B.sub.s is calculated by

(15) $n=.Math.\frac{s}{B_S}.Math..$
Step 208: Group each set of characters (presented in binary values) {c.sub.1, c.sub.2, . . . , c.sub.B.sub.s}. to one group, the result is a set of blocks {B.sub.1, B.sub.2, . . . , B.sub.n}. The number of characters in one group is equal to B.sub.s.

(16) FIG. 3 is a diagram 300 describes the step 104 in FIG. 1, the process of securing the set of blocks B.sub.n from FIG. 2, which results to set of secured blocks B′.sub.n. Step 208: Obtain the set of blocks {B.sub.1, B.sub.2, . . . , B.sub.n} from the previous step (FIG. 2 step 208). Step 304: Obtain the random IV with same size of p and for each i={1, 2, . . . , n} obtain B.sub.i and ⊕ it with IV which results B′.sub.i. Then, map the B′.sub.i to the elliptic curve E which results B.sub.i.sup.m. Afterward, assign IV=B.sub.i.sup.n. Step 306: Each {B′.sub.1, B′.sub.2, . . . , B′.sub.n} are the secured encoded blocks that against several encryption attacks. The process of securing these blocks is described on algorithm 1. Step 308: is the mapping point process depicted in FIG. 4.

(17) TABLE-US-00001 Algorithm 1: Encoding message with IV algorithm Input: Blocks retrieved (B.sub.i) from message M and IV Output: Encoded blocks (B′.sub.i) with IV 1   for i = 0; i < no of blocks; i + +; 2 let B′.sub.i = B.sub.i ⊕ IV; 3 let B.sub.i.sup.m = map(B′.sub.i); 4 let IV = B.sub.i.sup.m; 5  Encoded message ← the set of B′.sub.i;

(18) FIG. 4 is a diagram 400 describes the step 106 in FIG. 1, the process of mapping phase which is the steps to convert the secured blocks values B′.sub.n from FIG. 3 to decimal values and map it to EC E which results to set of (x.sub.i, y.sub.i). Step 404: For each i={1, 2, . . . , n} obtain the B′.sub.i and convert it to the corresponding decimal value then assign it to x.sub.i to be used with mapping step. Step 406: Multiply each x.sub.i by 31 to limit the mapping rounds to 32 rounds. Step 408: Map each x.sub.i to EC using EC equation y.sup.2≡x.sup.3+a. x+b mod p and find y.sub.i. Step 409: If y.sub.i found then the point (x.sub.i, y.sub.i) is mapped, otherwise increase x.sub.i by 1 and repeat the process 32 times. Step 410: Each mapped points {(x.sub.i, y.sub.i), (x.sub.2, y.sub.2), . . . , (x.sub.i, y.sub.i)} are secure against encryption attacks such as CPA and COA.

(19) FIG. 5 is a diagram 500 describes the step 108 in FIG. 1, the encryption mechanism to convert the mapped points (x.sub.i, y.sub.i) from FIG. 4 to cipher text. Step 410: For each i={1, 2, . . . , n} retrieve the mapped points (x.sub.i, y.sub.i) from previous step. Step 504: Construct the secret key S.sub.key Elliptic Curve Diffie Helman (ECDH). Step 506: Perform the addition+operation between the mapped point (x.sub.i, y.sub.i) and the secret key S.sub.key. Step 508: The output is the ciphertext represented as points (C.sub.xi, C.sub.yi).

(20) FIG. 6 is a diagram 600 describes the step 110 in FIG. 1, the reverse process of encryption step which is the decryption step to convert the cipher text from FIG. 5 to plain mapped points (x.sub.i, y.sub.i). Step 508: For each i={1, 2, . . . , n} retrieve the ciphertext (C.sub.xi, C.sub.yi) of the mapped points from previous step. Step 504: Construct the secret key S.sub.key using ECDH. Step 606: Perform the subtract process between the ciphertext of the mapped points and secret key S.sub.key. Step 608: The output is the mapped points (x.sub.i, y.sub.i).

(21) FIG. 7 is a diagram 700 describes the step 112 in FIG. 1, the decoding step to decode the x.sub.i value from FIG. 6 to set of binary values. This figure described in algorithm 2. Step 702: For each i={1, 2, . . . , n} retrieve the x.sub.i from the mapped points (x.sub.i, y.sub.i) and assign the result to t.sub.i. Step 704: Divide the decimal value of x.sub.i by 31. Step 706: Convert the t.sub.i to binary value. Step 708: Retrieve the Initial Vector IV. Step 710: Perform the ⊕ process between the binary bits from step 706 and IV, then let IV=x.sub.i from step 702. Step 712: The output of step 710 is a group of bits represent the binary value of the message M.

(22) TABLE-US-00002 Algorithm 2: Decoding mapped points to message algorithm Input: Mapped points (B.sub.i.sup.m) and IV Output: Binary blocks of message 1   for i = 0; i < no of blocks; i + +; 2 let B′.sub.i = B.sub.i ⊕ IV; 3 let B.sub.i.sup.m = map(B′.sub.i); 4 let IV = B.sub.i.sup.m; 5  Encoded message ← the set of B′.sub.i;

(23) FIG. 8 is a diagram 800 describes the step 114 in FIG. 1, the steps needed to convert the binary value from FIG. 7 to the original message. Step 712: Retrieve the group of bits from previous step. Step 804: Convert each 8 bits to its corresponding ASCII code. Step 806: Aggregate each n characters to one block. Step 808: The output of step 806 is the original message M.

(24) It will be apparent to one with skill in the art that the securing method of the encoding and the mapping on ECC of the invention may be provided using some or all of the mentioned features and components without departing from the spirit and scope of the present invention. It will also be apparent to the skilled artisan that the embodiments described above are specific examples of a single broader invention which may have greater scope than any of the singular descriptions taught. There may be many alterations made in the descriptions without departing from the spirit and scope of the present invention.