How to make your password UNCRACKABLE applying E=mc^2?

Do you know that there is a little-known (outside the computer science community of course), theorem which draws upon famous physics like E=mc² and Heisenberg’s Uncertainty Principle to determine how many minimum number of cryptographic keys to be applied to your password, so that it can NEVER be cracked by brute-force search?

Bremermann’s Limit, named after Hans-Joachim Bremermann, is the maximum computational speed of a self-contained system in the material universe. It is derived from Einstein’s mass-energy equivalency and the Heisenberg uncertainty principle. For example, a computer with the mass of the entire Earth operating at the Bremermann’s limit could perform approximately 10^75 mathematical computations per second. If we assume that a cryptographic key can be tested with only one operation, then a typical 128 bit key could be cracked in under 10^(−36) seconds. However, a 256 bit key (which is already in use in some systems) would take about two minutes to crack. Using a 512 bit key would increase the cracking time to approaching 10^72 years.”

Source: Bremermann’s limit

READ:  Collection of useless gadgets
About Enyiuche 105 Articles
A simple, honest youth who believes in change. Was born on the right day, in the right place and at the right time. Built and equipped with tools to serve mankind irrespective of culture, belief, race, language, and ethnicity.

Be the first to comment

Leave a Reply

Your email address will not be published.