Tore Frederiksen

@micwallace thanks for the good work! I think that both of them still need a `notBefore` and `notAfter` timestamp. I think the NFT attestation also needs some context variabel, to...

`notBefore` is not strictly needed if the server is guaranteed to be honest and _always_ have a correct clock set. It is more an issue if the server the issuer...

One more thing; We might want to include a `algorithmIdentifier` to allow for usage of different types of signing keys.

1. Yes, definitely! The code I am writing for this does not even know of the existence of `GeneralizedTime` ;) 2. Good idea! Let us keep things as general as...

65537 is the safest. If we use a proper padding scheme for signing then 3 should also be ok

BTW 65537 should no be hugely more expensive than 3 if proper optimisations are in place. See [here](https://www.johndcook.com/blog/2018/11/27/fermat-primes/)

> I have made some progress for gas optimization > > * VerifyLinkAttestation: "319355" > Before: 319355 > Now: 277258 (around 25000 save from removing console.log) > * RSAVerification(1024bit -...

Ah, I see. Then maybe we just stick with the 65537 exponent :)

As an alternative we could consider using an even smaller key. The largest known factoring is of 830 bits and that took 2500 core years (based on a Intel Xeon...

However I think that cutting off more than 256 bits is not a good idea. So I am not sure if things will be much faster with a 768 modulus?