Our Secure Security
Thomas typing to you here. How goes it?
The main topic for this post is on enhancing ME.mory’s security, which has become a focus of our attention lately.
We have switched from AES128 security encryption to AES256 which makes ME.mory more secure than it has ever been.
Honestly, much of this was outside the scope of my understanding and so has been handled by our tech team.
From an outsider’s (to programming) perspective, how much more secure is it?
Practically, there is not a difference as of today. The ability to break such security by a brute force attack is outside of the scope of current computing technology for many years to come.
An example explaining why this additional security may not make a difference now:
- Imagine if you had to swim across 100,000 miles to reach me.
- Now imagine you had to swim across 1,000,000 miles instead.
Did the extra 900,000 miles truly make me more inaccessible?
Likely not, in that your likelihood of swimming 100,000 miles is the same as your likelihood of swimming 1,000,000 miles – impossible.
So what benefit does enhancing our encryption even further have? Well, it does mean that we are far ahead of the curve once computational power reaches a further stage, assuming that it will. We are getting ready for advanced attacks well before they are even possible.
It feels great to be so prepared.
If you’re interested in knowing even more, with some curious examples to explain even further, then check out this piece by Mohit Arora: https://www.eetimes.com/document.asp?doc_id=1279619
From that piece, consider how the possible number of key combinations given key size increases astoundingly as key size increases.
Imagine if you have one value, which can be either “0” or “1”. Such means that there are only two possibilities. It is either “0” or “1”.
If you have two values, which can each be “0” or “1”, then you only have four possibilities: “00”, “01”, “10” or “11”.
With four values: “0000”, “0001”, “0010”, “0100”, “1000”, “0011”, “0101”, “1001”, “1010”, “0110”, “1100”, “1110”, “0111”, “1011”, “1101” and “1111”.
How quickly the possible combinations increase with each value added. Here are simple charts from the piece which show that exponential growth.
From their piece: “As shown above, even with a supercomputer, it would take 1 billion billion years to crack the 128-bit AES key using brute force attack. This is more than the age of the universe (13.75 billion years).”
Moving on to share about the latest developments: Saving a me.mory and searching have been implemented accurately without the current glitches observed (such as search clearing after having viewed an entry). ME.mories not being listed in a proper order and incorrect dates have also been a focus of development attention.
Media-wise, I am likely to be a guest soon on a podcast related to dating, sex and disability. I am truly looking forward to sharing my experiences of dating with my disability and how such can be navigated by digital memory strategies.
Memoir-wise, I am currently finishing up with noting this round of edits to the “I’m Sorry…”-part of the book. Such means that I will be able to type in edits for that part while also noting edits I wish to make to the “That’s Awesome!”-part.
OK. That’s it. Feel free to share your comments or otherwise reach out.