Constant time pairing-based or elliptic curve based cryptography and digital signatures

Go to file

Mamy André-Ratsimbazafy b53f203e30 Fix raw uint serialization and start testing against GMP for 2000+bits bigints		2020-02-10 23:09:32 +01:00
constantine	Fix raw uint serialization and start testing against GMP for 2000+bits bigints	2020-02-10 23:09:32 +01:00
tests	Fix raw uint serialization and start testing against GMP for 2000+bits bigints	2020-02-10 23:09:32 +01:00
.gitignore	initial commit	2018-07-24 16:52:18 +02:00
LICENSE-APACHEv2	Switch to personal project -> update copyright	2020-02-08 11:42:35 +01:00
LICENSE-MIT	Switch to personal project -> update copyright	2020-02-08 11:42:35 +01:00
README.md	Switch to personal project -> update copyright	2020-02-08 11:42:35 +01:00
constantine.nim	Add modular reduce / bigint mod from 2 arbitrarily size bigint	2020-02-09 18:17:32 +01:00
constantine.nimble	Fix extended prec multiplication carry. Passing modulo tests against medium BigInt (192~256 bits)	2020-02-10 22:19:47 +01:00

README.md

Constantine - Constant time finite field primitives for Elliptic Curve Cryptography

This library provides constant time finite field primitives for implementation of elliptic curve cryptography.

Warning ⚠️: The library is in development state and cannot be used at the moment except as a showcase or to start a discussion on modular big integers internals.

Installation

You can install the developement version of the library through nimble with the following command

nimble install https://github.com/mratsim/constantine@#master

License

Licensed and distributed under either of

MIT license: LICENSE-MIT or http://opensource.org/licenses/MIT

Apache License, Version 2.0, (LICENSE-APACHEv2 or 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.