International Journal of Modern Science and Technology Vol. 1, No. 8, November 2016. Page 269-275. http://www.ijmst.co/ ISSN: 2456-0235. Review Article Elliptic Curve and Associate Cryptosystem S. Revathi, A. R. Rishivarman Department of Mathematics, Theivanai Ammal College for Women (Autonomous) Villupuram - 605 401. Tamilnadu, India. *Corresponding author’s e-mail: [email protected] Abstract Elliptic curve is a study of points on two-variable polynomials of degree three. With curve defined over a finite field, this set of points are acted by an addition operation forms a finite group structure. Encryption and decryption transform a point into another point in the same set. Besides providing conceptual understanding, discussions are targeting the issues of security and efficiency of elliptic curve cryptosystem. Cryptography is an evolving field that research into discreet mathematical equation that is representable by computer algorithm for providing message confidentiality. The scheme has been widely used by nation-states, corporate and individual who seek privacy for data in storage and during transmission. This paper provides a ground up survey on elliptic curve cryptography. The present paper serves as a basis to understand the fundamental concept behind this cryptosystem. Moreover, we also highlight subareas of research within the scope of elliptic curve cryptosystem. Keywords: Elliptic Curve Cryptography; Finite field; Addition; Multiplication. Introduction such as ad-hoc wireless networks and mobile Public key cryptosystems are constructed by networks.There is a trend that conventional relying on the hardness of mathematical public key cryptographic systems are gradually problem. RSA based on Integer Factorization replaced with ECC systems. Problem and DH based on the Discrete In Sep’2000 Bailey and Christof Paar [14] Logarithm Problem [1]. The main problem of showed efficient arithmetic in finite field conventional Public key Cryptosystems is that extensions with application in elliptic curve the Key size has to be sufficiently large in order cryptography. An elliptic curve coprocessor to meet the high level security requirement, based on the Montgomery algorithm for curve resulting in lower speed and consumption of multiplication can be implemented using more bandwidth [2]. generic coprocessor architecture [15]. In Elliptic curves have a rich and beautiful February, 2005, the NSA announced that it had history, having been studied by mathematicians decided on a strategy of adopting elliptic curve for over a hundred years. They have been cryptography as part of a US government standard in securing sensitive-but-unclassified deployed in diverse areas like: Number theory (proving Fermat`s Last Theorem) in 1995 [3], information. The NSA recommended group of modern physics: String theory (The notion of a algorithms called Suite B, including Elliptic- point-like particle is replaced by a curve-like Curve Menezes-Qu-Vanstone and Elliptic- string.), Elliptic Curve Cryptography (An Curve Diffie-Hellman for key agreement, and efficient public key cryptographic system) [4]. the Elliptic Curve Digital Signature Algorithm In 1985, Neal Koblitz [5] and Victor Miller [6] for digital signatures. The suite also included independently proposed using elliptic curves to AES. design public key cryptographic systems. In the In 2010 [16] Brian King provided a deterministic method that guarantees,the map of late 1990`s, ECC was standardized by a number of organizations such as ANSI [7-9], ISO a message to an elliptic curve point can be made [10,11], NIST [12,13] and it started receiving without any modification. In 1988 Koblitz commercial acceptance. Nowadays, it is mainly suggested for the first time the generalization of used in the resource constrained environments, EC to curves of higher genus namely hyper elliptic curves (HEC) [17]. Since then HEC has Received: 02.11.2016; Received after Revision: 06.11.2016; Accepted: 08.11.2016; Published: 23.11.2016 ©International Journal of Modern Science and Technology. All rights reserved. 269 Revathi and Rishivarman, 2016. Elliptic Curve and Associate Cryptosystem been analyzed and implemented in software plane models of elliptic curve, a generalisation [18,19] and hardware [20,21] both. of Edward curves introduced by Bernstein (2007). Representations of Elliptic curve Jacobian curve Various forms of elliptic curve has been It [28] is used in cryptography instead of the explored as, Weierstrass form because it can provide a Weierstrass curve defense against simple and differential power An elliptic curve over a field is defined analysis style (SPA) attacks and also faster by an equation (Weierstrass equation) arithmetic compared to the Weierstrass curve. : = Montgomery curve (1) This curve was introduced by Peter L where and Montomery [29], and it has been used since where is the discriminant of and is defined 1987 for certain computations, and in particular as follows: in different cryptography applications. (2) Mathematical Background + 4 , Definition 1 = + 4 A general equation of degree three - polynomial with two variables can be defined as If both the coordinate of the point or = (the point at infinity, infinity, or zero element. The set of points on is: (4) where the coefficient belong to any field K. Definition 2 (3) A point P in is non-singular if and Hessian curve only if the partial derivatives of f with This curve [22] was suggested for application respect to x and with respect to y are not in elliptic curve cryptography because both zero at the point P. arithmetic in this curve representation is faster Definition 3 and needs less memory than arithmetic in Let two non-singular cubic curves standard Weierstrass form. and defined over K be given by Edwards curve Weierstrass equations This curve was introduced in 2007 by Edward [23] and in Bernstein and Lange [24] pointed out several advantages of the Edwards (5) and are said to be isomorphic over if form in comparison to the more well known weierstrass form. there exist with invertible, such Twists of curve that the function is defined by the change of In mathematics an elliptic curve E over a variables field K has its quadratic twist, that is another elliptic curve which is isomorphic to E over an which transforms equation into . algebric of K. In particular, an isomorphism Definition 4 between elliptic curves is an isogeny of degree An elliptic curve is a non-singular 1,that is an invertible isogeny. Some curves cubic curve, a rational solution to = have higher order twists such as cubic and over . The set of points is given quartic twists. The curve and its twists have the by same j-invariant and is shown in [25]. Twisted Hessian curve [26] represents a generalization of Hessian curve. It was introduced in elliptic (6) curve cryptography to speed up the addition and where is the rational point at infinity. doubling formulas and to have strongly unified arithmetic. Twisted Edward curves [27] are ©International Journal of Modern Science and Technology. All rights reserved. 270 Revathi and Rishivarman, 2016. Elliptic Curve and Associate Cryptosystem Definition 5 Hence Let be an elliptic curve with integer coefficients. Under a reduction modulo , if is a non-singular curve, Associativity then is said to have a good reduction at . The proof for this property is lengthy. Only Otherwise, has bad reduction at . the simplified version will be laid here. Definition 6 Consider three points and . Let be a Given a point and an integer line through and to produce , so ∈ , a scalar multiplication on ECC is defined will be on . Let be a line as adding point o itself times such that through and to produce , so (7) will be on . Now, let be and . the line through and . Hence Definition 7 is with line . Also, An endomorphism of given by a let be the line through and . Hence rational function, is defined by is with a line . Geometrically, the two lines and are the same, which conclude the proof. Where and are rational function on and Now, let us consider an algebraic (8) formulation of the well-defined point for all arithmetic. For simplicity, consider Group Structure (9) Over where char Closure Let A line through Aline through any two non-singular points (probably the same) on a non-singular curve parallels to y-axis meets a line at infinity at will always intersect the curve at a third point. and meets at another point . Following the Commutativity composition law for inversion, this point is Let be a line through and and extend actually with its -coordinate a reflection of to a third intersection to produce . Extending at -axis. Therefore, from to would produce the same line and Let the same point of intersection. To get a point + , extend a second line from and or , to produce a third intersection or for which . Allow and for either case. Hence consider the following cases separately. If then Identity (10) Consider two points and . Extending where the slope, through and produces . Extending If but then through and results in and the If and then third intersection would be . Hence , (11) . Inverse where the slope . Consider two points and .Extend If and then through a tangent point at to produce Moreover, and such that . Let be a line The first two cases deal with adding two through and with the third different points on the curve and this operation intersection and call it . On , is known as point addition. Meanwhile, the last consider to produce on which two cases involves doubling a point and this again yield the third point at the tangent. operation is known as point doubling. Hasse's Remember tangent is considered as having two theorem on elliptic curves [30] bounds the points. number of points on an elliptic curve over a finite field above and below. If # is the ©International Journal of Modern Science and Technology. All rights reserved.