Verifiable Encryption of Digital Signatures Using Elliptic Curve Digital Signature Algorithm and its Implementation Issues

Verifiable Encryption of Digital Signatures Using Elliptic Curve Digital Signature Algorithm and its Implementation Issues

R. Anitha (PSG College of Technology, India) and R. S. Sankarasubramanian (PSG College of Technology, India)
Copyright: © 2007 |Pages: 20
DOI: 10.4018/978-1-59904-168-1.ch010
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

This chapter presents a new simple scheme for verifiable encryption of elliptic curve digital signature algorithm (ECDSA). The protocol we present is an adjudicated protocol, that is, the trusted third party (TTP) takes part in the protocol only when there is a dispute. This scheme can be used to build efficient fair exchanges and certified email protocols. In this paper we also present the implementation issues. We present a new algorithm for multiplying two 2n bits palindromic polynomials modulo xp–1 for prime p = 2n + 1 for the concept defined in Blake, Roth, and Seroussi (1998), and it is compared with the Sunar-Koc parallel multiplier given in Sunar and Koc (2001).

Complete Chapter List

Search this Book:
Reset