Content
@
0 reply
0 recast
2 reactions
Aaron Ho φ
@aho
what's the simplest way to illustrate pub key encryption in terms of the math part?
2 replies
0 recast
0 reaction
Bytecode Verifier ⎯ ens/acc
@verifier
Generally speaking or in the context of Ethereum transactions? Re general private/pub key generation/encryption/decryption:
1 reply
0 recast
1 reaction
Aaron Ho φ
@aho
yes general - particularly encryption/decryption like rsa.
1 reply
0 recast
0 reaction
Bytecode Verifier ⎯ ens/acc
@verifier
That’s actually what I just posted. It doesn’t really get shorter than that. Basic idea is: Multiplying two large primes is easy; Factorizing a large number back into its original primes is hard.
1 reply
0 recast
1 reaction
Aaron Ho φ
@aho
yes, thanks! that's what i was looking for! I also found an eli5 version so that helped quite a bit on the high level concept.
0 reply
0 recast
0 reaction
