NAME

Crypt::ECDSA::Point -- Elliptic curve points for EC cryptography

DESCRIPTION

These are for use with Crypt::ECDSA, a Math::BigInt based cryptography module. These routines work most efficiently if the GMP math library is installed, and in particular the point multiply function may be quite tedious without the GMP math library, which enables Math::BigInt::GMP.

METHODS

new

Constructor.  Takes the following named pair arguments:

curve => curve or a 'standard' named curve (this may be the best choice)
if not a standard curve, will need X => integer, Y => integer, order => integer,
G_x => base point x coordinate,  G_y => base point y coordinate
d => secret key, a integer secret multiplier.  If secret not specified, 
the object will generate a random secret key.

curve

Returns or sets the key's curve, a Crypt::ECDSA::Curve derived object 

Q

Returns or sets the key's Q public point

Qx

returns the x coordinate of the public key

Qy

returns the y coordinate of the public key

order

Returns the order of the curve's base point, if known

secret

returns the secret scalar private key (stored internally as scalar bigint $d)

set_public_Q

Used to set a public key for use when the private key is unknown

new_key_values

Regenerate a new private and public key and return the scalars
( secret value d, public point x coordinate, public point y coordinate )
Be careful!  The old and new secret keys are not stored permanently by the module.

verify_public_key

Verify a provided public key when the curve, but not the private key are known

read_PEM

(to be implemented)

write_PEM

(to be implemented)

AUTHOR

William Herrera B<wherrera@skylightview.com>. 

SUPPORT

Questions, feature requests and bug reports should go to <wherrera@skylightview.com>.

COPYRIGHT

Copyright (c) 2007 William Herrera. All rights reserved. This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself.