Sambhav Dusad

fix: check email length <= max

2

resolves #70

# Description Implement pippenger scalar multiplication algorithm. ## Link to issue Closes #28 ## Type of change - [x] New feature (non-breaking change that adds functionality) - [x] Comments have...

This PR closes issue #132 It changes the following: - naming changes to RSA - encrypt and decrypt were panicking for large primes, so made pow explicit, and added a...

feat: Oblivious Transfer

1

Implement oblivious transfer and various extensions: - 1-out-of-2 OT - 1-n OT - k-n OT

feat: AEADs

1

Implement various popular AEADs: - [AES-GCM](https://nvlpubs.nist.gov/nistpubs/Legacy/SP/nistspecialpublication800-38d.pdf) - [ChaCha20Poly1305](https://datatracker.ietf.org/doc/html/rfc8439#section-2.5)

feat: symmetric cryptography primitives

1

- [x] #95 - [x] #98 - [x] #100 - [x] #96 - [x] #97

feat: Diffie-Hellman and elliptic curve DH

7

Since we have ECDSA now, it would be fascinating to see a toy implementation of Diffie-Hellman and ECDH. Resources: - https://web.math.ucsb.edu/~kylehansen/Papers/Elliptic_Curve_Cryptography.pdf - http://koclab.cs.ucsb.edu/teaching/ecc/project/2015Projects/Haakegaard+Lang.pdf - https://www.gabriel.urdhr.fr/2021/10/19/diffie-hellman-intro/

feat: Shamir's secret sharing

4

Resources: - https://web.mit.edu/6.857/OldStuff/Fall03/ref/Shamir-HowToShareASecret.pdf - https://decentralizedthoughts.github.io/2020-07-17-polynomial-secret-sharing-and-the-lagrange-basis/ - https://crypto.stanford.edu/cs355/19sp/lec6.pdf - [verifiable secret sharing](https://en.wikipedia.org/wiki/Verifiable_secret_sharing)?

(meta): polynomial interface

4

To make polynomial API ready enough for PLONK, we need following methods: - [x] #28 - [x] #29 - [ ] #30 - [x] #31 - [x] #32 - [...