Post
Topic
Board Development & Technical Discussion
Re: Euler's totient function algorithm compatible with SHA-256?
by
Killuminati1
on 30/01/2014, 09:15:04 UTC
Thx guys I understand RSA works better with larger prime integers and that there is a difference in functionality concerning Elliptic Curve Digital Signature Algorithm when processing using SHA-256. The reason I bring up the question concerning compatibility with public key encryption and signature using RSA and its association to the Euler's totient function is to determine if the size differences between RSA and ECDSA signatures could be resolved using faster computers and if so how this would effect the DNSSEC transmission of keys and signatures. The key size of the Elliptic curve needs to match the hash algorithm in order to prevent weaker halves of the signature from being attacked. So I guess what I was trying to ask is with faster computers in the future using Graphene chips if RSA could be utilized using SHA-256 and SHA-384 to speed up validation at the cost of slower ECDSA signing or would this weaken the signing algorithm to much using 3072 bit keys instead of 2048 bit keys? I understand that RSA is much slower with ECDSA signing but validation would greatly be increased by using RSA. I guess I should of explained what I was looking for a bit better before asking.

Super computers are just a few years out so instead of working with the limitations of what we currently have I wanted to see if there was a way to speed up validation using RSA and if this is possible hashing with SHA-256, if that makes any sense.