I was reading up on CryptoCat's (pretty ridiculous) programming issues and how is dramatically reduced the key search space (link to bug synopsis)
One thing that caught my eye was
So 2^54.15 turns into 2^27.08
Unless I'm missing something, the impact of the fractional exponent is negligible. So, any ideas why the author is reporting it as
2^54.15 and not just
2^54 ? I mean for O notations, we usually state only the degree of the highest order polynomial (that expresses algorithmic complexity), ignoring the factors and lower order powers.
So am I missing something here when it comes to expression of keyspaces?