status-im
/
constantine
mirror of https://github.com/status-im/constantine.git
2
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

remove static/constant constraint on Montgomery

This commit is contained in:
Mamy Ratsimbazafy 2023-01-28 18:25:30 +01:00
parent ff8c26c1fe
commit 915f89fdd6
No known key found for this signature in database
GPG Key ID: 6227262F49BE273A
1 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
constantine/math/arithmetic/bigints_montgomery.nim
View File

@ -50,7 +50,7 @@ func fromMont*[mBits](r: var BigInt[mBits], a, M: BigInt[mBits], m0ninv: BaseTyp
## the natural and montgomery domain. ## the natural and montgomery domain.
fromMont(r.limbs, a.limbs, M.limbs, m0ninv, spareBits) fromMont(r.limbs, a.limbs, M.limbs, m0ninv, spareBits)
func mulMont*(r: var BigInt, a, b, M: BigInt, negInvModWord: static BaseType, func mulMont*(r: var BigInt, a, b, M: BigInt, negInvModWord: BaseType,
spareBits: static int, skipFinalSub: static bool = false) = spareBits: static int, skipFinalSub: static bool = false) =
## Compute r <- a*b (mod M) in the Montgomery domain ## Compute r <- a*b (mod M) in the Montgomery domain
## ##
@ -58,7 +58,7 @@ func mulMont*(r: var BigInt, a, b, M: BigInt, negInvModWord: static BaseType,
## to avoid duplicating with Nim zero-init policy ## to avoid duplicating with Nim zero-init policy
mulMont(r.limbs, a.limbs, b.limbs, M.limbs, negInvModWord, spareBits, skipFinalSub) mulMont(r.limbs, a.limbs, b.limbs, M.limbs, negInvModWord, spareBits, skipFinalSub)
func squareMont*(r: var BigInt, a, M: BigInt, negInvModWord: static BaseType, func squareMont*(r: var BigInt, a, M: BigInt, negInvModWord: BaseType,
spareBits: static int, skipFinalSub: static bool = false) = spareBits: static int, skipFinalSub: static bool = false) =
## Compute r <- a^2 (mod M) in the Montgomery domain ## Compute r <- a^2 (mod M) in the Montgomery domain
## ##
@ -69,7 +69,7 @@ func squareMont*(r: var BigInt, a, M: BigInt, negInvModWord: static BaseType,
func sumprodMont*[N: static int]( func sumprodMont*[N: static int](
r: var BigInt, r: var BigInt,
a, b: array[N, BigInt], a, b: array[N, BigInt],
M: BigInt, negInvModWord: static BaseType, M: BigInt, negInvModWord: BaseType,
spareBits: static int, skipFinalSub: static bool = false) = spareBits: static int, skipFinalSub: static bool = false) =
## Compute r <- ⅀aᵢ.bᵢ (mod M) (sum of products) in the Montgomery domain ## Compute r <- ⅀aᵢ.bᵢ (mod M) (sum of products) in the Montgomery domain
# We rely on BigInt and Limbs having the same repr to avoid array copies # We rely on BigInt and Limbs having the same repr to avoid array copies
@ -77,12 +77,12 @@ func sumprodMont*[N: static int](
r.limbs, r.limbs,
cast[ptr array[N, typeof(a[0].limbs)]](a.unsafeAddr)[], cast[ptr array[N, typeof(a[0].limbs)]](a.unsafeAddr)[],
cast[ptr array[N, typeof(b[0].limbs)]](b.unsafeAddr)[], cast[ptr array[N, typeof(b[0].limbs)]](b.unsafeAddr)[],
M.limbs, negInvModWord, spareBits, skipFinalSub M.limbs, negInvModWord, spareBits, skipFinalSub
) )
func powMont*[mBits: static int]( func powMont*[mBits: static int](
a: var BigInt[mBits], exponent: openarray[byte], a: var BigInt[mBits], exponent: openarray[byte],
M, one: BigInt[mBits], negInvModWord: static BaseType, windowSize: static int, M, one: BigInt[mBits], negInvModWord: BaseType, windowSize: static int,
spareBits: static int spareBits: static int
) = ) =
## Compute a <- a^exponent (mod M) ## Compute a <- a^exponent (mod M)
@ -106,7 +106,7 @@ func powMont*[mBits: static int](
func powMontUnsafeExponent*[mBits: static int]( func powMontUnsafeExponent*[mBits: static int](
a: var BigInt[mBits], exponent: openarray[byte], a: var BigInt[mBits], exponent: openarray[byte],
M, one: BigInt[mBits], negInvModWord: static BaseType, windowSize: static int, M, one: BigInt[mBits], negInvModWord: BaseType, windowSize: static int,
spareBits: static int spareBits: static int
) = ) =
## Compute a <- a^exponent (mod M) ## Compute a <- a^exponent (mod M)
@ -130,7 +130,7 @@ func powMontUnsafeExponent*[mBits: static int](
func powMont*[mBits, eBits: static int]( func powMont*[mBits, eBits: static int](
a: var BigInt[mBits], exponent: BigInt[eBits], a: var BigInt[mBits], exponent: BigInt[eBits],
M, one: BigInt[mBits], negInvModWord: static BaseType, windowSize: static int, M, one: BigInt[mBits], negInvModWord: BaseType, windowSize: static int,
spareBits: static int spareBits: static int
) = ) =
## Compute a <- a^exponent (mod M) ## Compute a <- a^exponent (mod M)
@ -149,7 +149,7 @@ func powMont*[mBits, eBits: static int](
func powMontUnsafeExponent*[mBits, eBits: static int]( func powMontUnsafeExponent*[mBits, eBits: static int](
a: var BigInt[mBits], exponent: BigInt[eBits], a: var BigInt[mBits], exponent: BigInt[eBits],
M, one: BigInt[mBits], negInvModWord: static BaseType, windowSize: static int, M, one: BigInt[mBits], negInvModWord: BaseType, windowSize: static int,
spareBits: static int spareBits: static int
) = ) =
## Compute a <- a^exponent (mod M) ## Compute a <- a^exponent (mod M)