Professional Documents
Culture Documents
ISSN:2320-0790
I.
Introduction:
In the year, 1985 Victor Miller and Neal
Koblitz first introduced the Elliptic curve
cryptography. Elliptic curve cryptography has
proven its security by with standing to a
generation of attacks. In the recent years, as
the wireless communication has grown
rapidly, the numerous companies have adopted
Elliptic curve cryptography as an innovative
security technology. Elliptic curve employs a
relatively short encryption key and the shorter
key size is faster and requires less compelling
power than the other. Elliptic curve
cryptography encryption key provides the
same security as 1024-bit RSA encryption
key [1][2][3][4][8].
In general, cubic equations for elliptic curves
take the following form, known as Weierstrass
equation[5]:
4 g 3 27h 2 0[4][5].
II.
y 2 gxy hy x 3 ix 2 jx k
Where g,h,i,j,k are real numbers and x,y take
on values in the real numbers. For our purpose,
it is sufficient to limit ourselves to equations of
the form y x gx h
2
1548
COMPUSOFT, An international journal of advanced computer technology, 4 (3), March-2015 (Volume-IV, Issue-III)
IV.
Adjacency matrix:
Let G (V , E ) be a simple directed graph
1 if (vi , v j ) E
A [aij ]nn
otherwise
0
The adjacency matrix is a Boolean matrix as
the entries are 0s or 1s.
The number elements in the ith row whose
value is 1 in a column, say the jth column, is
equal to the indegree of the node vj. an
adjacency matrix completely defines a simple
digraph.
1549
COMPUSOFT, An international journal of advanced computer technology, 4 (3), March-2015 (Volume-IV, Issue-III)
0
1
B
1
1
0
1
1
1
1
0
1
1
1
1
f : A B by f (nP) xn
Where
n=1,2255
and
{x1 , x 2 , x3 ,...........x 255} are the ASCII characters.
Step 8: To create 4 4 matrix with entries
are the points on the elliptic curve.
a1 a 2 a3 a 4
a5 a 6 a 7 a8 and so on
m1
a
a10 a11 a12
9
V.
PROPOSED ALGORITHM:
Alice wants to send the message to Bob using
elliptic curve ElGamal encryption by using
adjacent matrix. Alice chooses the elliptic
q k 1 q k adjency matrix
output at qk 1 state.
R {q1 ( x1 , y1 ), q2 ( x2 , y 2 ), q3 ( x3 , y3 )...........qi ( xi , yi )
where i=1,2,3
Bob
should do following:
Step 1: First Bob selects the Alice public key
A=aG.
Step 2: Compute bA=b(aG)=m.
Step 3: Now Bob computes the inverse
element of b(aG) is - b(aG).
Step 4: Add - b(aG)to the second part of the
message: qi kbG abG abG = qi kbG
B bG.
Step 4: Compute kB k (bG) l.
Step 5: Compute aB a(bG) m.
Step 6: Alice wants to send the message q i to
Bob.
Step 7: Alice wants to convert the message
into the points on the elliptic curve. She
chooses a point Q, which is the generator of
the elliptic curve. By using ASCII characters
of upper case letter into the points on the
elliptic curve.
A {1P,2 P,3P................255P}
Let
B {set of all ASCII characters }
1550
COMPUSOFT, An international journal of advanced computer technology, 4 (3), March-2015 (Volume-IV, Issue-III)
q
S1 5
q
9
q
13
q2
q6
q10
q14
q3
q7
q11
q15
q4
q8
,....
q12
q16
Step 9: Bob selects m, wheres is the xcoordinate of m which is the secret key and the
binary values is input key.
Step 10: Now Bob multiplies q i with inverse
of key matrices R and Bob applies the
reverse process and by using ASCII characters
of upper case letters, he can recover the
message.
N 78(172,240) (69,18),
T 84(172,240) (126,260),
E 69(172,240) (225 , 189),
EXAMPLE:
Alice wants to send the message to Bob using
elliptic curve ElGamal encryption by using
adjacency matrix. Alice chooses the elliptic
R 82(172,240) (168,235),
N 78(172,240) (69,18),
A 65(172,240) (64,246),
T 84(172,240) (126,260),
I 73(172,240) (183 , 38),
O 81(172,240) (93,5),
N 78(172,240) (69,18),
A 65(172,240) (64,246),
L 76(172,240) (120 , 261),
1 61(172,240) (97,235),
2 62(172,240) (55,93),
3 63(172,240) (256,259).
..................................
..(264, 174), (269,114), (269,157)}.
The number of points on the elliptic curve is
271 and the prime number is 271. Therefore
each point is a generator of an elliptic curve
E[9][10][11].
Choose the point G=(68,136) on the elliptic
curve. Alice selects a private key a=6, and
generates the public key
A=aG =
6(68,136)= (85, 199) and Bob selects a
private key b=8, and generates the public
key B= bG = 8(68,136)= (122 , 259).
Encryption:
Step 1: Alice chooses a random integer k =4,
and keeps it secret.
Step 2: Compute kG= 4(68,136)= (250 ,
189).
Step 3: Alice selects the Bobs public key
B=bG= (122, 259).
1551
COMPUSOFT, An international journal of advanced computer technology, 4 (3), March-2015 (Volume-IV, Issue-III)
S.
No
I/P
Previous
State
Preset
State
O/P
Cipher text
q0
q1
q1
q3
q3
q2
q2
q1
(122,12)
(1,214)
(120,10)
(139,33)
(230,198) (207,73) (228,200) (208,95)
(151,71) (35,253)
(
17
,
64
)
(
56
,
2
)
(38,111)
(133,176) (168,36) (225,82)
(161,31)
(67,82) (109,244) (168,36)
q1
q2
q2
q1
(43,10)
(28,214) (134,220)
(228,71)
(13,5)
(212,199) (67,189) (40,168)
q1
q3
n=
O/P+1
1552
COMPUSOFT, An international journal of advanced computer technology, 4 (3), March-2015 (Volume-IV, Issue-III)
q3
q3
(1,57)
(120,261)
(139,238) (122,259)
(80,211) (150,49) (69,253)
(60,3)
(51,45)
(
237
,
23
)
(
135
,
222
)
(
235
,
43
)
References:
to Bob.
Decryption:
Bob applies the reverse process and recovers
the message INTERNATIONAL123.
VI.
Conclusions:
In the proposed work, the plain text is
converted to points on the elliptic curve by one
to one correspondence using ASCII characters.
1553
COMPUSOFT, An international journal of advanced computer technology, 4 (3), March-2015 (Volume-IV, Issue-III)
[11]
[12]
1554