constantine
secp256k1
constantine | secp256k1 | |
---|---|---|
14 | 10 | |
254 | 1,964 | |
- | 0.6% | |
8.4 | 8.9 | |
6 days ago | 7 days ago | |
Nim | C | |
GNU General Public License v3.0 or later | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
constantine
-
A beginner's guide to constant-time cryptography (2017)
Percival cache attacks on Hyperthreading.
I go over some examples here: https://github.com/mratsim/constantine/issues/358#issuecomme...
-
D Programming Language
`when myCondition():` instead of `if myCondition:` is done at compile-time.
Alternatively you can use a `static:` code block to force compile time evaluation. Or tag a function {.compileTime.} or tag function inputs with `static` modifier.
It is possible to create a compiler or an assembler running fully in Nim macros as well:
- https://github.com/mratsim/constantine/blob/master/constanti... (all that file runs at compile-time)
You can also implement Continuation-Passing-Style transformation at compile-time:
- Fast constant-time pairing or elliptic curve based cryptography (Nim/C)
-
Matrix Multiplication Using Only Addition
At a glance this sounds like a re-discovery of addition chains and using them to construct Pippenger algorithm. But applied to matrices instead of group elements.
See: https://github.com/mratsim/constantine/issues/37
-
Elliptic Curve Cryptography Explained
I usually explain extension fields as similar to complex numbers with regards to reals.
I've collected a lot of extension fields references while working on my own implementation: https://github.com/mratsim/constantine/tree/master/constanti...
The best likely being
- Arithmetic of Finite Fields
- Constant-Time Big Numbers: An Introduction
-
just a question that has been lingering on my mind
Regarding your first question, you don't need to attack the hard-drive, for non constant-time crypto you can read power consumption or electromagnetic traces when the secret key is used to reconstruct it: - https://github.com/mratsim/constantine/wiki/Constant-time-arithmetics
-
Const [pdf]
Unfortunate name collision with my constant-time pairing-based cryptography library :/.
https://github.com/mratsim/constantine
-
DSL for Zero Knowledge Proofs
KZG for sure yes, I actually already started implementing them: https://github.com/mratsim/constantine/tree/c2d716b/research/kzg_poly_commit
-
How is Elliptic Curve Cryptography Encryption Fast?
I have a small write-up on various details of elliptic curve crypto implementation here: https://github.com/mratsim/constantine/tree/master/constantine/elliptic
secp256k1
- Online Cryptography Course by Dan Boneh
-
Apple’s 2½ year old iPhone 12 is 6% faster than the new Samsung Galaxy S23 Ultra
Just yesterday I was trying to generate a vanity pub key for Nostr. I was using https://github.com/kdmukai/nostr_vanity_npub which uses the python-nostr library which in turn uses https://github.com/bitcoin-core/secp256k1.
The test (single thread with -j1 flag) has some interesting result. Time taken to calculate 1 million keys:
i7 8650U=2m5s,
-
Questions about generating a random number for ECDSA
However, I am trying to find the answer in the Bitcoin core source code, but it's kind of hard to read and could find an answer to it there.
-
My Summer of Bitcoin Journey [2022]
I will be working on a Schnorr batch verification interface for the libsecp256k1. For those unfamiliar with libsecp256k1, it is a library (written in C) used by Bitcoin Core for low-level cryptographic operations. Initially, this library was a personal project of Pieter Wuille, which was later integrated into Bitcoin Core. You can listen to this Chaincode podcast where he talks about the early developments of this library.
-
Usage Of Cryptonite Library In GHCJS
That's a binding to the C library https://github.com/bitcoin-core/secp256k1, so it causes the exact same issue OP had with Cryptonite.
-
Binary GCD
The binary GCD has inferior performance to other approaches for big numbers because those min() comparisons require that you had to update the entire numbers at each step.
I submitted a writeup on the safegcd algorithm used by libsecp256k1 a while back, but it got the HN zomg-bitcoin-related quick flagging: https://github.com/bitcoin-core/secp256k1/blob/master/doc/sa...
Safegcd-like functions requires somewhat more iterations but most of the iterations need to only operate on the least significant bits of the numbers, which makes them faster in practice.
For safegcd-ish functions proving a hard upper bound on the number of require iterations is non-trivial. But it's useful to prove the bound in order to make constant time versions. Here is a writeup on our techniques for proving the upper bounds: https://github.com/sipa/safegcd-bounds#bounds-on-divsteps-it...
-
Dev Meeting Transcript (May 28, 2021)
[4:23 PM] fdov: Soulless | Scamcoin.onlinehttps://github.com/bitcoin-core/secp256k1/issues/451
- How to use a library that was installed with autotools in a Makefile?
-
Sha-256 input data type
And the one from libsecp256k1 (which underlies Bitcoin) and is optimized for HMAC: - https://github.com/bitcoin-core/secp256k1/blob/master/src/hash_impl.h
-
We've come a long way! This is the load on my Raspberry Pi 4 validating a 6 hour streak of blocks on BCH's Scalenet (most of them 256MB) with 1100tx/s troughput. Cheers!
Just build and benckmark this https://github.com/bitcoin-core/secp256k1
What are some alternatives?
blst - Multilingual BLS12-381 signature library
cryptohash-sha256 - Fast, pure and practical SHA-256 implementation
nim-stint - Stack-based arbitrary-precision integers - Fast and portable with natural syntax for resource-restricted devices.
safegcd-bounds - Bounds on divsteps iterations in safegcd
noir - Noir is a domain specific language for zero knowledge proofs
Practical-Cryptography-for-Developers-Book - Practical Cryptography for Developers: Hashes, MAC, Key Derivation, DHKE, Symmetric and Asymmetric Ciphers, Public Key Cryptosystems, RSA, Elliptic Curves, ECC, secp256k1, ECDH, ECIES, Digital Signatures, ECDSA, EdDSA
RavenStash - Stash for Ravencoin-stuff.
mbedTLS - An open source, portable, easy to use, readable and flexible TLS library, and reference implementation of the PSA Cryptography API. Releases are on a varying cadence, typically around 3 - 6 months between releases.
Ravencoin - Ravencoin Core integration/staging tree
ecc - elliptic-curve cryptography
nostr_vanity_npub - Nostr vanity `npub` generator