**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**16

# Search results for: Elliptic Curves

##### 16 A Study of General Attacks on Elliptic Curve Discrete Logarithm Problem over Prime Field and Binary Field

**Authors:**
Tun Myat Aung,
Ni Ni Hla

**Abstract:**

**Keywords:**
Discrete logarithm problem,
general attacks,
elliptic curves,
strong curves,
prime field,
binary field,
attack experiments.

##### 15 Improved of Elliptic Curves Cryptography over a Ring

**Authors:**
A. Chillali,
A. Tadmori,
M. Ziane

**Abstract:**

In this article we will study the elliptic curve defined over the ring An and we define the mathematical operations of ECC, which provides a high security and advantage for wireless applications compared to other asymmetric key cryptosystem.

**Keywords:**
Elliptic Curves,
Finite Ring,
Cryptography.

##### 14 Cryptography Over Elliptic Curve Of The Ring Fq[e], e4 = 0

**Authors:**
Chillali Abdelhakim

**Abstract:**

Groups where the discrete logarithm problem (DLP) is believed to be intractable have proved to be inestimable building blocks for cryptographic applications. They are at the heart of numerous protocols such as key agreements, public-key cryptosystems, digital signatures, identification schemes, publicly verifiable secret sharings, hash functions and bit commitments. The search for new groups with intractable DLP is therefore of great importance.The goal of this article is to study elliptic curves over the ring Fq[], with Fq a finite field of order q and with the relation n = 0, n ≥ 3. The motivation for this work came from the observation that several practical discrete logarithm-based cryptosystems, such as ElGamal, the Elliptic Curve Cryptosystems . In a first time, we describe these curves defined over a ring. Then, we study the algorithmic properties by proposing effective implementations for representing the elements and the group law. In anther article we study their cryptographic properties, an attack of the elliptic discrete logarithm problem, a new cryptosystem over these curves.

**Keywords:**
Elliptic Curve Over Ring,
Discrete Logarithm Problem.

##### 13 Elliptic Divisibility Sequences over Finite Fields

**Authors:**
Betül Gezer,
Ahmet Tekcan,
Osman Bizim

**Abstract:**

**Keywords:**
Elliptic divisibility sequences,
singular elliptic divisibilitysequences,
elliptic curves,
singular curves.

##### 12 Positive Definite Quadratic Forms, Elliptic Curves and Cubic Congruences

**Authors:**
Ahmet Tekcan

**Abstract:**

**Keywords:**
Binary quadratic form,
elliptic curves,
cubic congruence.

##### 11 New DES based on Elliptic Curves

**Authors:**
Ghada Abdelmouez M.,
Fathy S. Helail,
Abdellatif A. Elkouny

**Abstract:**

**Keywords:**
DES,
Elliptic Curves,
hybrid system,
symmetricencryption.

##### 10 Secure Protocol for Short Message Service

**Authors:**
Shubat S. Ahmeda,
Ashraf M. Ali Edwila

**Abstract:**

**Keywords:**
Elliptic Curve Cryptography (ECC),
End-to-end
Security,
Identity-based Cryptography,
Public Key,
RSA,
SMS
Protocol.

##### 9 The Number of Rational Points on Elliptic Curves and Circles over Finite Fields

**Authors:**
Betül Gezer,
Ahmet Tekcan,
Osman Bizim

**Abstract:**

**Keywords:**
Elliptic curves over finite fields,
rational points on
elliptic curves and circles.

##### 8 A Pairing-based Blind Signature Scheme with Message Recovery

**Authors:**
Song Han,
Elizabeth Chang

**Abstract:**

Blind signatures enable users to obtain valid signatures for a message without revealing its content to the signer. This paper presents a new blind signature scheme, i.e. identity-based blind signature scheme with message recovery. Due to the message recovery property, the new scheme requires less bandwidth than the identitybased blind signatures with similar constructions. The scheme is based on modified Weil/Tate pairings over elliptic curves, and thus requires smaller key sizes for the same level of security compared to previous approaches not utilizing bilinear pairings. Security and efficiency analysis for the scheme is provided in this paper.

**Keywords:**
Blind Signature,
Message Recovery,
Pairings,
Elliptic Curves,
Blindness

##### 7 Finding More Non-Supersingular Elliptic Curves for Pairing-Based Cryptosystems

**Authors:**
Pu Duan,
Shi Cui,
Choong Wah Chan

**Abstract:**

**Keywords:**
Family of group order,
kth root of unity,
non-supersingular elliptic curves polynomial field.

##### 6 Deniable Authentication Protocol Resisting Man-in-the-Middle Attack

**Authors:**
Song Han,
Wanquan Liu,
Elizabeth Chang

**Abstract:**

**Keywords:**
Deniable Authentication,
Man-in-the-middleAttack,
Cryptography,
Elliptic Curves.

##### 5 The Elliptic Curves y2 = x3 - t2x over Fp

**Authors:**
Ahmet Tekcan

**Abstract:**

Let p be a prime number, Fp be a finite field and t ∈ F*p= Fp- {0}. In this paper we obtain some properties of ellipticcurves Ep,t: y2= y2= x3- t2x over Fp. In the first sectionwe give some notations and preliminaries from elliptic curves. In the second section we consider the rational points (x, y) on Ep,t. Wegive a formula for the number of rational points on Ep,t over Fnp for an integer n ≥ 1. We also give some formulas for the sum of x?andy?coordinates of the points (x, y) on Ep,t. In the third section weconsider the rank of Et: y2= x3- t2x and its 2-isogenous curve Et over Q. We proved that the rank of Etand Etis 2 over Q. In the last section we obtain some formulas for the sums Σt∈F?panp,t for an integer n ≥ 1, where ap,t denote the trace of Frobenius.

**Keywords:**
Elliptic curves over finite fields,
rational points onelliptic curves,
rank,
trace of Frobenius.

##### 4 The Number of Rational Points on Elliptic Curves y2 = x3 + b2 Over Finite Fields

**Authors:**
Betül Gezer,
Hacer Özden,
Ahmet Tekcan,
Osman Bizim

**Abstract:**

Let p be a prime number, Fpbe a finite field and let Qpdenote the set of quadratic residues in Fp. In the first section we givesome notations and preliminaries from elliptic curves. In the secondsection, we consider some properties of rational points on ellipticcurves Ep,b: y2= x3+ b2 over Fp, where b ∈ F*p. Recall that theorder of Ep,bover Fpis p + 1 if p ≡ 5(mod 6). We generalize thisresult to any field Fnp for an integer n≥ 2. Further we obtain someresults concerning the sum Σ[x]Ep,b(Fp) and Σ[y]Ep,b(Fp), thesum of x- and y- coordinates of all points (x, y) on Ep,b, and alsothe the sum Σ(x,0)Ep,b(Fp), the sum of points (x, 0) on Ep,b.

**Keywords:**
Elliptic curves over finite fields,
rational points on elliptic curves.

##### 3 Rational Points on Elliptic Curves 2 3 3y = x + a inF , where p 5(mod 6) is Prime

**Authors:**
Gokhan Soydan,
Musa Demirci,
Nazli Yildiz Ikikardes,
Ismail Naci Cangul

**Abstract:**

In this work, we consider the rational points on elliptic curves over finite fields Fp where p ≡ 5 (mod 6). We obtain results on the number of points on an elliptic curve y2 ≡ x3 + a3(mod p), where p ≡ 5 (mod 6) is prime. We give some results concerning the sum of the abscissae of these points. A similar case where p ≡ 1 (mod 6) is considered in [5]. The main difference between two cases is that when p ≡ 5 (mod 6), all elements of Fp are cubic residues.

**Keywords:**
Elliptic curves over finite fields,
rational points.

##### 2 Classification of the Bachet Elliptic Curves y2 = x3 + a3 in Fp, where p ≡ 1 (mod 6) is Prime

**Authors:**
Nazli Yildiz İkikardes,
Gokhan Soydan,
Musa Demirci,
Ismail Naci Cangul

**Abstract:**

**Keywords:**
Elliptic curves over finite fields,
quadratic residue,
cubic residue.

##### 1 The Number of Rational Points on Elliptic Curves y2 = x3 + a3 on Finite Fields

**Authors:**
Musa Demirci,
Nazlı Yıldız İkikardeş,
Gökhan Soydan,
İsmail Naci Cangül

**Abstract:**

**Keywords:**
Elliptic curves over finite fields,
rational points,
quadratic residue.