See

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

Explicit Formulas Describing: The Binary

Operations Calculus In \(E_{a,b}\)

Article · November 2011

DOI: 10.20454/jcce.2012.182

CITATIONS READS

0 2

2 authors, including:

Abdelhakim Chillali
Université Sidi Mohamed Ben Abdellah
50 PUBLICATIONS 60 CITATIONS

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Elliptic Curve Cryptography View project

All content following this page was uploaded by Abdelhakim Chillali on 12 June 2016.

The user has requested enhancement of the downloaded file. All in-text references underlined in blue are added to the original document
and are linked to publications on ResearchGate, letting you access and read them immediately.
J. of Commun. & Comput. Eng. Copyright © Modern Science Publishers
ISSN 2090-6234 www.m-sciences.com
Volume 2, Issue 3, 2012, Pages 16:20

Explicit Formulas Describing: The Binary Operations Calculus in E ,

Abdelhakim Chillali · Mohamed Charkani

Received: 20 September 2011/ Accepted: 23 October 2011

Abstract In this work we study the elliptic curve over the Proof Indeed the ring is a local ring with the maximal
artinian principal ideal ring = [ ], ( = ) . More ideal . ■
precisely, we establish a group homomorphism betweens
( , +) and the abelian group , of elliptic curve. For Remark 1.3 Let =∑ be the inverse of the
cryptography applications, we give many various explicit element = ∑ . Then,
formulas describing the binary operations calculus in , .
=
, ∀ > 0. [1]
Keywords Elliptic curves · ring; Finite field · Public key =− ∑
cryptography.

1 Introduction 2 Elliptic curve over .

Let p be an odd prime number and be an integer such that In this section we suppose = 3. An elliptic curve over a
≥ 2. ring is a curve that is given by an equation of the form
[ ] = + + , (∗)
Consider the quotient ring = ( ) where is
where , ∈ and 4 + 27 is invertible in .
the finite field of order q and characteristic p. Then the ring
A may be identified to the ring [ε] where ε = 0. In We denote by , the elliptic curve over [1, 2, 3]. Let
other word [1] the canonical projection: [4]

⟶
= |( ) ∈ : .
∑ ↦

Consider ( ), ( ) is the elliptic curve over of

equation:
The following result is easy to prove:
= + ( ) + ( ) ,
Lemma 1.1 Let = ∑ and =∑ be two
elements of A. Then where , ∈ and 4 ( ) + 27 ( ) ≠ 0 [2,3,4].
=∑ where =∑ . The set , is an abelian group. Its identity element is a
special point called the point at infinity [1,4].
Lemma 1.2 The non-invertible elements of are those
elements of the form = ∑ . Lemma 2.1 The mapping

, ⟶ ( ), ( )
, :
[ : : ] ↦ [ ( ): ( ): ( )]
Abdelhakim Chillali · Mohamed Charkani
is a surjective homomorphism of groups.
Department of Mathematics and Computer, Faculty of Science, FST
Fez, Morocco Proof Consider [ : : ] and [ : : ] in .
,
E-mail: Chil2015@yahoo.fr
We have
Explicit Formulas Describing: The Binary Operations Calculus in , . 17

, ([ : : ]+ [ : : ]) = , ([ : : ]) + > ∶= 3;
, ([ : : ]). (1)
> := ( [ ]∗ , = 0. . − 1);
We now quickly show how one can also obtain results (1)
using maple procedure “some and proj2”. So, π , is a > := ( [ ]∗ , = 0. . − 1);
homomorphism of groups.
> := ( [ ]∗ , = 1. . − 1);
Let [ : : ] in ( ), ( ) , then
> := ( [ ]∗ , = 1. . − 1);
= + +
> ([ , 1,0], [ , 1,0], , , );
= + +
∶= 3
= + +
= + +
= + +
= + +
= + +
= +
If [ ∶ ∶ ] in , , then = + + .
= +
In order to simplify this last expression, we have
[( + ) +( + ) , 1,0] ■
+ + =0 , (2)
Lemma 3.2 The mapping
where
⟶ ,
:
=− + + + ( , ℎ) ↦ [ + ℎ : 1: 0]

=( +3 ) −2 is an injective homomorphism of groups.

+(− +3 +2 ) +
+ Proof Evidently, is injective. Every [ + ℎ : 1: 0]
satisfies the equation of (∗), we calls its points points at
=( +3 ) −2 infinity of the curve , .
+(− +3 +2 )
+ −2 − +3 We have:
+3 +3 + +
+2 +2 + [ + ℎ : 1: 0] + [ + ℎ : 1: 0]
= [( + ) + (ℎ + ℎ ) : 1: 0]
(2) ⇔ ( = 0, = 0, = 0)
Finally, θ (k, h) + (k , h ) = θ (k, h) + θ (k , h ) and
=0 ⇔[ : : ]∈ ( ), ( ).
we concluded θ is an injective homomorphism of groups.

Coefficients + 3 ,2 and − +3 + ■
2 are partial derivative of a function
Corollary 3.3 The set G is equal to θ ( ).
F(X, Y, Z) = Y Z − X − aXZ − bZ
Proof Let [kε + hε : 1: 0] ∈ θ ( ) , then
at the point(x , y , z ), can not be all three null. We can then
at last conclude that [x : y : z ] and [x : y : z ]. , ([ + ℎ : 1: 0]) = [0 ∶ 1 ∶ 0],

Finally,π , is a surjective homomorphism of groups. we concluded [kε + hε : 1: 0] ∈ ker(π , ).

■ Let = [ ∶ ∶ ] ∈ ( , ), then

Definition 2.2 We definite G by G = Ker(π , ). , ( ) = [0 ∶ 1 ∶ 0].

We set ,

3. Main Results = + ,

Lemma 3.1 Let k, h, k and h in . Then =1+ + ,

[ + ℎ : 1: 0] + [ + ℎ : 1: 0] = + ,
= [( + ) + (ℎ + ℎ ) : 1: 0]
and
Proof
= 1+ + .
18 A. Chillali + M. Charkani

So, > 2( ([ , , 0], [ , , 1], , , ), );

=[ : 1: ]=[ + ∶ 1: + ]. ∶= 3

We have ∈ , , thus = 0, = 0 and ∈ ( ). = + +

Finally G =θ ( ). ■ = + +

Lemma 3.4 Let P = [kε + hε : 1: 0] and = + +

Q = [∑ s ε :∑ t ε : 1]. Then = +

P + Q = [X: Y: 1] with π(X) = s and π(Y) = t . = + +

Proof = +

> ∶= 3; [0,1,0] ■

> := ( [ ]∗ , = 0. . − 1);

> := ( [ ]∗ , = 0. . − 1); Lemma 3.6 Let P = [∑ s ε :∑ t ε : 1] and

> := ( [ ]∗ , = 1. . − 1); Q = [X: Y: 1] with π(X) = s and π(Y) = −t ≠ 0 . Then

> := ( [ ]∗ , = 0. . − 1); P+Q ∈ G .

> := ( [ ]∗ , = 0. . − 1); Proof

> 2( ([ , 1,0], [ , , 1], , , ), ); > ∶= 3;

∶= 3 > := ( [ ]∗ , = 0. . − 1);

= + + > := ( [ ]∗ , = 0. . − 1);

= + + > := ( [ ]∗ , = 0. . − 1);

= + > := ( [ ]∗ , = 0. . − 1);

= + + > : = [0] + ( [ ]∗ , = 1. . − 1);

= + + > : = − [0] + ( [ ]∗ , = 1. . − 1);

[ , , 1] ■ > 2( ([ , , 1], [ , , 1], , , ), );

∶= 3

Lemma 3.5 Let P = [∑ s ε :∑ t ε : 1] and = + +

Q = [X: Y: 1] with π(X) = s and π(Y) = 0. Then = + +

P+Q ∈ G . = + +

Proof = + +

> ∶= 3; = + +

> := ( [ ]∗ , = 0. . − 1); =− + +

> := ( [ ]∗ , = 0. . − 1); [0,1,0] ■

> := ( [ ]∗ , = 0. . − 1);

> := ( [ ]∗ , = 1. . − 1); Lemma 3.7 Let P = [∑ s ε :∑ t ε : 1] and

> : = [0] + ( [ ]∗ , = 1. . − 1); Q = [X: Y: 1] with π(X) = s and π(Y) = t ≠ 0 .

Then
> := ( [ ]∗ , = 1. . − 1);
Explicit Formulas Describing: The Binary Operations Calculus in , . 19

P+Q ∉G . ∶= 3

Proof = + +

> ∶= 3; = + +

> := ( [ ]∗ , = 0. . − 1); = + +

> := ( [ ]∗ , = 0. . − 1); = + +
> := ( [ ]∗ , = 0. . − 1); = + +

> := ( [ ]∗ , = 0. . − 1); = + +

> : = [0] + ( [ ]∗ , = 1. . − 1); [ : : 1]

> : = [0] + ( [ ]∗ , = 1. . − 1); Where,

> 2( ([ , , 1], [ , , 1], , , ), );

= , =
∶= 3
=− +3 −3 + − +
= + + −2 +2

= + + =3 −3 − + − +

= + + =− −2 + + −3 +
3 −3 +2 − +3
= + +
■
= + +
Finally, as in [4], we summarize the results in the following
= + + table.

[ : : 1]
, ( + )

Where, [0: 1: 0]
1 [ + ℎ : 1: 0] [ + : 1: 0]
2 +2 − 18 −6 2 [ + ℎ : 1: 0] [ : : 1] [ , , 1]
=
6 +6 +2 +6
[0: 1: 0],
3 [ : + ℎ : 1] [ : + : 1] ( )= ( )
=
[0: 1: 0],
4 [ : : 1] [ : : 1] ( ) = ( ),
■ ( )=− ( )≠0

Lemma 3.8 Let P = [∑ s ε :∑ t ε : 1] and [ : : 1],

5 [ : : 1] [ : : 1] ( ) = ( ),
( )= ( )≠0
Q = [X: Y: 1] with π(X) ≠ s . Then P + Q ∉ G .
[ : : 1],
Proof 6 [ : : 1] [ : : 1] ( )≠ ( )

> ∶= 3;

> := ( [ ]∗ , = 0. . − 1); Acknowledgements

> := ( [ ]∗ , = 0. . − 1); I would thank Professor M. E. Charkani for his helpful
comments and suggestions.
> := ( [ ]∗ , = 0. . − 1);

> := ( [ ]∗ , = 0. . − 1); References

> := ( [ ]∗ , = 0. . − 1);

> := ( [ ]∗ , = 0. . − 1);

> 2( ([ , , 1], [ , , 1], , , ), );

20 A. Chillali + M. Charkani

1. Chillali, Elliptic Curve of the ring [ ], Int. Math.
For., Vol. 6, no. 31, 1501-1505, 2011.
2. V. Miller, Use of elliptic curves in cryptography in
Advances in cryptography-CRYPTO 85, Lecture
Notes in Computer Science Springer-Verlag, vol. 218,
pp. 417-426, 1989.
3. N. Koblitz, Elliptic Curve Cryptosystems, Math. of
Comput., 48, 203-209, 1987.
4. M. Virat, Courbe elliptique sur un anneau et
applications cryptographiques, Thèse Docteur en
Sciences, Nice-Sophia Antipolis, 2009.
 Filename: #182
Directory: C:\Documents and Settings\A. Ghareeb\My Documents
Template: G:\Journal of Advanced Studies in
TOPOLOGY\jcce_Papers\template_JCCE.dotx
Title:
Subject:
Author: A. Ghareeb
Keywords:
Comments:
Creation Date: 10/23/2011 6:29:00 PM
Change Number: 92
Last Saved On: 12/26/2011 8:30:00 PM
Last Saved By: A. Ghareeb
Total Editing Time: 98 Minutes
Last Printed On: 12/26/2011 8:30:00 PM
As of Last Complete Printing
Number of Pages: 5
Number of Words: 1,856 (approx.)
Number of Characters: 10,583 (approx.)

View publication stats