Involved Source Files
Package ecdsa implements the Elliptic Curve Digital Signature Algorithm, as
defined in FIPS 186-3.
This implementation derives the nonce from an AES-CTR CSPRNG keyed by:
SHA2-512(priv.D || entropy || hash)[:32]
The CSPRNG key is indifferentiable from a random oracle as shown in
[Coron], the AES-CTR stream is indifferentiable from a random oracle
under standard cryptographic assumptions (see [Larsson] for examples).
References:
[Coron]
https://cs.nyu.edu/~dodis/ps/merkle.pdf
[Larsson]
https://www.nada.kth.se/kurser/kth/2D1441/semteo03/lecturenotes/assump.pdf
ecdsa_noasm.go
Package-Level Type Names (total 5, in which 2 are exported)
/* sort exporteds by: | */
PrivateKey represents an ECDSA private key.
D*big.IntPublicKeyPublicKeyPublicKey.Curveelliptic.CurvePublicKey.X*big.IntPublicKey.Y*big.Int
Add returns the sum of (x1,y1) and (x2,y2)
Double returns 2*(x,y)
Equal reports whether priv and x have the same value.
See PublicKey.Equal for details on how Curve is compared.
IsOnCurve reports whether the given (x,y) lies on the curve.
Params returns the parameters for the curve.
Public returns the public key corresponding to priv.
ScalarBaseMult returns k*G, where G is the base point of the group
and k is an integer in big-endian form.
ScalarMult returns k*(Bx,By) where k is a number in big-endian form.
Sign signs digest with priv, reading randomness from rand. The opts argument
is not currently used but, in keeping with the crypto.Signer interface,
should be the hash function used to digest the message.
This method implements crypto.Signer, which is an interface to support keys
where the private part is kept in, for example, a hardware module. Common
uses should use the Sign function in this package directly.
*T : crypto.Signer
T : crypto/elliptic.Curve
func GenerateKey(c elliptic.Curve, rand io.Reader) (*PrivateKey, error)
func crypto/x509.ParseECPrivateKey(der []byte) (*PrivateKey, error)
func crypto/x509.parseECPrivateKey(namedCurveOID *asn1.ObjectIdentifier, der []byte) (key *PrivateKey, err error)
func Sign(rand io.Reader, priv *PrivateKey, hash []byte) (r, s *big.Int, err error)
func SignASN1(rand io.Reader, priv *PrivateKey, hash []byte) ([]byte, error)
func crypto/x509.MarshalECPrivateKey(key *PrivateKey) ([]byte, error)
func sign(priv *PrivateKey, csprng *cipher.StreamReader, c elliptic.Curve, hash []byte) (r, s *big.Int, err error)
func signGeneric(priv *PrivateKey, csprng *cipher.StreamReader, c elliptic.Curve, hash []byte) (r, s *big.Int, err error)
func crypto/x509.marshalECPrivateKeyWithOID(key *PrivateKey, oid asn1.ObjectIdentifier) ([]byte, error)
PublicKey represents an ECDSA public key.
Curveelliptic.CurveX*big.IntY*big.Int
Add returns the sum of (x1,y1) and (x2,y2)
Double returns 2*(x,y)
Equal reports whether pub and x have the same value.
Two keys are only considered to have the same value if they have the same Curve value.
Note that for example elliptic.P256() and elliptic.P256().Params() are different
values, as the latter is a generic not constant time implementation.
IsOnCurve reports whether the given (x,y) lies on the curve.
Params returns the parameters for the curve.
ScalarBaseMult returns k*G, where G is the base point of the group
and k is an integer in big-endian form.
ScalarMult returns k*(Bx,By) where k is a number in big-endian form.
T : crypto/elliptic.Curve
func Verify(pub *PublicKey, hash []byte, r, s *big.Int) bool
func VerifyASN1(pub *PublicKey, hash, sig []byte) bool
func verify(pub *PublicKey, c elliptic.Curve, hash []byte, r, s *big.Int) bool
func verifyGeneric(pub *PublicKey, c elliptic.Curve, hash []byte, r, s *big.Int) bool
combinedMult implements fast multiplication S1*g + S2*p (g - generator, p - arbitrary point)
( T) CombinedMult(bigX, bigY *big.Int, baseScalar, scalar []byte) (x, y *big.Int)
crypto/elliptic.p256Curve
A invertible implements fast inverse mod Curve.Params().N
Inverse returns the inverse of k in GF(P)
crypto/elliptic.p256Curve
Package-Level Functions (total 12, in which 5 are exported)
GenerateKey generates a public and private key pair.
Sign signs a hash (which should be the result of hashing a larger message)
using the private key, priv. If the hash is longer than the bit-length of the
private key's curve order, the hash will be truncated to that length. It
returns the signature as a pair of integers. The security of the private key
depends on the entropy of rand.
SignASN1 signs a hash (which should be the result of hashing a larger message)
using the private key, priv. If the hash is longer than the bit-length of the
private key's curve order, the hash will be truncated to that length. It
returns the ASN.1 encoded signature. The security of the private key
depends on the entropy of rand.
Verify verifies the signature in r, s of hash using the public key, pub. Its
return value records whether the signature is valid.
VerifyASN1 verifies the ASN.1 encoded signature, sig, of hash using the
public key, pub. Its return value records whether the signature is valid.
fermatInverse calculates the inverse of k in GF(P) using Fermat's method.
This has better constant-time properties than Euclid's method (implemented
in math/big.Int.ModInverse) although math/big itself isn't strictly
constant-time so it's not perfect.
hashToInt converts a hash value to an integer. There is some disagreement
about how this is done. [NSA] suggests that this is done in the obvious
manner, but [SECG] truncates the hash to the bit-length of the curve order
first. We follow [SECG] because that's what OpenSSL does. Additionally,
OpenSSL right shifts excess bits from the number if the hash is too large
and we mirror that too.
randFieldElement returns a random element of the field underlying the given
curve using the procedure given in [NSA] A.2.1.
The pages are generated with Goldsv0.4.2. (GOOS=darwin GOARCH=amd64)
Golds is a Go 101 project developed by Tapir Liu.
PR and bug reports are welcome and can be submitted to the issue list.
Please follow @Go100and1 (reachable from the left QR code) to get the latest news of Golds.