In 1987, Gordon gave an integer primality condition similar to the familiar test based on Fermat’s little theorem, but based instead on the arithmetic of elliptic curves with complex multiplication. We prove the existence of infinitely many composite numbers simultaneously passing all elliptic curve primality tests assuming a weak form of a standard conjecture on the bound on the least prime in...

Three lectures on elliptic surfaces and curves of high rank Noam D. Elkies Over the past two years we have improved several of the (Mordell–Weil) rank records for elliptic curves over Q and nonconstant elliptic curves over Q(t). For example, we found the first example of a curve E/Q with 28 independent points P i ∈ E(Q) (the previous record was 24, by R. Martin and W. McMillen 2000), and the fi...

Let y2 = x3 + ax + b be an elliptic curve over Fp, p a prime number greater than 3, and consider a, b ∈ [1, p]. In this paper, we study elliptic curve isomorphisms, with a view towards reduction in the size of elliptic curves coefficients. We first consider reducing the ratio a/b. We then apply these considerations to determine the number of elliptic curve isomorphism classes. Later we work on ...

A method is proposed that allows each individual party to an elliptic curve cryptosystem to quickly determine its own unique pair of finite field and Weierstraß equation, in such a way that the resulting pair provides adequate security. Although the choice of Weierstraß equations allowed by this proposal is limited, the number of possible finite fields is unlimited. The proposed method allows e...

CONTENTS Introduction 1. Elliptic Curves Defined by Simplest Cubic Fields 2. Linear Forms in Elliptic Logarithms 3. Computation of Integral Points 4. Tables of Results 5. General Results about Integral Points on the Elliptic Curves y2 = x3 + mx2 (m+3)x + 1 References Let f(X) be a cubic polynomial defining a simplest cubic field in the sense of Shanks. We study integral points on elliptic curve...

Randomization techniques play an important role in the protection of cryptosystems against implementation attacks. This paper studies the case of elliptic curve cryptography and propose three novel randomization methods, for the elliptic curve point multiplication, which do not impact the overall performance. Our first method, dedicated to elliptic curves over prime fields, combines the advanta...

Dupin cyclides are algebraic surfaces introduced for the first time in 1822 by the French mathematician Pierre-Charles Dupin. They have a low algebraic degree and have been proposed as a solution to a variety of geometric modeling problems. The circular curvature line’s property facilitates the construction of the cyclide (or the portion of a cyclide) that blends two circular quadric primitives...

Elliptic curve cryptography (ECC) is an alternative to traditional techniques for public key cryptography. It offers smaller key size without sacrificing security level. In a typical elliptic curve cryptosystem, elliptic curve point multiplication is the most computationally expensive component. So it would be more attractive to implement this unit using hardware than using software. In this pa...

Elliptic curve cryptosystems are expected to be a next standard of public-key cryptosystems. A security level of elliptic curve cryptosystems depends on a difficulty of a discrete logarithm problem on elliptic curves. The security level of a elliptic curve cryptosystem which has a public-key of 160-bit is equivalent to that of a RSA system which has a public-key of 1024-bit. We propose an ellip...

An amicable pair for an elliptic curve E/Q is a pair of primes (p, q) of good reduction for E satisfying #Ẽp(Fp) = q and #Ẽq(Fq) = p. In this paper we study elliptic amicable pairs and analogously defined longer elliptic aliquot cycles. We show that there exist elliptic curves with arbitrarily long aliqout cycles, but that CM elliptic curves (with j 6= 0) have no aliqout cycles of length greate...