See

discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/272681736

Example of cryptography over the ring

$mathbbF_3^d[varepsilon],varepsilon^2=0$

Article · January 2012

CITATIONS READS

0 14

2 authors:

Moulay Hachem Hassib Abdelhakim Chillali

8 PUBLICATIONS 4 CITATIONS Université Sidi Mohamed Ben Abdellah
32 PUBLICATIONS 49 CITATIONS
SEE PROFILE

SEE PROFILE

All in-text references underlined in blue are linked to publications on ResearchGate, Available from: Moulay Hachem Hassib
letting you access and read them immediately. Retrieved on: 29 October 2016
 Latest Trends in Applied Informatics and Computing

Example of cryptography over the ring F3d [ε], ε2 = 0

Hassib My Hachem Chillali Abdelhakim

FST FST OF FEZ
Department of Mathematics Department of Mathematics and Compter
FEZ
Morocco Morocco
hachem71@gmail.com chil2015@yahoo.fr

Abstract: In this work we will present an example of cryptography on an elliptic curve defined over the ring
F3d [ε], ε2 = 0.

Key–Words: Elliptic curve, ring, finite ring, finite field, public key, cryptography

1 Introduction Y3 = Y1 2 Y2 2 + 2a2 X1 2 X2 2 + a2 bX1 Z1 Z2 2 +

Let d be an integer. We consider the quotient ring
A = F3d [X]/(X 2 ), where F3d is the finite field of
order 3d . Then the ring A is identified to the ring
F3d [ε], ε2 = 0 :
a2 bX2 Z1 2 Z2
Z3 = aX1 X2 (Y1 Z2 + Y2 Z1 ) + a(X1 Y2 +
X2 Y1 )(X1 Z2 + X2 Z1 ) + Y1 Y2 (Y1 Z2 + Y2 Z1 )

A = {a0 + a1 ε | a0 , a1 ∈ F3d }([1], [2], [3]). 2) If [π(X1 ) : π(Y1 ) : π(Z1 )] 6= [π(X2 ) : π(Y2 ) :
π(Z2 )] then :
We consider the elliptic curve over the ring A which
is given by the equation:
X3 = 2X1 Y2 Y1 Z2 + X1 Y2 2 Z1 + 2X2 Y1 2 Z2 +
2 3 2
Y Z = X + aX Z + bZ , 3 X2 Y1 Y2 Z1 + 2aX1 2 X2 Z2 + aX1 X2 2 Z1

where a, b ∈ A and −a3 b is invertible in A. Y3 = 2Y1 2 Y2 Z2 + Y1 Y2 2 Z1 + 2aX1 X2 Y1 Z2 +

We denote the elliptic curve over A by Ea,b (A), aX1 X2 Y2 Z1 + 2aX1 2 Y2 Z2 + aX2 2 Y1 Z1
and we write:
Z3 = 2Y1 2 Z2 2 +Y2 2 Z1 2 +aX1 2 Z2 2 +2aX2 2 Z1 2
Ea,b (A) = {[X : Y : Z] ∈ P2 (A) | Y 2 Z = X 3 +aX 2 Z+bZ 3 }
Proof: By using the explicit formulas in W.Bosma
We consider the canonical projection π defined and H.W. Lenstra’s article [4, p.236 to 238] we prove
by: the theorem. t
u
π : F3d [ε] −→ F3d Remark 2 (Ea,b (A), +) is an abelian group with [0 :
x0 + x1 ε −→ x0 1 : 0] as identity element.

Theorem 1 Let P = [X1 : Y1 : Z1 ] and

Q = [X2 : Y2 : Z2 ] two points in Ea,b (A), 2 Example
and
P + Q = [X3 : Y3 : Z3 ]. Let a = 2 + α + ε and b = 1 + αε, where
α is a root in F9 of the irreducible polynomial
1) If [π(X1 ) : π(Y1 ) : π(Z1 )] = [π(X2 ) : π(Y2 ) : P (X) = X 2 + 2X + 2 in F3 ; then
π(Z2 )] then : F9 = F3 /(P (X)) = F3 [α], so:

F9 = {0, 1, 2, α, α + 1, α + 2, 2α, 2α + 1, 2α + 2}
X3 = Y1 Y22 X1 + Y1 2 Y2 X2 + 2aX1 2 X2 Y2 +
2aX1 X2 2 Y1 + 2Z1 Z2 2 abY1 + 2Z1 2 Z2 abY2 The elliptic curve Ea,b (F9 [ε]) have 126 elements:
Ea,b (F9 [ε]) = {[0 : 1 : 0], [0 : 1 + 2αε : 1], [0 : 2 + αε : 1], [1 : α + 2αε :

ISBN: 978-1-61804-130-2 71
 Latest Trends in Applied Informatics and Computing

1], [1 : 2α + αε : 1], [ε : 1 : 0], [ε : 1 + 2αε : 1], [ε : 2 + αε : 1], [(α + 1)ε : 1 : 3 Cryptographic application
0], [(α + 1)ε : 1 + 2αε : 1], [(α + 1)ε : 2 + αε : 1], [(α + 2)ε : 1 : 0], [(α + 2)ε :

1 + 2αε : 1], [(α + 2)ε : 2 + αε : 1], [(2α + 1)ε : 1 : 0], [(2α + 1)ε : 1 + 2αε : We will give a code to each element Q = mP ∈ G
1], [(2α + 1)ε : 2 + αε : 1], [(2α + 2)ε : 1 : 0], [(2α + 2)ε : 1 + 2αε : where m ∈ {1, . . . , 42} defined as it follows:
1], [(2α + 2)ε : 2 + αε : 1], [αε : 1 : 0], [αε : 1 + 2αε : 1], [αε : 2 + αε : if Q = [x0 + x1 ε : y0 + y1 ε : z0 ] where
1], [2ε : 1 : 0], [2ε : 1+2αε : 1], [2ε : 2+αε : 1], [2αε : 1 : 0], [2αε : 1+2αε : x0 , x1 , y0 , y1 , z0 ∈ F9 and z0 = 0 or 1. And since
1], [2αε : 2 + αε : 1], [1 + ε : α + (α + 2)ε : 1], [1 + ε : 2α + (2α + 1)ε : (1, α) is a base of the vector space F9 over F3 so:
1], [1 + 2ε : α + ε : 1], [1 + 2ε : 2α + 2ε : 1], [1 + (α + 1)ε : α + (2α + 1)ε : x0 = c0 + c1 α
1], [1 + (α + 1)ε : 2α + (α + 2)ε : 1], [1 + (α + 2)ε : α + αε : 1], [1 + (α + 2)ε : x1 = c2 + c3 α
2α + 2αε : 1], [1 + (2α + 1)ε : 2α : 1], [1 + (2α + 1)ε : α : 1], [1 + (2α + 2)ε : y0 = c4 + c5 α
α+(2α+2)ε : 1], [1+(2α+2)ε : 2α+(α+1)ε : 1], [1+αε : α+2ε : 1], [1+αε : y1 = c6 + c7 α,
2α + ε : 1], [1 + 2αε : α + (α + 1)ε : 1], [1 + 2αε : 2α + (2α + 2)ε : 1], [α + 1 : where ci ∈ F3 for all i = 0 . . . 7. Then we code Q as
α + (α + 1)ε : 1], [α + 1 : 2α + (2α + 2)ε : 1], [α + 2 : α + (α + 2)ε : 1], [α + 2 : it follows:
2α + (2α + 1)ε : 1], [α + ε : α + 1 + (α + 2)ε : 1], [α + ε : 2α + 2 + (2α + 1)ε :
If z0 = 0, then: Q = c0 c1 c2 c3 c4 c5 c6 c7 0.
1], [α + 2ε : α + 1 + ε : 1], [α + 2ε : 2α + 2 + 2ε : 1], [α + (α + 1)ε :

α + 1 + (2α + 1)ε : 1], [α + (α + 1)ε : 2α + 2 + (α + 2)ε : 1], [α + (α + 2)ε : If z0 = 1, then: Q = c0 c1 c2 c3 c4 c5 c6 c7 1. We also

α + 1 + αε : 1], [α + (α + 2)ε : 2α + 2 + 2αε : 1], [α + (2α + 1)ε : α + 1 : attach any element Q ∈ G with a letter of the alphabet
1], [α + (2α + 1)ε : 2α + 2 : 1], [α + (2α + 2)ε : α + 1 + (2α + 2)ε : or a punctuation sign and we assemble the results in
1], [α + (2α + 2)ε : 2α + 2 + (α + 1)ε : 1], [α + αε : α + 1 + 2ε : 1], [α + αε : the following table:
2α + 2 + ε : 1], [α + 2αε : α + 1 + (α + 1)ε : 1], [α + 2αε : 2α + 2 + (2α + 2)ε :

1], [2α + 1 : 1 + ε : 1], [2α + 1 : 2 + 2ε : 1], [2 + ε + α : α + 2ε : 1], [2 + ε + α :

3.1 Table of codes
2α + ε : 1], [α + 1 + ε : α + (α + 2)ε : 1], [α + 1 + ε : 2α + (2α + 1)ε :
m mP code of mP Symbol
1], [α + 1 + 2ε : α + αε : 1], [α + 1 + 2ε : 2α + 2αε : 1], [α + 1 + (α + 1)ε : 1 [1 : 2α + αε : 1] 100002011 a
2 [2α + 1 + αε : 1 + (2α + 2)ε : 1] 120110221 b
α + (2α + 2)ε : 1], [α + 1 + (α + 1)ε : 2α + (α + 1)ε : 1], [α + 1 + (α + 2)ε : 3 [α + 2ε : α + 1 + ε : 1] 012011101 c
4 [α + 1 + (2α + 2)ε : 2α : 1] 112202001 d
α + 2αε : 1], [α + 1 + (α + 2)ε : 2α + αε : 1], [α + 1 + (2α + 1)ε : α + 2ε : 5 [α + 2 + αε : α + ε : 1] 210101101 e
6 [αε : 1 + 2αε : 1] 000110021 f
1], [α+1+(2α+1)ε : 2α+ε : 1], [α+1+(2α+2)ε : 2α : 1], [α+1+(2α+2)ε :
7 [2α + 2 + (α + 1)ε : αε : 1] 221100011 g
α : 1], [α + 1 + αε : α + (2α + 1)ε : 1], [α + 1 + αε : 2α + (α + 2)ε : 8 [(α + 2)ε : 2 + αε : 1] 002120011 h
9 [α + 2 : 2α + (2α + 1)ε : 1] 210002121 i
1], [α + 1 + 2αε : α + ε : 1], [α + 1 + 2αε : 2α + 2ε : 1], [α + 2 + 2ε : 10 [α + 1 + 2ε : α + αε : 1] 112001011 j
11 [α + (2α + 1)ε : 2α + 2 : 1] 011222001 k
α + (2α + 2)ε : 1], [α + 2 + 2ε : 2α + (α + 1)ε : 1], [α + 2 + (α + 1)ε : 12 [2α + 1 + (α + 2)ε : 2 + (2α + 2)ε : 1] 122120221 l
13 [1 + αε : α + 2ε : 1] 100101201 m
α + (2α + 1)ε : 1], [α + 2 + (α + 1)ε : 2α + (α + 2)ε : 1], [α + 2 + (α + 2)ε : 14 [ε : 1 : 0] 001010000 n
15 [1 + 2αε : 2α + (2α + 2)ε : 1] 100202221 o
α + (α + 1)ε : 1], [α + 2 + (α + 2)ε : 2α + (2α + 2)ε : 1], [α + 2 + (2α + 1)ε : 16 [2α + 1 + (α + 1)ε : 1 : 1] 121110001 p
17 [α + αε : α + 1 + 2ε : 1] 010111201 q
α + αε : 1], [α + 2 + (2α + 1)ε : 2α + 2αε : 1], [α + 2 + (2α + 2)ε : 2α :
18 [α + 1 + (α + 2)ε : 2α + αε : 1] 112102011 r
1], [α + 2 + (2α + 2)ε : α : 1], [α + 2 + αε : α + ε : 1], [α + 2 + αε : 2α + 2ε : 19 [α + 2 + 2αε : α + 2αε : 1] 210201021 s
20 [(α + 1)ε : 1 + 2αε : 1] 001110021 t
1], [α + 2 + 2αε : α + 2αε : 1], [α + 2 + 2αε : 2α + αε : 1], [2α + 1 + ε : 21 [2α + 2 + (α + 1)ε : 0 : 1] 221100001 u
22 [(α + 1)ε : 2 + αε, 1] 001120011 v
1 + (α + 2)ε : 1], [2α + 1 + ε : 2 + (2α + 1)ε : 1], [2α + 1 + 2ε : 1 + 2αε : 23 [α + 2 + 2αε : 2α + αε : 1] 210202011 w
24 [α + 1 + (α + 2)ε : α + 2αε : 1] 112101021 x
1], [2α + 1 + 2ε : 2 + αε : 1], [2α + 1 + (α + 1)ε : 1 : 1], [2α + 1 + (α + 1)ε : 2 : 25 [α + αε : 2α + 2 + ε : 1] 010122101 y
26 [2α + 1 + (α + 1)ε : 2 : 1] 121120001 z
1], [2α + 1 + (α + 2)ε : 1 + (α + 1)ε : 1], [2α + 1 + (α + 2)ε : 2 + (2α + 2)ε : 27 [1 + 2αε : α + (α + 1)ε : 1] 100201111 0
28 [2ε : 1 : 0] 002010000 1
1], [2α + 1 + (2α + 1)ε : 1 + (2α + 1)ε : 1], [2α + 1 + (2α + 1)ε : 2 + (α + 2)ε :
29 [1 + αε : 2α + ε : 1] 100102101 2
1], [2α+1+(2α+2)ε : 1+2ε : 1], [2α+1+(2α+2)ε : 2+ε : 1], [2α+1+αε : 30 [2α + 1 + (α + 2)ε : 1 + (α + 1)ε : 1] 122110111 3
31 [α + (2α + 1)ε : α + 1 : 1] 011211001 4
1 + (2α + 2)ε : 1], [2α + 1 + αε : 2 + (α + 1)ε : 1], [2α + 1 + 2αε : 1 + αε : 32 [α + 1 + 2ε : 2α + 2αε : 1] 112002021 5
33 [α + 2 : α + (α + 2)ε : 1] 210001211 6
1], [2α + 1 + 2αε : 2 + 2αε : 1], [2α + 2 + (α + 1)ε : 0 : 1], [2α + 2 + (α + 1)ε : 34 [(α + 2)ε : 1 + 2αε : 1] 002110021 7
35 [2α + 2 + (α + 1)ε : 2αε : 1] 221100021 8
ε : 1], [2α + 2 + (α + 1)ε : (α + 1)ε : 1], [2α + 2 + (α + 1)ε : (α + 2)ε : 36 [αε : 2 + αε : 1] 000120011 9
37 [α + 2 + αε : 2α + 2ε : 1] 210102201 space
1], [2α + 2 + (α + 1)ε : (2α + 1)ε : 1], [2α + 2 + (α + 1)ε : (2α + 2)ε : 38 [α + 1 + (2α + 2)ε : α : 1] 112201001 :
39 [α + 2ε : 2α + 2 + 2ε : 1] 012022201 ?
1], [2α + 2 + (α + 1)ε : αε : 1], [2α + 2 + (α + 1)ε : 2ε : 1], [2α + 2 + (α + 1)ε :
40 [2α + 1 + αε : 2 + (α + 1)ε : 1] 120120111 !
2αε : 1], [α : α + 1 + 2αε : 1], [α : 2α + 2 + αε : 1]} 41 [1 : α + 2αε : 1] 100001021 ,
42 [0 : 1 : 0] 000010000 .
Let P = [1 : 2α+αε : 1] ∈ Ea,b (F9 [ε]), P is of order
42. We will use the subgroup hP i of Ea,b (F9 [ε]) to
encrypt messages, and we denote 3.2 Encryption of a message
Let the following message:
G = hP i

ISBN: 978-1-61804-130-2 72
 Latest Trends in Applied Informatics and Computing

”we can encrypt any message written with the 4 Conclusion

use of: the lower case alphabet a,b,c..., the numerical
With this example we can encrypt any message with
symbols of the decimal base 0,1,2..., and the punctua-
any length . . . etc..
tion marks :,.,!,?,.”

The encryption of this message is:

5 Open problems
2102020112101011012101022010120111011000020110
0101000021010220121010110100101000001201110111
2102011010122101121110001001110021210102201100
• Study of the elliptic curve over
0020110010100000101221012101022011001012012101
0110121020102121020102110000201122110001121010
1101210102201210202011112102011210002121001110 A = F3d [X]/(X n ), n ≥ 3.
0210011100212101011010010100002101022012102020
1121000212100111002100212001121010220100111002
1002120011210101101210102201221100001210201021
2101011012101022011002022210001100211122010012 • Cryptography over this curve.
1010220100111002100212001121010110121010220112
2120221100202221210202011210101101112102011210
1022010120111011000020112102010212101011012101
0220110000201112212022112111000100212001110000
• Discrete logarithm attack.
2011120110221210101101001110021210102201100002
0111000010211201102211000010210120111010000100
0000001000000001000010000102121010220100111002 • New cryptosystem.
1002120011210101101210102201001010000221100001
1001012012101011011121020112100021210120111011
0000201112212022121010220121020102101012210110
0101201120110221100202221122120221210201021210
1022011002022210001100212101022010011100210021 Acknowledgements: The research was supported by
2001121010110121010220111220200121010110101201
1101210002121100101201100002011122120221210102 the University of FEZ.
2011201102211000020112102010212101011012101022
0110020111110000102100201000010000102110010210
1000010000000010000000010000100001021210102201
1000020110010100001122020012101022010011100210
0212001121010110121010220112111000122110000100 References:
1010000012011101001110021221100001100002011001
1100212100021211002022210010100002101022011001
0120110000201111210201101122200121020102121010
[1] A. Chillali, Ellipic cuvre over ring, International
2201112201001100001021000010000100001021120120 Mathematical Forum., Vol. 6, no . 31, 2011,
111100001021012022201100001021000010000
pp. 1501-1505.
[2] A. Chillali, The J,n − invariant of EA,B n ,
3.3 Decryption of a message Recent Advances in Computers, Communica-
Let the following message : tions, Applied Social Science and Mathemat-
ics, ICANCM’11, Published by WSEAS Press,
2102020112101011012101022010001100212100021210
2011, pp. 54–56.
0101000010000201112212022112212022101012210110
0001021210102201012011101100002011001010000210
[3] A. Chillali, The J − invariant over E3nd , Int.
1022012211000012102010212101011012101022010011
1002100212001121010110121010220121010110112212
J. Open Problems Compt. Math., Vol. 5, No. 4,
0221122120221210002121121110001001110021210002
1210120111012101022010120111012211000011121020
December 2012, pp. 106–111.
1100112001121010110121010220111220200121010110
1000110021210002121001010000210101101112202001 [4] W. Bosma, and H.W. Lenstra, Complete System
2101022011002022210011200112101011011121020112
1010220100111002100212001121000212121020102121
of Two Addition Laws for Elliptic Curved, Jour-
0102201112102011210002121001010000221100011100
0010212101022010011100211002022212101022010120
nal of Number Theory, 1995.
1110111210201101012210112111000100111002121010
2201100002011001010000010122101210102201100101
2012101011012102010212102010211000020112211000
1121010110121010220121020201111210201121000212
1001110021001110021210101101001010000210102201
1201102210101221012101022010011100210021200112
1010110121010220122110000121020102121010110121
0102201100202221000110021210102201001110021002
1200112101011012101022011000020111221202211211
1000100212001110000201100101000022110000110010
1201210101101112102011210002121012011101210102
2012102010210101221011001012011201102211002022
2112212022121020102121010220110000201100101000
0112202001210102201121110001221100001001010000
0120111010011100212211000011000020110011100212
1000212110020222100101000021010220110010120110
0002011112102011011222001210201021000010000

It’s decryption is:

”we finally, can use the elliptic curve defined over this
ring, to crypt any message written by the use of the
alphanumeric symbols and punctuation marks.”

ISBN: 978-1-61804-130-2 73