Elliptic Curve Digital Signature Algorithm: Difference between revisions

 

;Elliptic curves.

 

An [[wp:Elliptic_curve|elliptic curve]] E over ℤp (p ≥ 5) is defined by an equation of the form

together with a special point 𝒪 called the point at infinity.

The set '''E(ℤp)''' consists of all points (x, y), with x, y ∈ ℤp,

=={{header|C}}==

Parallel to: FreeBASIC

/*

subject: Elliptic curve digital signature algorithm,

}

}

{{out}}

(tcc, srand(1); first set only)

Valid

_____

</pre>

 

=={{header|FreeBASIC}}==

Parallel to: C

'subject: Elliptic curve digital signature algorithm,

' toy version for small modulus N.

 

system

{{out}}

(randomize 1, first set only)

=={{header|Go}}==

Since Go has an ECDSA package in its standard library which uses 'big integers', we use that rather than translating one of the reference implementations for a 'toy' version into Go.

 

import (

valid := ecdsa.Verify(&priv.PublicKey, hash[:], r, s)

fmt.Println("\nSignature verified:", valid)

 

{{out}}

 

Signature verified: true

</pre>

 

=={{header|Julia}}==

 

using SHA

 

println("ECDSA of message <$altered> verified: ", isverifiedECDSA(altered, publickey, c, d))

<pre>

ECDSA of message <Bill says this is an elliptic curve digital signature algorithm.> verified: true

</pre>

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

{{out}}

Note the above only performs tests[1], and assigns literal values in place of rand(), in order to exactly match the FreeBASIC/C output.

Valid

_____

</pre>

 

=={{header|Raku}}==

(formerly Perl 6)

 

 

 

 

 

}

 

}

 

}

 

}

 

 

 

 

}

}

 

{{out}}

</pre>