It's nearly impossible to compare security. Comparing security means breaking the cipher of real-life size of the key. Do you have any idea how much resources it may take? :-)
Come to think about, the possibility of easy experimental comparison would present a back door (please see the reference below) to the algorithm which is thought to be impossible and would mean the cipher is broken. Isn't that logical? :-)
Now, comparison in performance is absolutely easy. You just use both algorithm for ciphering/deciphering or digital digital signature/validation and simple time key generation and those procedures.
See for more information:
http://en.wikipedia.org/wiki/Elliptic_curve_cryptography[
^],
http://en.wikipedia.org/wiki/RSS[
^], see also the references to these articles.
More theoretical knowledge on the basis of related cryptography topics:
one-way function:
http://en.wikipedia.org/wiki/One-way_function[
^],
back door:
http://en.wikipedia.org/wiki/Backdoor_(computing)[
^],
public-key cryptography:
http://en.wikipedia.org/wiki/Public-key_cryptography[
^].
Please be advised that normally CodeProject members are not supposed (and usually not interested) to write any code on your request. The nature of your Question requires some hours of work in order to provide the code you need. You can use, for example, C++ implementation of RSA and ECC:
http://en.wikipedia.org/wiki/Crypto%2B%2B[
^]. When you have the implemented algorithms, your research of the timing comparison will be easy enough. You can write you research code and ask follow-up Questions if you face any problems.
—SA
Submit an article or tip