**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**10

# Search results for: Prime number

##### 10 Pythagorean-Platonic Lattice Method for Finding all Co-Prime Right Angle Triangles

**Authors:**
Anthony Overmars,
Sitalakshmi Venkatraman

**Abstract:**

This paper presents a method for determining all of the co-prime right angle triangles in the Euclidean field by looking at the intersection of the Pythagorean and Platonic right angle triangles and the corresponding lattice that this produces. The co-prime properties of each lattice point representing a unique right angle triangle are then considered. This paper proposes a conjunction between these two ancient disparaging theorists. This work has wide applications in information security where cryptography involves improved ways of finding tuples of prime numbers for secure communication systems. In particular, this paper has direct impact in enhancing the encryption and decryption algorithms in cryptography.

**Keywords:**
Cryptography,
Pythagorean triples,
platonic triples,
right angle triangles,
co-prime numbers

##### 9 The Pell Equation x2 − Py2 = Q

**Authors:**
Ahmet Tekcan,
Arzu Özkoç,
Canan Kocapınar,
Hatice Alkan

**Abstract:**

**Keywords:**
Pell equation,
solutions of Pell equation

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

**Authors:**
Ahmet Tekcan

**Abstract:**

**Keywords:**
Elliptic Curves,
Binary quadratic form,
cubic congruence

##### 7 The Number of Rational Points on Singular Curvesy 2 = x(x - a)2 over Finite Fields Fp

**Authors:**
Ahmet Tekcan

**Abstract:**

**Keywords:**
elliptic curve,
Singular curve,
rational points

##### 6 Software to Encrypt Messages Using Public-Key Cryptography

**Authors:**
E. Inzunza-González,
C. Cruz-Hernández,
R. M. López-Gutiérrez,
E. E. García-Guerrero,
L. Cardoza-
Avendaño,
H. Serrano-Guerrero

**Abstract:**

**Keywords:**
software,
Asymmetric cryptography,
Prime number,
Publickey,
Private-key

##### 5 A Formal Approach for Proof Constructions in Cryptography

**Authors:**
Markus Kaiser,
Johannes Buchmann

**Abstract:**

**Keywords:**
prime numbers,
primality tests,
formal proof system,
higher-order logic,
Bayes' Formula,
Miller-Rabin primality test,
(conditional) probabilitydistributions,
formalverification

##### 4 Computer Verification in Cryptography

**Authors:**
Markus Kaiser,
Johannes Buchmann

**Abstract:**

In this paper we explore the application of a formal proof system to verification problems in cryptography. Cryptographic properties concerning correctness or security of some cryptographic algorithms are of great interest. Beside some basic lemmata, we explore an implementation of a complex function that is used in cryptography. More precisely, we describe formal properties of this implementation that we computer prove. We describe formalized probability distributions (o--algebras, probability spaces and condi¬tional probabilities). These are given in the formal language of the formal proof system Isabelle/HOL. Moreover, we computer prove Bayes' Formula. Besides we describe an application of the presented formalized probability distributions to cryptography. Furthermore, this paper shows that computer proofs of complex cryptographic functions are possible by presenting an implementation of the Miller- Rabin primality test that admits formal verification. Our achievements are a step towards computer verification of cryptographic primitives. They describe a basis for computer verification in cryptography. Computer verification can be applied to further problems in crypto-graphic research, if the corresponding basic mathematical knowledge is available in a database.

**Keywords:**
prime numbers,
formal verification,
primality tests,
(conditional) proba¬bility distributions,
formal proof system,
higher-order logic,
Bayes' Formula,
Miller-Rabin primality test

##### 3 The Number of Rational Points on Conics Cp,k : x2 − ky2 = 1 over Finite Fields Fp

**Authors:**
Ahmet Tekcan

**Abstract:**

Let p be a prime number, Fp be a finite field, and let k ∈ F*p. In this paper, we consider the number of rational points onconics Cp,k: x2 − ky2 = 1 over Fp. We proved that the order of Cp,k over Fp is p-1 if k is a quadratic residue mod p and is p + 1 if k is not a quadratic residue mod p. Later we derive some resultsconcerning the sums ΣC[x]p,k(Fp) and ΣC[y]p,k(Fp), the sum of x- and y-coordinates of all points (x, y) on Cp,k, respectively.

**Keywords:**
elliptic curve,
rational points,
conic

##### 2 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:**
rank,
Elliptic curves over finite fields,
rational points onelliptic curves,
trace of Frobenius

##### 1 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