Practical-Cryptography-for-Developers-Book VS constantine

He has written numerous free books in the fields of blockchain, programming languages, cybersecurity, and computational linguistics, and Svetlin Nakov [4] (alias Satoshi Nakamoto) was Awarded a Doctor of Philosophy(Ph.D) Degree in Informatics of Bulgarian Academy of Sciences (2010)/B.A.S. official website[5] / More info about B.A.S.[2]).He (Nakamoto - Svetlin Nakov) is about to finish his work in Cryptography For Developers[7], which he publishes in stages in Guthub[8]...Practical Cryptography for Developers is a modern practical open source (github) book about cryptography for developers with code examples, covering core concepts like:hashes[9] (SHA-3 [10] and BLAKE)**2** [19]#BLAKE2), MAC codes (like Hash-based message authentication code/HMAC/ and Galois Message Authentication Code (GMAC)[11], key derivation functions (like scrypt**,** Argon2), Key-agreement protocol s (like Diffie–Hellman key exchange (DHKE), Elliptic curve Diffie–Hellman, symmetric ciphers (like Advanced Encryption Standard (AES) and Salsa20, cipher block modes, authenticated encryption, Authenticated encryption (AEAD), Cipher suite (AES-GCM), ChaCha20-Poly1305 [12], Binary relation, asymetric ciphers[13] and public-key cryptosystems [RSA), Elliptic curve cryptography (ECC), Integrated Encryption Scheme (ECIES), I-SECG elliptic curve sect256k1, Curve25519), digital signatures (ECDSA [14] and EdDSA [15]), secure random numbers (PRNG [16],**CSRNG quantum-safe (quantum resistant) cryptography DApps,** Solidity**,** InterPlanetary File System (IPFS) by Svetlin Nakov and SoftUni Team, 2018, ISBN 978-619-00-0802-6.

https://github.com/nakov/Practical-Cryptography-for-Develope...

Similarly, the Java section essentially mentions a single, obscure library besides the JCE and Bouncy Castle:

Percival cache attacks on Hyperthreading.

I go over some examples here: https://github.com/mratsim/constantine/issues/358#issuecomme...

`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:

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

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

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

Unfortunate name collision with my constant-time pairing-based cryptography library :/.

https://github.com/mratsim/constantine

KZG for sure yes, I actually already started implementing them: https://github.com/mratsim/constantine/tree/c2d716b/research/kzg_poly_commit

I have a small write-up on various details of elliptic curve crypto implementation here: https://github.com/mratsim/constantine/tree/master/constantine/elliptic