AUTHENTICAL MESSAGE OF USING ELLIPTICAL

CURVE DIGITAL SIGNATURE ALGORITHM

Aulia Rahman Dalimunthe1, Hanna Willa Dhany2

1
Informatics Engineering Study Program Magister
Faculty of Computer Science and Information Technology
University of Sumatera Utara

E-mail: auliarahmandalimunthe@students.usu.ac.id | @usu.ac.id

hanna.willa.dhany@students.usu.ac.id | @usu.ac.id

Abstract. In the case of ata safety context always connected with cryptography is the science
learning about mathematics technique which coherence with information safety. In sending
message, safety asfect is very important because thre ae so many tappings and data exchange
by the irresponsible. The problem can cause the change of delivery message. To validate the
original message or unchanged message so the message must be put the digital signature. By
the digital signature therefore integrated data is assured. One of methods used for digital
signature is ECDSA (Elliptical Curve Digital Signature Algorithm) which operates with a
group of elliptical curve as basic culculation. This research is only applied to send text
messsage for email. Therefore, the result of research is a kind of application enable to send text
message and verify it.
Keywords : Chryptography, Digital Signature, ECDSA, Elliptical Curve.

I. Preface
In changing data always occurs tapping and changing data which taken by irresponsible man. In text
delivery by email is strickly needed safety to keep the original data.
In context of data safety always coherence with Cryptography. Cryptography is a science which
learning mathematics tecnique which is related with confidentialty, safety of data informaion, integraty
data an authentication. So the origin of data can be secured.
The approval of authentic document is not as basic safety service. Because on every data delivery
must have disturbance as tapping and change the sending data. One of offered methods in
authentication concept is digital signature. Digital signature given to a kind of data enable to validate
the origin of data. The digial signature value is usully different and it depends on the kind of data
signed.
The digital signature applies the cryptography asimetric theory. Asimetric cryptography is a kind
of cryptography uses the concept describing the data with different key.

II. Problems Identification

The increasing of data exchange occurs each day makes the confidentiality of a data become an
important isues. Therefore, the formulas of research needs to solve the tapping and changing data in
delivery data by using digital signature as authentically original data.

III. Previous Research

In the last a few years, cryptography or digital signature has also been applied for multi purpose.
Cryptography can be used to explore and analize safety data to find the pattern and meaningful rule[2].
One of better things of ECDSA algorithm is the solving problem of basic algorithm ECC done in
full exponend and more difficult to be solved than DSA and RSA[3].
The following are researches related with cryptography data or ECDSA:
1. The usage of ECDSA algorithm (Ellptical Curve Digital Signature Algorithm) to sign Digital
Chipertext ElGamal Elliptic Curve Cryptography[4].
2. Implement of Elliptical Curve Digital Signature Algorithm[5].
3. Implement of Algorithm ECDSA for email safety (Original Message Verification)[2]
4. The comparasion of Basic Elliptic Curve Cryptography Algorithm with RSA and DSA for
digital signature[3]
5. Elliptic Curve Digital Signature Algorithm[6]
On this paper, the writer made digital signature by using ECDSA method on email text.

IV. RESULTS AND DISCUSSION

A. Formation Process Parameters ECC
The parameters of the ECC:
1. Determination of p-value, where the value of p is a prime number with the proviso p> 3.
2. Determining the value of a and b is done by selecting a value on the condition a, b € p.
coefficients a and b determine the elliptic curve E (F p) which satisfies the equation y2 = x3 + ax
+ b (mod p), both located on the interval [0, p-1] and meet 4A3 + 27b2 ≠ 0 (mod p).
3. Determination of the G spot is done by taking the coordinate point on the elliptic curve E (F p),
where G = (XG, YG), XG and YG is an integer in the interval [0, p-1].
4. Determination of the value of n is done by selecting a value primes so n.G = O, where O is the
point of infinity.
Determining the value of the condition primes p p> 3 to F p.
In determining prime numbers is done by selecting any value, eg the value taken primes 23, p
= 23. Perform the test on the value of p is already determined whether a prime number or not by
the UN or take the value of the greatest common divisor n = 2. Tests conducted using np - 1 = 1
(mod p) = 223-1 = 8388608-1 = 8388607 = 1 (mod 23). Then 23 is a prime number because it is
not divisible, so that the value of p = 23.
Determining the value of a, b and elliptic curve equation.
Elliptic curve equation y2 = x3 + ax + b (mod p) and values of a, b is determined by the terms
of a, b € p. Suppose the value of a = 1, b = 4 and p = 23, equation elliptic curve becomes:
y2 = x3 + x + 4 (mod 23)
= 4A3 + 27b2 ≠ 0 (mod p)
= 4:13 + 27.42 ≠ 0 (mod 23)
= 436 ≠ 0 (mod 23)
= 22 ≠ 0 (mod 23)
Terms of the elliptic curve equation is met for 22 ≠ 0 (mod 23).
Determining the value of G and n
Prior to determining the value of G and n first determining the elliptic curve group E on F p. In
determining the elliptic curve group is done by using the value p such that fp = {0, 1, 2, 3 ... .. p-1}.
P = 23 then fp= {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22}. Once
the value of the elliptic group has been created, it is now decisive elements of the elliptic curve E p
(a, b), first seek quadratic residue modulo p (QR p). In search of QRp note values in Table 3.1 to
determine the value of a = 1, b = 4 and p = 23.
Search the value of module quadratic p (QRp) used counting QRp = Y2 (mod p), f0 = 0, f1 = 1, f2
= 4, f3 = 9, f4 = 16, f5 = 2, f6 = 13, f7 = 3, f8 = 18, f9 = 12, f10 = 8, f11 = 6, f12 = 6, f13 = 8, f14 = 12, f15 =
18, f16 = 3, f17 = 13, f18 = 2, f19 = 16, f20 = 9, f21 = 4, f22 = 1.
According counting QRp = Y2 (mod p) can conclude the set of quadratic residue modulo 23 is
QR23 = {0, 1, 2, 3, 4, 6, 8, 9, 12, 13, 16, 18}. From the results above QR 23 E23 elliptical group
element (1.4) can be determined by the equation = x3 + x + 4 (mod 23), for x € F23 and y2 € QR23.
Table 1 Element E23 (1,4)

x€ y2 = x3 + x + y2 €
(x,y)x € E23 (1,4)
F23 4 (mod 23) QR23
0 4 Yes (0,2) and (0,21)
1 6 Yes (1,11) and (1,12)
2 14 No -
3 11 No -
4 3 Yes (4,7) and (4,16)
5 19 No -
6 19 No -
7 9 Yes (7,3) and (7,20)
8 18 Yes (8,8) and (8,15)
9 6 Yes (9,11) and (9.12)
10 2 Yes (10,5) and (10,18)
11 12 Yes (11,9) and (11,14)
12 19 No -
13 6 Yes (13,11) and (13,12)
14 2 Yes (14,5) and (14,18)
15 13 Yes (15,6) and (15,17)
16 22 No -
17 12 Yes (17,9) and (17,14)
18 12 Yes (18,9) and (18,14)
19 5 No -
20 20 No -
21 17 No -
22 2 Yes (22,5) and (22,18)

According to the table 1 for the value x = 0, then we obtain y2 = 03 + 1.0 + 4 = 4 in order to
obtain the value of y = 2, y = 21. Because based on table 3.1 above 2 2 (mod 23) = 4, and 212 (mod
23) = 4. The calculation of the value of x and y is then performed in the same manner. So we get
the elliptic group elements modulo 23 to the F 23, namely:
F23 (1,4) = {(0,2), (0,21), (1,11), (1,12), (4,7), (4,16), (7,3), (7,20), (8,8), (8,15), (9,11), (9,12),
(10,5), (10,18), (11,9), (11,14), (13,11), (13,12), (14,5), (14,18), (15,6), (15,17), (17,9), (17,14),
(18,9), (18,14), (22,5), (22,18)}.
Determining the value of G is determined randomly in the elliptic group F 23 (1.4). Suppose the
selected point (0,2), then the value G = (0,2). Determining the value of n is done by finding the
value of the order of point G that has been specified by the condition n.G = O, where O is the point
of infinity. Infinity point it was not until the point where the P + - P = O, -P = (xp, -yp) so that O =
(0,0). In summation point on the elliptic curve used arithmetic operations as addition, subtraction,
multiplication and inverse. The arithmetic operations are defined as follows:
1. The additions (addtion): If a, b € Fp then a + b = r, where r is the remainder of the division
when a + b divided by p and 0 ≤ r ≤ p-1. This operation is known to the addition operation
modulo p.
2. Operation reduction (subraction): If a, b € F p then the a-b = r, where r is the remainder when
divided by p when the a-b> 0, whereas when the a-b <0 then r is (a-b) + p. This operation is
known as a reduction operation with modulo p.
3. The operation of multiplication (multiplication): If a, b € F p then a.b = s, where s is the rest of
the division when a.b divided by p and 0 ≤ s ≤ p. This operation is known as multiplication
operation modulo p.
 4. Inverse (inversion): If a is not zero in F p element, then the inverse of a modulo p, expressed as
a symbol of a-1 is a unique integer c € Fp with a.c = 1 mod p.
In addition and doubling two points in an elliptic curve has the following rules:
1. The sum of the point (point addition) : P = (x1, y1) € EP and Q = (x2, y2) € EP where P ≠ Q.
Then P + Q = (x3, y3), where in:
x3 = λ2 – x1 – x2
y3 = λ (x1 – x3) – y1
where
λ = (y2 – y1) / (x2 – x1)
2. Doubling the two points (point doublings): P = (x1, y1) € Ep where P ≠ -P. Then 2P = (x3, y3):
x3 = λ2 – 2x1
y3 = λ (x1 – x3) – y1
where
λ = ( 3x12 + a ) / 2y1 [Hankerson].
By using the arithmetic operations can be determined the value of doubling 2G point to see the
point of infinity.
2G = (13,12), 3G = (11,9), 4G = (1,12), 5G = (7,20), 6G = (9,11), 7G = (15,6), 8G = (14,5),
9G = (4,7), 10G = (22,5), 11G = (10,5), 12G = (17,9), 13G = (8,15), 14G = (18,9), 15G = (18,14),
16G = (8,8), 17G = (17,14), 18G = (10,18), 19G = (22,18), 20G = (4,16), 21G = (14,18), 22G =
(15,17), 23G = (9,12), 24G = (7,3), 25G = (1,11), 26G = (11,14), 27G = (13,11), 28G = (0,21),
29G = O.
From these results, the known value of n is 29, for generating a point value infinity. The value
of 2G = (13,12) is determined by multiplying the point G.
G = (0,2), 2G = (x3, y3)
λ = ( 3.02 + 1 ) / 2.2 x3 = λ2 – 2x1 y3 = λ (x1 – x3) – y1
= 1 / 4 mod 23 = 62 – 2.0 mod 23 = 6 (0 – 13) – 2
= 1.4-1 mod 23 = 36 – 0 mod 23 = -78 – 2 mod 23
= 1.6 mod 23 = 36 mod 23 = -80 mod 23
= 6 mod 23 = 13 = 12
=6
So the point of 2G = (13.12). And to determine the point of 3G can be done by 2G + G, 2G + 3G =
G, 2G = (13,12), G = (0,2), 3G = (x3, y3).
λ = (y2 – y1) / (x2 –x1) x3 = λ2 – x1 x2 y3 = λ (x1 – x3) – y1
= (12-2) / (13-0) = 222 – 0 – 13 = 22 (0 – 11) – 2
= 10 / 13 mod 23 = 471 mod 23 = -244 mod 23
= 10.13-1 mod 23 = 11 =9
= 22
So the point of 3G = (11.9). For further calculations in the same way to get the point of infinity
n.G = (0,0). The parameters of the elliptic curve has been determined by the equation of the curve
y2 = x3 + x + 4 which produces the value a = 1, b = 4, p = 23, G = (0.2), n = 29.

B. Process ECDSA
In the process of ECDSA there are three stages : the establishment of a public key and a private
key, the process of signing (giving signatures) and the process of verifying (verifying digital
signatures).
The process of forming a private key and a public key = dA = QA performed by the following
steps:
1. Choose a random integer value between (1, n-1) = dA, for example 14, so the value dA = 14.
2. Calculate QA = dA.G = 14 (0.2) = (18.9) so the value of QA = (18.9).
3. dA = 14, QA = (18.9)
 Signing Process (Giving Signatures)
In this process will be result signature message (r, s). In the stage there are several processes
performed include:
1. Choose a random number k whose value between (1, n-1)
2. Calculate QA = k G = (x1, y1) and r = x1 mod n, if r = 0, then go back to step 1.
3. Calculate k-1 mod n
4. Calculate e = Hash (m)
5. Calculate s = k-1 (e + (dA. R)) mod n
The signature for the message m is (r, s).
After curve elpitik parameter determined the output value p = 23, a = 1, b = 4, G = (0.2), n =
29 and a private key dA = 14, the public key QA = (18.9) message m = worldof. Signing process
is as follows:
1. Determine the k value between (1-28) is k = 7
2. Calculate k G = 7 (0,2) = (15.6), then the value of r = 15
3. Calculate k-1 mod n = 7-1 mod 29 = 7.25 = 1 mod 29
4. Calculate e = HASH (worldof) = 1,789,679,805 using SHA-1 (m) and converts it to an integer
5. Calculate s = k-1 (e + dA.r) mod n = 25 (1789679805 + (14.15)) mod 29 = 25 (1789680015) =
44742000375 mod 29 = 4
The signature for the message m is (15.4)
Verifying Process (The Signature Verification)
The verification process is a process to determine the signature is native or not native and have
some steps such as:
1. Verify that r and s are integers between (1, n-1)
2. Calculate e = Hash (m)
3. Calculate w = s -1 mod n
4. Calculate u1 = ew mod n and u2 = rw mod n
5. Calculate u1.G + u2.QA = (x1, y1)
6. Calculate v = x1 mod n
7. Accept the signature if and only if v = r
If the values of r and s is known then the signature verification process is carried out as follows:
1. r = 15, s = 4 is an integer between (1-28). (Valid)
2. Calculate e = HASH (worldof) = 1,789,679,805 using SHA-1 (m) and converts it to an integer
3. Calculate w = s -1 mod n = 4-1 mod 29 = 4.22 = 1 mod 29, then w = 22
4. Calculate u1 = ew mod n = 1789679805.22 39,372,955,710 mod mod 29 = 29 = 27 and u2 = rw
15:22 mod mod n = 330 mod 29 = 29 = 11
5. Calculate u1.G + u2.QA = 27 (0.2) + 11 (18.9) = (13.11) + (4.7) = (15.6)
6. Calculate v = x1 mod n = 15 mod 29 = 15, the signature is received for r = 15, y = 15, y = r

C. Testing System
To send the message, the user must enter into the compose feature by clicking the Compose
features in the home page. Users have to fill in the destination email address, subject and message
to be sent. Here compose page views.
 After clicking the send button the email, the system will continue to display the message by
using the hash SHA-1 hash, the message to be sent is the "experimental message
authentication with ECDSA" has a SHA-1 hash.
55407a6c48592ff0d99dac55526ce6b413f03124
 Then the result of the SHA-1 hash message is converted into an integer and produces E
4439501168844554851007772095622973658570018677101868544626647885986774255905
07651397216923365940.0000000000
 After which the system will process the results of an integer from the message hash and
generate the signature (r, s)
 (4111385755471869119846890053857612538322676216602056968618),(334240353640598
1729393488334694600415596881826869351677613).
 After clicking on the Send button, the email verification email sent will be displayed.
 After sending the message then the user must enter into the system with a user id that sent the
message to view and verify the message. The following pages display the inbox of the user
who receives the message sent.
 To verify that the message already changed or not the user must click on the check button to
perform the verification process. If the message has been no change in the delivery of the
zoom as follows.
 If there is a change in message delivery verification message it did not succeed, because the
value of the signature will change and not the same as the value of the time signature delivery.
V. Conclusions And Suggestions
A. Conclusion
Based on the discussion and the tests performed can be obtained several conclusions:
1. Data that is encrypted with the Elliptical Curve Digital Signature Algorithm protected from
eavesdropping in the process of sending messages.
2. Signature helps the recipient to verify more accurate in receiving messages from the sender of
the message.
3. Verify that one concludes that the manipulation of the received message.
B. Suggestions
The system is built based on the flow of the writer, then for better results and maximum required
advice from any party to supplement the existing deficiencies. The author suggests the
development of further research to authenticate the message as follows:
1. This application can be developed to create a message authentication using binary curve field.
2. These applications can be developed using a better algorithm than ECDSA in anticipation of
attacks by certain parties.

REFERENCES
[1] Liao, H.-Z. & Shen, Y.-Y. 2006. On the Elliptic Curve Digital Signature Algorithm. Tunghai
Science vol. 8: 109-126.
[2] The joints, P. A. P., Winarno, I. S.ST. M.Kom. & Rosyid, N. M. Kom. M.Kom. 2010.
Implementation of ECDSA Algorithm To Safeguard E-mail (Authenticity Verification
Message). Electronic Engineering Polytechnic Institute of Surabaya Institute of Technology.
Surabaya.
[3] Wizanajani, D. R. 2013. Comparison Algorithm Based on Elliptic Curve Cryptography with RSA
and DSA Digital Signature. Information Engineering Institute of Technology Bandung.
Bandung.
[4] Adam, W. 2009. The use of algorithms ECDSA (Elliptic Curve Digital Signature Algorithm) for
Digital Signing ElGamal ciphertext Elliptic Curve Cryptography. Computer Science. Veteran
National Development University Jakarta. Jakarta.
[5] Khalique, A., Singh, K. & Sood, S. 2010. Implementation of Elliptical Curve Digital Signature
Algorithm. International Journal of Computer Applications (0975-8887).
[6] Triwinarko, A. 2010. Elliptic Curve Digital Signature Algorithm. Bandung Institute of
Technology. Bandung.
[7] Hankerson, D., Menezes, A. & Vanstone, S. 2004. Guide to Ellpitic Curve Cryptography.
Springer-Verlag: New York.
[8] Munir, Rinaldi., 2006, Cryptography, Bandung: Publisher Information.
[9] Silviana, L. 2013. Digital Signature System On Text Messages Using RSA Public Key Algorithm.
Essay. University of Northern Sumatra.
[10] Kiros, T. & Raimond, K. 2009. An Efficient Modified Elliptical Curve Digital Signature
Algorithm. Journal of EAA, vol.26.