-
Notifications
You must be signed in to change notification settings - Fork 30
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #25 from AntelopeIO/larryk85/crypto_ext
Merge PR #21 into main
- Loading branch information
Showing
7 changed files
with
356 additions
and
195 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,126 @@ | ||
| /** | ||
| * @file | ||
| * @copyright defined in cdt/LICENSE | ||
| */ | ||
| #pragma once | ||
| #include "types.h" | ||
| #ifdef __cplusplus | ||
| extern "C" { | ||
| #endif | ||
|
|
||
| /** | ||
| * @addtogroup crypto Crypto | ||
| * @brief Defines extension of %C API for calculating and checking hash which | ||
| * require activating crypto protocol feature | ||
| * @{ | ||
| */ | ||
|
|
||
| /** | ||
| * Hashes `data` using `sha3` and stores result in memory pointed to by hash. | ||
| * | ||
| * @param data - data you want to hash | ||
| * @param data_len - size of data | ||
| * @param hash - hash result | ||
| * @param hash_len - size of hash result | ||
| * @param keccak - whether to use `keccak` or NIST variant; keccak = 1 and NIST == 0 | ||
| * | ||
| */ | ||
| __attribute__((eosio_wasm_import)) | ||
| void sha3( const char* data, uint32_t data_len, char* hash, uint32_t hash_len, int32_t keccak ); | ||
|
|
||
| /** | ||
| * BLAKE2 compression function "F" | ||
| * https://eips.ethereum.org/EIPS/eip-152 | ||
| * | ||
| * @param rounds - the number of rounds | ||
| * @param state - state vector | ||
| * @param state_len - size of state vector | ||
| * @param msg - message block vector | ||
| * @param msg_len - size of message block vector | ||
| * @param t0_offset - offset counters | ||
| * @param t0_len - size of t0_offset | ||
| * @param t1_offset - offset counters | ||
| * @param t1_len - size of t1_offset | ||
| * @param final - final block flag | ||
| * @param result - the result of the compression | ||
| * @param result_len - size of result | ||
| * @return -1 if there is an error otherwise 0 | ||
| */ | ||
| __attribute__((eosio_wasm_import)) | ||
| int32_t blake2_f( uint32_t rounds, const char* state, uint32_t state_len, const char* msg, uint32_t msg_len, | ||
| const char* t0_offset, uint32_t t0_len, const char* t1_offset, uint32_t t1_len, int32_t final, char* result, uint32_t result_len); | ||
|
|
||
| /** | ||
| * Calculates the uncompressed public key used for a given signature on a given digest. | ||
| * | ||
| * @param sig - signature. | ||
| * @param sig_len - size of signature | ||
| * @param dig - digest of the message that was signed. | ||
| * @param dig_len - size of digest | ||
| * @param pub - public key result | ||
| * @param pub_len - size of public key result | ||
| * | ||
| * @return -1 if there was an error 0 otherwise. | ||
| */ | ||
| int32_t k1_recover( const char* sig, uint32_t sig_len, const char* dig, uint32_t dig_len, char* pub, uint32_t pub_len); | ||
|
|
||
| /** | ||
| * Addition operation on the elliptic curve `alt_bn128` | ||
| * | ||
| * @param op1 - operand 1 | ||
| * @param op1_len - size of operand 1 | ||
| * @param op2 - operand 2 | ||
| * @param op2_len - size of operand 2 | ||
| * @param result - result of the addition operation | ||
| * @param result_len - size of result | ||
| * @return -1 if there is an error otherwise 0 | ||
| */ | ||
| __attribute__((eosio_wasm_import)) | ||
| int32_t alt_bn128_add( const char* op1, uint32_t op1_len, const char* op2, uint32_t op2_len, char* result, uint32_t result_len); | ||
|
|
||
| /** | ||
| * Scalar multiplication operation on the elliptic curve `alt_bn128` | ||
| * | ||
| * @param g1 - G1 point | ||
| * @param g1_len - size of G1 point | ||
| * @param scalar - scalar factor | ||
| * @param scalar_len - size of scalar | ||
| * @param result - result of the scalar multiplication operation | ||
| * @param result_len - size of result | ||
| * @return -1 if there is an error otherwise 0 | ||
| */ | ||
| __attribute__((eosio_wasm_import)) | ||
| int32_t alt_bn128_mul( const char* g1, uint32_t g1_len, const char* scalar, uint32_t scalar_len, char* result, uint32_t result_len); | ||
|
|
||
| /** | ||
| * Optimal-Ate pairing check elliptic curve `alt_bn128` | ||
| * | ||
| * @param pairs - g1 and g2 pairs | ||
| * @param pairs_len - size of pairs | ||
| * @param result - result of the addition operation | ||
| * @return -1 if there is an error, 1 if false and 0 if true and successful | ||
| */ | ||
| __attribute__((eosio_wasm_import)) | ||
| int32_t alt_bn128_pair( const char* pairs, uint32_t pairs_len); | ||
|
|
||
| /** | ||
| * Big integer modular exponentiation | ||
| * returns an output ( BASE^EXP ) % MOD | ||
| * | ||
| * @param base - base of the exponentiation (BASE) | ||
| * @param base_len - size of base | ||
| * @param exp - exponent to raise to that power (EXP) | ||
| * @param exp_len - size of exp | ||
| * @param mod - modulus (MOD) | ||
| * @param mod_len - size of mod | ||
| * @param result - result of the modular exponentiation | ||
| * @param result_len - size of result | ||
| * @return -1 if there is an error otherwise 0 | ||
| */ | ||
| __attribute__((eosio_wasm_import)) | ||
| int32_t mod_exp( const char* base, uint32_t base_len, const char* exp, uint32_t exp_len, const char* mod, uint32_t mod_len, char* result, uint32_t result_len); | ||
|
|
||
| #ifdef __cplusplus | ||
| } | ||
| #endif | ||
| /// @} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.