Procedural macro for fixed-exponent variable-base modular exponentiation

Uses the addchain crate to obtain an addition chain for the exponent,
and then generates the corresponding constant-time square-and-multiply
algorithm.
This commit is contained in:
Jack Grigg
2019-12-19 22:10:10 -06:00
parent 2df2a2b2f2
commit 232fb4b7a3
4 changed files with 75 additions and 1 deletions

View File

@@ -1,7 +1,10 @@
[package]
name = "ff_derive"
version = "0.6.0"
authors = ["Sean Bowe <ewillbefull@gmail.com>"]
authors = [
"Sean Bowe <ewillbefull@gmail.com>",
"Jack Grigg <thestr4d@gmail.com>",
]
description = "Procedural macro library used to build custom prime field implementations"
documentation = "https://docs.rs/ff/"
homepage = "https://github.com/ebfull/ff"
@@ -13,6 +16,7 @@ edition = "2018"
proc-macro = true
[dependencies]
addchain = "0.1"
num-bigint = "0.2"
num-traits = "0.2"
num-integer = "0.1"