Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Formalized Mathematics

(a computer assisted approach)

Editor-in-Chief: Matuszewski, Roman

4 Issues per year

SCImago Journal Rank (SJR) 2016: 0.207
Source Normalized Impact per Paper (SNIP) 2016: 0.315

Open Access
See all formats and pricing
More options …
Volume 20, Issue 1 (Jan 2012)


Operations of Points on Elliptic Curve in Projective Coordinates

Yuichi Futa / Hiroyuki Okazaki / Daichi Mizushima / Yasunari Shidama
Published Online: 2012-09-12 | DOI: https://doi.org/10.2478/v10037-012-0012-2

Operations of Points on Elliptic Curve in Projective Coordinates

In this article, we formalize operations of points on an elliptic curve over GF(p). Elliptic curve cryptography [7], whose security is based on a difficulty of discrete logarithm problem of elliptic curves, is important for information security. We prove that the two operations of points: compellProjCo and addellProjCo are unary and binary operations of a point over the elliptic curve.

  • Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.Google Scholar

  • Czesław Byliński. Binary operations. Formalized Mathematics, 1(1):175-180, 1990.Google Scholar

  • Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.Google Scholar

  • Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.Google Scholar

  • Czesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.Google Scholar

  • Yuichi Futa, Hiroyuki Okazaki, and Yasunari Shidama. Set of points on elliptic curve in projective coordinates. Formalized Mathematics, 19(3):131-138, 2011, doi: 10.2478/v10037-011-0021-6.CrossrefGoogle Scholar

  • G. Seroussi I. Blake and N. Smart. Elliptic Curves in Cryptography. Number 265 in London Mathematical Society Lecture Note Series. Cambridge University Press, 1999.Google Scholar

  • Eugeniusz Kusak, Wojciech Leończuk, and Michał Muzalewski. Abelian groups, fields and vector spaces. Formalized Mathematics, 1(2):335-342, 1990.Google Scholar

  • Rafał Kwiatek. Factorial and Newton coefficients. Formalized Mathematics, 1(5):887-890, 1990.Google Scholar

  • Rafał Kwiatek and Grzegorz Zwara. The divisibility of integers and integer relative primes. Formalized Mathematics, 1(5):829-832, 1990.Google Scholar

  • Christoph Schwarzweller. The binomial theorem for algebraic structures. Formalized Mathematics, 9(3):559-564, 2001.Google Scholar

  • Andrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics, 1(1):115-122, 1990.Google Scholar

  • Andrzej Trybulec. Tuples, projections and Cartesian products. Formalized Mathematics, 1(1):97-105, 1990.Google Scholar

  • Michał J. Trybulec. Integers. Formalized Mathematics, 1(3):501-505, 1990.Google Scholar

  • Wojciech A. Trybulec. Groups. Formalized Mathematics, 1(5):821-827, 1990.Google Scholar

  • Wojciech A. Trybulec. Vectors in real linear space. Formalized Mathematics, 1(2):291-296, 1990.Google Scholar

  • Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.Google Scholar

About the article

Published Online: 2012-09-12

Published in Print: 2012-01-01

Citation Information: Formalized Mathematics, ISSN (Online) 1898-9934, ISSN (Print) 1426-2630, DOI: https://doi.org/10.2478/v10037-012-0012-2.

Export Citation

This content is open access.

Comments (0)

Please log in or register to comment.
Log in