Bremermann limit
The Bremermann limit describes the maximum processing speed of data processing systems .
From the equivalence of mass and energy and the Planck equation, Hans Joachim Bremermann derived the knowledge that symbols can be processed at a maximum speed of 1.35639-10 50 bits / kilogram / second.
In cryptography , this value is important to a encryption method to be designed so that the force method brute is not decipherable.
For example, an earth- mass computer operating on the Bremermann limit could perform about 10 75 (about 2 249 ) calculations per second. Assuming that a cryptographic key could be tested with just one operation, 128-bit encryption would be decrypted in 10 −37 seconds. 256-bit encryption would be cracked in about two minutes, but 512-bit encryption would not be cracked for 72 years.
literature
- HJ Bremermann: Optimization through evolution and recombination . In: Yovitts et al. (Ed.): Self-Organizing systems . Spartan Books, Washington, DC 1962, pp. 93-106 (English).
- HJ Bremermann: Quantum noise and information . In: Lucien M. Le Cam; Jerzy Neyman (Ed.): Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability . tape 4 . University of California Press, Berkeley 1967, pp. 15-20 (English, projecteuclid.org [accessed January 16, 2010]).