Paper 2003/076
Goldbach’s Conjecture on ECDSA Protocols
N. Vijayarangan, Nitin Agarwal, and S. Kasilingam
Abstract
In this paper, an algorithm on Goldbach’s conjecture is newly defined for computing a large even number as a sum of two primes or a sum of prime and composite. Using the conjecture, an ECDSA (Elliptic Curve Digital Signature Algorithm) protocol is newly proposed for authentication. The protocol describes the process of key generation, signature generation and signature verification as well as security issues.
Note: This paper gives an algorithm on "how to compute Goldbach's conjecture". Using this conjecture, ECDSA protocol is implemented. It is different from ANSI standards.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Authentication protocol
- Keywords
- cryptographic protocolsElliptic curvesDigital signatureMulti - precision integerGoldbach’s conjectureANSI X9.62
- Contact author(s)
-
vijayrangan_2005 @ yahoo com
kasilingam_s @ yahoo com
nitagl @ yahoo com - History
- 2003-04-26: revised
- 2003-04-24: received
- See all versions
- Short URL
- https://ia.cr/2003/076
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2003/076,
author = {N. Vijayarangan and Nitin Agarwal and S. Kasilingam},
title = {Goldbach’s Conjecture on {ECDSA} Protocols},
howpublished = {Cryptology {ePrint} Archive, Paper 2003/076},
year = {2003},
url = {https://eprint.iacr.org/2003/076}
}
