I would love an analogy or simple explanation of how someone can design a system that is locked/unlocked using a number string, but also have no possible way to reverse engineer or figure out that number string, having intimate understanding of how that system works.
Is there a way to illustrate this using like, simple math or boxes with padlocks or coloured balls in a bag etc.
In: Technology
Encryption is beautiful.
Take a word. Change every letter into its numbered position in the alphabet. Multiply each number by the number in the next position of that particular word.
Put those numbers in ascending order.
Remove anything below 50 and above 300.
Keep just the first 50 digits and fill with zeros if needed.
Ok?
Now I give you the another result only.
What was the new original word?
That’s the password to decrypt the rest of the data.
Apple knows the recipe, but not the ingredients.
Summary: the only way to make sure the original word is the same is by doing the same recipe and getting the exact same result. Any small change will result in a vastly different outcome.
Going backwards (generate random or probable values to match the initial word) would take forever. There are mathematical ways to ensure that it is safely above current and foreseeable computing power.
Latest Answers