Dray Lacy

The math in the Wikipedia article is a little impenetrable, but I think we may be able to calculate this as `key.group.order.num_bits`. This is made trickier by the apparent fact...

One example of this algorithm in the wild is google.com's certificate, which has the following public key: ``` -----BEGIN PUBLIC KEY----- MFkwEwYHKoZIzj0CAQYIKoZIzj0DAQcDQgAEmvTKDdXaEzCU3HZcwmVnTdoxdP4v sWmuMDpkXca/7YFC3vgKipd517q+meYF+bIybVrw6Q1UJVtHpZA/3qQw0g== -----END PUBLIC KEY----- ``` Evaluating `key.group.order.num_bits` gives...

[Here's another article](http://en.wikipedia.org/wiki/Key_length#Asymmetric_algorithm_key_lengths) that claims a 256-bit ECC key is equivalent to a 128-bit symmetric key, which is equivalent to a 3048-bit RSA key. The money quote: > As of...

After trying to discover a function to describe the key sizes, so far I have this: ``` ruby def key_size(n) a = 3 ** (1 / 48.0) p = 1024.0...