Goldbach’s Conjecture on ECDSA Protocols

N.  Vijayarangan; Nitin Agarwal; S.  Kasilingam

Paper 2003/076 Original: eprint.iacr.org/2003/076 ↗

Goldbach’s Conjecture on ECDSA Protocols

N. Vijayarangan

Nitin Agarwal

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.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
History: 2003-04-26: last updated; 2003-04-24: published
Short URL: https://ia.cr/2003/076
License: https://creativecommons.org/licenses/by/4.0/

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}
}