• 제목/요약/키워드: Elliptic Curves

검색결과 109건 처리시간 0.024초

ON THE POINTS OF ELLIPTIC CURVES

  • Oh, Jangheon
    • Korean Journal of Mathematics
    • /
    • 제16권4호
    • /
    • pp.451-455
    • /
    • 2008
  • In this paper we give some results on the points of elliptic curves which have application to elliptic curve cryptography.

  • PDF

타원곡선의 역사 개관 (A Historical Overview of Elliptic Curves)

  • 고영미;이상욱
    • 한국수학사학회지
    • /
    • 제28권2호
    • /
    • pp.85-102
    • /
    • 2015
  • Elliptic curves are a common theme among various fields of mathematics, such as number theory, algebraic geometry, complex analysis, cryptography, and mathematical physics. In the history of elliptic curves, we can find number theoretic problems on the one hand, and complex function theoretic ones on the other. The elliptic curve theory is a synthesis of those two indeed. As an overview of the history of elliptic curves, we survey the Diophantine equations of 3rd degree and the congruent number problem as some of number theoretic trails of elliptic curves. We discuss elliptic integrals and elliptic functions, from which we get a glimpse of idea where the name 'elliptic curve' came from. We explain how the solution of Diophantine equations of 3rd degree and elliptic functions are related. Finally we outline the BSD conjecture, one of the 7 millennium problems proposed by the Clay Math Institute, as an important problem concerning elliptic curves.

A METHOD OF COMPUTATIONS OF CONGRUENT NUMBERS AND ELLIPTIC CURVES

  • Park, Jong-Youll;Lee, Heon-Soo
    • 호남수학학술지
    • /
    • 제32권1호
    • /
    • pp.177-192
    • /
    • 2010
  • We study the concepts of congruent number problems and elliptic curves. We research the structure of the group of elliptic curves and find out a method of the computation of L($E_n$, 1) and L'($E_n$, 1) by using SAGE program. In this paper, we obtain the first few congruent numbers for n ${\leq}$ 2500.

ON ELLIPTIC CURVES WHOSE 3-TORSION SUBGROUP SPLITS AS μ3 ⊕ℤ/3ℤ

  • Yasuda, Masaya
    • 대한수학회논문집
    • /
    • 제27권3호
    • /
    • pp.497-503
    • /
    • 2012
  • In this paper, we study elliptic curves E over $\mathbb{Q}$ such that the 3-torsion subgroup E[3] is split as ${\mu}_3{\oplus}\mathbb{Z}/3{\mathbb{Z}}$. For a non-zero intege $m$, let $C_m$ denote the curve $x^3+y^3=m$. We consider the relation between the set of integral points of $C_m$ and the elliptic curves E with $E[3]{\simeq}{\mu}_3{\oplus}\mathbb{Z}/3{\mathbb{Z}}$.

CONSTRUCTING PAIRING-FRIENDLY CURVES WITH VARIABLE CM DISCRIMINANT

  • Lee, Hyang-Sook;Park, Cheol-Min
    • 대한수학회보
    • /
    • 제49권1호
    • /
    • pp.75-88
    • /
    • 2012
  • A new algorithm is proposed for the construction of Brezing-Weng-like elliptic curves such that polynomials defining the CM discriminant are linear. Using this construction, new families of curves with variable discriminants and embedding degrees of $k{\in}\{8,16,20,24\}$, which were not covered by Freeman, Scott, and Teske [9], are presented. Our result is useful for constructing elliptic curves with larger and more flexible discriminants.

Drinfeld modules with bad reduction over complete local rings

  • Bae, Sung-Han
    • 대한수학회보
    • /
    • 제32권2호
    • /
    • pp.349-357
    • /
    • 1995
  • In the theory of elliptic curves over a complete field with bad reduction (i.e. with nonintegral j-invariant) Tate elliptic curves play an important role. Likewise, in the theory of Drinfeld modules, Tate-Drinfeld modules replace Tate elliptic curves.

  • PDF

TORSION POINTS OF ELLIPTIC CURVES WITH BAD REDUCTION AT SOME PRIMES II

  • Yasuda, Masaya
    • 대한수학회보
    • /
    • 제50권1호
    • /
    • pp.83-96
    • /
    • 2013
  • Let K be a number field and fix a prime number $p$. For any set S of primes of K, we here say that an elliptic curve E over K has S-reduction if E has bad reduction only at the primes of S. There exists the set $B_{K,p}$ of primes of K satisfying that any elliptic curve over K with $B_{K,p}$-reduction has no $p$-torsion points under certain conditions. The first aim of this paper is to construct elliptic curves over K with $B_{K,p}$-reduction and a $p$-torsion point. The action of the absolute Galois group on the $p$-torsion subgroup of E gives its associated Galois representation $\bar{\rho}_{E,p}$ modulo $p$. We also study the irreducibility and surjectivity of $\bar{\rho}_{E,p}$ for semistable elliptic curves with $B_{K,p}$-reduction.

GALOIS STRUCTURES OF DEFINING FIELDS OF FAMILIES OF ELLIPTIC CURVES WITH CYCLIC TORSION

  • Jeon, Daeyeol
    • 충청수학회지
    • /
    • 제27권2호
    • /
    • pp.205-210
    • /
    • 2014
  • The author with C. H. Kim and Y. Lee constructed infinite families of elliptic curves over cubic number fields K with prescribed torsion groups which occur infinitely often. In this paper, we examine the Galois structures of such cubic number fields K for the families of elliptic curves with cyclic torsion.

Improved Scalar Multiplication on Elliptic Curves Defined over $F_{2^{mn}}$

  • Lee, Dong-Hoon;Chee, Seong-Taek;Hwang, Sang-Cheol;Ryou, Jae-Cheol
    • ETRI Journal
    • /
    • 제26권3호
    • /
    • pp.241-251
    • /
    • 2004
  • We propose two improved scalar multiplication methods on elliptic curves over $F_{{q}^{n}}$ $q= 2^{m}$ using Frobenius expansion. The scalar multiplication of elliptic curves defined over subfield $F_q$ can be sped up by Frobenius expansion. Previous methods are restricted to the case of a small m. However, when m is small, it is hard to find curves having good cryptographic properties. Our methods are suitable for curves defined over medium-sized fields, that is, $10{\leq}m{\leq}20$. These methods are variants of the conventional multiple-base binary (MBB) method combined with the window method. One of our methods is for a polynomial basis representation with software implementation, and the other is for a normal basis representation with hardware implementation. Our software experiment shows that it is about 10% faster than the MBB method, which also uses Frobenius expansion, and about 20% faster than the Montgomery method, which is the fastest general method in polynomial basis implementation.

  • PDF