Digital signature with elliptic curves over the finite fields
- 9 June 2020
- journal article
- research article
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 25 (5) , 1289-1301
Abstract
Let x 3 + ax + b be an irreducible cubic polynomial over 𝔽p. Then by using transformations x → x + j and x → j –1 x, where j ∈ F* p , we can generate new irreducible cubic polynomials. In this paper, we use the elliptic curve equation y 2 = x 3 + ax + b and some transformations to generate an irreducible cubic polynomial, say Q. We generate the public and private keys in the elliptic curve digital signature algorithm (ECDSA), by defining the isomorphism between .Finally, we discuss the security of keys and the validity of signature.Keywords
This publication has 9 references indexed in Scilit:
- A secure user authentication protocol using elliptic curve cryptographyJournal of Discrete Mathematical Sciences and Cryptography, 2019
- Fully homomorphic encryption with matrix based digital signature standardJournal of Discrete Mathematical Sciences and Cryptography, 2017
- Post-Quantum Cryptography on FPGA Based on Isogenies on Elliptic CurvesIEEE Transactions on Circuits and Systems I: Regular Papers, 2016
- Horizontal collision correlation attack on elliptic curvesCryptography and Communications, 2014
- A Fast Square Root Computation Using the Frobenius Mapping2003
- Fast generation of elliptic curves with prime order over extension field of even extension degree2003
- The Elliptic Curve Digital Signature Algorithm (ECDSA)International Journal of Information Security, 2001
- Resistance Against Differential Power Analysis For Elliptic Curve Cryptosystems1999
- Elliptic curve cryptosystemsMathematics of Computation, 1987