mirror of
https://github.com/logos-storage/constantine.git
synced 2026-01-03 05:33:07 +00:00
d376f08d1b
* Split elliptic curve tests to better use parallel testing * Add support for printing points on G2 * Implement multiplication and division by optimal sextic non-residue (BLS12-381) * Implement modular square root in 𝔽p2 * Support EC add and EC double on G2 (for BLS12-381) * Support G2 divisive twists with non-unit sextic-non-residue like BN254 snarks * Add EC G2 bench * cleanup some unused warnings * Reorg the tests for parallelization and to avoid instantiating huge files
71 lines
2.5 KiB
Nim
71 lines
2.5 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
|
|
./io_bigints,
|
|
../config/curves,
|
|
../arithmetic/finite_fields
|
|
|
|
# No exceptions allowed
|
|
{.push raises: [].}
|
|
{.push inline.}
|
|
|
|
# ############################################################
|
|
#
|
|
# Parsing from canonical inputs to internal representation
|
|
#
|
|
# ############################################################
|
|
|
|
func fromUint*(dst: var Fp,
|
|
src: SomeUnsignedInt) =
|
|
## Parse a regular unsigned integer
|
|
## and store it into a BigInt of size `bits`
|
|
let raw {.noinit.} = (type dst.mres).fromRawUint(cast[array[sizeof(src), byte]](src), cpuEndian)
|
|
dst.fromBig(raw)
|
|
|
|
func exportRawUint*(dst: var openarray[byte],
|
|
src: Fp,
|
|
dstEndianness: static Endianness) =
|
|
## Serialize a finite field element to its canonical big-endian or little-endian
|
|
## representation
|
|
## With `bits` the number of bits of the field modulus
|
|
## a buffer of size "(bits + 7) div 8" at minimum is needed
|
|
## i.e. bits -> byte conversion rounded up
|
|
##
|
|
## If the buffer is bigger, output will be zero-padded left for big-endian
|
|
## or zero-padded right for little-endian.
|
|
## I.e least significant bit is aligned to buffer boundary
|
|
exportRawUint(dst, src.toBig(), dstEndianness)
|
|
|
|
func appendHex*(dst: var string, f: Fp, order: static Endianness = bigEndian) =
|
|
## Stringify a finite field element to hex.
|
|
## Note. Leading zeros are not removed.
|
|
## Result is prefixed with 0x
|
|
##
|
|
## Output will be padded with 0s to maintain constant-time.
|
|
##
|
|
## CT:
|
|
## - no leaks
|
|
dst.appendHex(f.toBig(), order)
|
|
|
|
func toHex*(f: Fp, order: static Endianness = bigEndian): string =
|
|
## Stringify a finite field element to hex.
|
|
## Note. Leading zeros are not removed.
|
|
## Result is prefixed with 0x
|
|
##
|
|
## Output will be padded with 0s to maintain constant-time.
|
|
##
|
|
## CT:
|
|
## - no leaks
|
|
result.appendHex(f, order)
|
|
|
|
func fromHex*(dst: var Fp, s: string) {.raises: [ValueError].}=
|
|
## Convert a hex string to a element of Fp
|
|
let raw {.noinit.} = fromHex(dst.mres.typeof, s)
|
|
dst.fromBig(raw)
|