mirror of
https://github.com/logos-storage/constantine.git
synced 2026-01-02 21:23:11 +00:00
14af7e8724
* Add specific fromMont conversion routine. Rename montyResidue to getMont * missed test file * Add x86_64 ASM for fromMont * Add x86_64 MULX/ADCX/ADOX for fromMont * rework Montgomery Multiplication with prefetch/latency hiding techniques * Fix ADX autodetection, closes #174. Rollback faster mul_mont attempt, no improvement and debug pain. * finalSub in fromMont & adx_bmi -> adx * Some {.noInit.} to avoid Nim zeroMem (which should be optimized away but who knows) * Uniformize name 'op+domain': mulmod - mulmont * Fix asm codegen bug "0x0000555555565930 <+896>: sbb 0x20(%r8),%r8" with Clang in final substraction * Prepare for skipping final substraction * Don't forget to copy the result when we skip the final substraction * Seems like we need to stash the idea of skipping the final substraction for now, needs bounds analysis https://eprint.iacr.org/2017/1057.pdf * fix condition for ASM 32-bit * optim modular addition when sparebit is available
66 lines
1.8 KiB
Nim
66 lines
1.8 KiB
Nim
# Constantine
|
||
# Copyright (c) 2018-2019 Status Research & Development GmbH
|
||
# Copyright (c) 2020-Present Mamy André-Ratsimbazafy
|
||
# Licensed and distributed under either of
|
||
# * MIT license (license terms in the root directory or at http://opensource.org/licenses/MIT).
|
||
# * Apache v2 license (license terms in the root directory or at http://www.apache.org/licenses/LICENSE-2.0).
|
||
# at your option. This file may not be copied, modified, or distributed except according to those terms.
|
||
|
||
import
|
||
# Internals
|
||
../constantine/config/[curves, common],
|
||
../constantine/arithmetic,
|
||
../constantine/io/io_bigints,
|
||
../constantine/curves/zoo_square_roots,
|
||
# Helpers
|
||
../helpers/static_for,
|
||
./bench_fields_template
|
||
|
||
# ############################################################
|
||
#
|
||
# Benchmark of 𝔽p
|
||
#
|
||
# ############################################################
|
||
|
||
|
||
const Iters = 100_000
|
||
const ExponentIters = 100
|
||
const AvailableCurves = [
|
||
# P224,
|
||
BN254_Nogami,
|
||
BN254_Snarks,
|
||
Curve25519,
|
||
Bandersnatch,
|
||
P256,
|
||
Secp256k1,
|
||
BLS12_377,
|
||
BLS12_381,
|
||
BW6_761
|
||
]
|
||
|
||
proc main() =
|
||
separator()
|
||
staticFor i, 0, AvailableCurves.len:
|
||
const curve = AvailableCurves[i]
|
||
addBench(Fp[curve], Iters)
|
||
subBench(Fp[curve], Iters)
|
||
negBench(Fp[curve], Iters)
|
||
ccopyBench(Fp[curve], Iters)
|
||
div2Bench(Fp[curve], Iters)
|
||
mulBench(Fp[curve], Iters)
|
||
sqrBench(Fp[curve], Iters)
|
||
smallSeparator()
|
||
toBigBench(Fp[curve], Iters)
|
||
toFieldBench(Fp[curve], Iters)
|
||
smallSeparator()
|
||
invBench(Fp[curve], ExponentIters)
|
||
sqrtBench(Fp[curve], ExponentIters)
|
||
sqrtRatioBench(Fp[curve], ExponentIters)
|
||
# Exponentiation by a "secret" of size ~the curve order
|
||
powBench(Fp[curve], ExponentIters)
|
||
powUnsafeBench(Fp[curve], ExponentIters)
|
||
separator()
|
||
|
||
main()
|
||
notes()
|