Cryptology ePrint Archive: Report 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.

Category / Keywords: cryptographic protocols / cryptographic protocols / Elliptic curves, Digital signature, Multi - precision integer, Goldbach’s conjecture, ANSI X9.62

Publication Info: Authentication protocol

Date: received 23 Apr 2003, last revised 25 Apr 2003

Contact author: {vijayrangan_2005, kasilingam_s, nitagl} at yahoo com

Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

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.

Version: 20030426:022956 (All versions of this report)

Discussion forum: Show discussion | Start new discussion