Crypto

Hashing

The built-in enum HashAlgorithm provides the set of hashing algorithms that are supported by the language natively.

1
pub enum HashAlgorithm: UInt8 {
2
/// SHA2_256 is SHA-2 with a 256-bit digest (also referred to as SHA256).
3
pub case SHA2_256 = 1
4
5
/// SHA2_384 is SHA-2 with a 384-bit digest (also referred to as SHA384).
6
pub case SHA2_384 = 2
7
8
/// SHA3_256 is SHA-3 with a 256-bit digest.
9
pub case SHA3_256 = 3
10
11
/// SHA3_384 is SHA-3 with a 384-bit digest.
12
pub case SHA3_384 = 4
13
14
/// KMAC128_BLS_BLS12_381 is an instance of KECCAK Message Authentication Code (KMAC128) mac algorithm.
15
/// Although this is a MAC algorithm, KMAC is included in this list as it can be used hash
16
/// when the key is used a non-public customizer.
17
/// KMAC128_BLS_BLS12_381 is used in particular as the hashing algorithm for the BLS signature scheme on the curve BLS12-381.
18
/// It is a customized version of KMAC128 that is compatible with the hashing to curve
19
/// used in BLS signatures.
20
/// It is the same hasher used by signatures in the internal Flow protocol.
21
pub case KMAC128_BLS_BLS12_381 = 5
22
23
/// KECCAK_256 is the legacy Keccak algorithm with a 256-bits digest, as per the original submission to the NIST SHA3 competition.
24
/// KECCAK_256 is different than SHA3 and is used by Ethereum.
25
pub case KECCAK_256 = 6
26
27
/// Returns the hash of the given data
28
pub fun hash(_ data: [UInt8]): [UInt8]
29
30
/// Returns the hash of the given data and tag
31
pub fun hashWithTag(_ data: [UInt8], tag: string): [UInt8]
32
}

The hash algorithms provide two ways to hash input data into digests, hash and hashWithTag.

Hashing

hash hashes the input data using the chosen hashing algorithm. KMAC is the only MAC algorithm on the list and configured with specific parameters (detailed in KMAC128 for BLS)

For example, to compute a SHA3-256 digest:

1
let data: [UInt8] = [1, 2, 3]
2
let digest = HashAlgorithm.SHA3_256.hash(data)

Hashing with a domain tag

hashWithTag hashes the input data along with an input tag. It allows instanciating independent hashing functions customized with a domain separation tag (DST). For most of the hashing algorithms, mixing the data with the tag is done by pre-fixing the data with the tag and hashing the result.

  • SHA2_256, SHA2_384, SHA3_256, SHA3_384, KECCAK_256: If the tag is non-empty, the hashed message is bytes(tag) || data where bytes() is the UTF-8 encoding of the input string, padded with zeros till 32 bytes. Therefore tags must not exceed 32 bytes. If the tag used is empty, no data prefix is applied, and the hashed message is simply data (same as hash output).
  • KMAC128_BLS_BLS12_381: refer to KMAC128 for BLS for details.

KMAC128 for BLS

KMAC128_BLS_BLS12_381 is an instance of the cSHAKE-based KMAC128. Although this is a MAC algorithm, KMAC can be used as a hash when the key is used as a non-private customizer. KMAC128_BLS_BLS12_381 is used in particular as the hashing algorithm for the BLS signature scheme on the curve BLS12-381. It is a customized instance of KMAC128 and is compatible with the hashing to curve used by BLS signatures. It is the same hasher used by the internal Flow protocol, and can be used to verify Flow protocol signatures on-chain.

To define the MAC instance, KMAC128(customizer, key, data, length) is instanciated with the following parameters (as referred to by the NIST SHA-3 Derived Functions):

  • customizer is the UTF-8 encoding of "H2C".
  • key is the UTF-8 encoding of "FLOW--V00-CS00-with-BLS_SIG_BLS12381G1_XOF:KMAC128_SSWU_RO_POP_" when hash is used. It includes the input tag when hashWithTag is used and key becomes the UTF-8 encoding of "FLOW-" || tag || "-V00-CS00-with-BLS_SIG_BLS12381G1_XOF:KMAC128_SSWU_RO_POP_".
  • data is the input data to hash.
  • length is 1024 bytes.

Signing Algorithms

The built-in enum SignatureAlgorithm provides the set of signing algorithms that are supported by the language natively.

1
pub enum SignatureAlgorithm: UInt8 {
2
/// ECDSA_P256 is ECDSA on the NIST P-256 curve.
3
pub case ECDSA_P256 = 1
4
5
/// ECDSA_secp256k1 is ECDSA on the secp256k1 curve.
6
pub case ECDSA_secp256k1 = 2
7
8
/// BLS_BLS12_381 is BLS signature scheme on the BLS12-381 curve.
9
/// The scheme is set-up so that signatures are in G_1 (subgroup of the curve over the prime field)
10
/// while public keys are in G_2 (subgroup of the curve over the prime field extension).
11
pub case BLS_BLS12_381 = 3
12
}

PublicKey

PublicKey is a built-in structure that represents a cryptographic public key of a signature scheme.

1
struct PublicKey {
2
let publicKey: [UInt8]
3
let signatureAlgorithm: SignatureAlgorithm
4
5
/// Verifies a signature under the given tag, data and public key.
6
/// It uses the given hash algorithm to hash the tag and data.
7
pub fun verify(
8
signature: [UInt8],
9
signedData: [UInt8],
10
domainSeparationTag: String,
11
hashAlgorithm: HashAlgorithm
12
): Bool
13
14
/// Verifies the proof of possession of the private key.
15
/// This function is only implemented if the signature algorithm
16
/// of the public key is BLS (BLS_BLS12_381).
17
/// If called with any other signature algorithm, the program aborts
18
pub fun verifyPoP(_ proof: [UInt8]): Bool
19
}

PublicKey supports two methods verify and verifyPoP. verifyPoP will be covered under BLS multi-signature.

Public Key construction

A PublicKey can be constructed using the raw key and the signing algorithm.

1
let publicKey = PublicKey(
2
publicKey: "010203".decodeHex(),
3
signatureAlgorithm: SignatureAlgorithm.ECDSA_P256
4
)

The raw key value depends on the supported signature scheme:

  • ECDSA_P256 and ECDSA_secp256k1: The public key is an uncompressed curve point (X,Y) where X and Y are two prime field elements. The raw key is represented as bytes(X) || bytes(Y), where || is the concatenation operation, and bytes() is the bytes big-endian encoding left padded by zeros to the byte-length of the field prime. The raw public key is 64-bytes long.

  • BLS_BLS_12_381: The public key is a G_2 (curve over the prime field extension) element. The encoding follows the compressed serialization defined in the IETF draft-irtf-cfrg-pairing-friendly-curves-08. A public key is 96-bytes long.

Public Key validation

A public key is validated at the time of creation. Only valid public keys can be created. The validation of the public key depends on the supported signature scheme:

  • ECDSA_P256 and ECDSA_secp256k1: The given X and Y coordinates are correctly serialized, represent valid prime field elements, and the resulting point is on the correct curve (no subgroup check needed since the cofactor of both supported curves is 1).

  • BLS_BLS_12_381: The given key is correctly serialized following the compressed serialization in IETF draft-irtf-cfrg-pairing-friendly-curves-08. The coordinates represent valid prime field extension elemnents. The resulting point is on the curve, and is on the correct subgroup G_2.

Since the validation happen only at the time of creation, public keys are immutable.

1
publicKey.signatureAlgorithm = SignatureAlgorithm.ECDSA_secp256k1 // Not allowed
2
publicKey.publicKey = [] // Not allowed
3
4
publicKey.publicKey[2] = 4 // No effect

Invalid public keys cannot be constructed so public keys are always valid.

Signature verification

A signature can be verified using the verify function of the PublicKey:

1
let pk = PublicKey(
2
publicKey: "96142CE0C5ECD869DC88C8960E286AF1CE1B29F329BA4964213934731E65A1DE480FD43EF123B9633F0A90434C6ACE0A98BB9A999231DB3F477F9D3623A6A4ED".decodeHex(),
3
signatureAlgorithm: SignatureAlgorithm.ECDSA_P256
4
)
5
6
let signature = "108EF718F153CFDC516D8040ABF2C8CC7AECF37C6F6EF357C31DFE1F7AC79C9D0145D1A2F08A48F1A2489A84C725D6A7AB3E842D9DC5F8FE8E659FFF5982310D".decodeHex()
7
let message : [UInt8] = [1, 2, 3]
8
9
let isValid = pk.verify(
10
signature: signature,
11
signedData: message,
12
domainSeparationTag: "",
13
hashAlgorithm: HashAlgorithm.SHA2_256
14
)
15
// `isValid` is false

The inputs to verify depend on the signature scheme used:

  • ECDSA (ECDSA_P256 and ECDSA_secp256k1):
    • signature expects the couple (r,s). It is serialized as bytes(r) || bytes(s), where || is the concatenation operation, and bytes() is the bytes big-endian encoding left padded by zeros to the byte-length of the curve order. The signature is 64 bytes-long for both curves.
    • signedData is the arbitrary message to verify the signature against.
    • domainSeparationTag is the expected domain tag. Multiple valid tag values can be used (check hashWithTag for more details).
    • hashAlgorithm is either SHA2_256, SHA3_256 or KECCAK_256. It is the algorithm used to hash the message along with the given tag (check the hashWithTagfunction for more details).

As noted in hashWithTag for SHA2_256, SHA3_256 and KECCAK_256, using an empty tag results in hashing the input data only. If a signature verification needs to be done against data without any domain tag, this can be done by using an empty domain tag "".

ECDSA verification is implemented as defined in ANS X9.62 (also referred by FIPS 186-4 and SEC 1, Version 2.0). A valid signature would be generated using the expected signedData, domainSeparationTag and hashAlgorithm used to verify.

  • BLS (BLS_BLS_12_381):
    • signature expects a G_1 (subgroup of the curve over the prime field) point. The encoding follows the compressed serialization defined in the IETF draft-irtf-cfrg-pairing-friendly-curves-08. A signature is 48-bytes long.
    • signedData is the arbitrary message to verify the signature against.
    • domainSeparationTag is the expected domain tag. All tags are accepted (check KMAC128 for BLS).
    • hashAlgorithm only accepts KMAC128_BLS_BLS12_381. It is the algorithm used to hash the message along with the given tag (check KMAC128 for BLS).

BLS verification performs the necessary membership check of the signature while the membership check of the public key is performed at the creation of the PublicKey object and not repeated during the signature verification.

The verificaction uses a hash-to-curve algorithm to hash the signedData into a G_1 point, following the hash_to_curve method described in the draft-irtf-cfrg-hash-to-curve-14. While KMAC128 is used as a hash-to-field method resulting in two field elements, the mapping to curve is implemented using the simplified SWU.

A valid signature would be generated using the expected signedData and domainSeparationTag, as well the same hashing to curve process.

BLS multi-signature

BLS signature scheme allows efficient multi-signature features. Multiple signatures can be aggregated into a single signature which can be verified against an aggregated public key. This allows authenticating multiple signers with a single signature verification. While BLS provides multiple aggregation techniques, Cadence supports basic aggregation tools that cover a wide list of use-cases. These tools are defined in the built-in BLS contract, which does not need to be imported.

Proof of Possession (PoP)

Multi-signature verification in BLS requires a defense against rogue public-key attacks. Multiple ways are available to protect BLS verification. The language provides the proof of possession of private key as a defense tool. The proof of possession of private key is a BLS signature over the public key itself. The PoP signature follows the same requirements of a BLS signature (detailed in Signature verification), except it uses a special domain separation tag. The key expected to be used in KMAC128 is the UTF-8 encoding of "BLS_POP_BLS12381G1_XOF:KMAC128_SSWU_RO_POP_". The expected message to be signed by the PoP is the serialization of the BLS public key corresponding to the signing private key (serialization details). The PoP can only be verified using the PublicKey method verifyPoP.

BLS signature aggregation

cadenceā€¢fun aggregateSignatures(_ signatures: [[UInt8]]): [UInt8]?

Aggregates multiple BLS signatures into one. Signatures could be generated from the same or distinct messages, they could also be the aggregation of other signatures. The order of the signatures in the slice does not matter since the aggregation is commutative. There is no subgroup membership check performed on the input signatures. If the array is empty or if decoding one of the signature fails, the program aborts

The output signature can be verified against an aggregated public key to authenticate multiple signers at once. Since the verify method accepts a single data to verify against, it is only possible to verfiy multiple signatures of the same message.

BLS public key aggregation

cadenceā€¢fun aggregatePublicKeys(_ publicKeys: [PublicKey]): PublicKey?

Aggregates multiple BLS public keys into one.

The order of the public keys in the slice does not matter since the aggregation is commutative. The input keys are guaranteed to be in the correct subgroup since subgroup membership is checked at the key creation time. If the array is empty or any of the input keys is not a BLS key, the program aborts

The output public key can be used to verify aggregated signatures to authenticate multiple signers at once. Since the verify method accepts a single data to verify against, it is only possible to verfiy multiple signatures of the same message.

Crypto Contract

The built-in contract Crypto can be used to perform cryptographic operations. The contract can be imported using import Crypto.

Key Lists

The crypto contract also allows creating key lists to be used for multi-signature verification. For example, to verify two signatures with equal weights for some signed data:

1
import Crypto
2
3
pub fun test main() {
4
let keyList = Crypto.KeyList()
5
6
let publicKeyA = PublicKey(
7
publicKey:
8
"db04940e18ec414664ccfd31d5d2d4ece3985acb8cb17a2025b2f1673427267968e52e2bbf3599059649d4b2cce98fdb8a3048e68abf5abe3e710129e90696ca".decodeHex(),
9
signatureAlgorithm: SignatureAlgorithm.ECDSA_P256
10
)
11
keyList.add(
12
publicKeyA,
13
hashAlgorithm: HashAlgorithm.SHA3_256,
14
weight: 0.5
15
)
16
17
let publicKeyB = PublicKey(
18
publicKey:
19
"df9609ee588dd4a6f7789df8d56f03f545d4516f0c99b200d73b9a3afafc14de5d21a4fc7a2a2015719dc95c9e756cfa44f2a445151aaf42479e7120d83df956".decodeHex(),
20
signatureAlgorithm: SignatureAlgorithm.ECDSA_P256
21
)
22
keyList.add(
23
publicKeyB,
24
hashAlgorithm: HashAlgorithm.SHA3_256,
25
weight: 0.5
26
)
27
28
let signatureSet = [
29
Crypto.KeyListSignature(
30
keyIndex: 0,
31
signature:
32
"8870a8cbe6f44932ba59e0d15a706214cc4ad2538deb12c0cf718d86f32c47765462a92ce2da15d4a29eb4e2b6fa05d08c7db5d5b2a2cd8c2cb98ded73da31f6".decodeHex()
33
),
34
Crypto.KeyListSignature(
35
keyIndex: 1,
36
signature:
37
"bbdc5591c3f937a730d4f6c0a6fde61a0a6ceaa531ccb367c3559335ab9734f4f2b9da8adbe371f1f7da913b5a3fdd96a871e04f078928ca89a83d841c72fadf".decodeHex()
38
)
39
]
40
41
// "foo", encoded as UTF-8, in hex representation
42
let signedData = "666f6f".decodeHex()
43
44
let isValid = keyList.verify(
45
signatureSet: signatureSet,
46
signedData: signedData
47
)
48
}

The API of the Crypto contract related to key lists is:

1
pub struct KeyListEntry {
2
pub let keyIndex: Int
3
pub let publicKey: PublicKey
4
pub let hashAlgorithm: HashAlgorithm
5
pub let weight: UFix64
6
pub let isRevoked: Bool
7
8
init(
9
keyIndex: Int,
10
publicKey: PublicKey,
11
hashAlgorithm: HashAlgorithm,
12
weight: UFix64,
13
isRevoked: Bool
14
)
15
}
16
17
pub struct KeyList {
18
19
init()
20
21
/// Adds a new key with the given weight
22
pub fun add(
23
_ publicKey: PublicKey,
24
hashAlgorithm: HashAlgorithm,
25
weight: UFix64
26
)
27
28
/// Returns the key at the given index, if it exists.
29
/// Revoked keys are always returned, but they have `isRevoked` field set to true
30
pub fun get(keyIndex: Int): KeyListEntry?
31
32
/// Marks the key at the given index revoked, but does not delete it
33
pub fun revoke(keyIndex: Int)
34
35
/// Returns true if the given signatures are valid for the given signed data
36
pub fun verify(
37
signatureSet: [KeyListSignature],
38
signedData: [UInt8]
39
): Bool
40
}
41
42
pub struct KeyListSignature {
43
pub let keyIndex: Int
44
pub let signature: [UInt8]
45
46
pub init(keyIndex: Int, signature: [UInt8])
47
}