El punto más débil de la criptografía no es la cuántica

They say that current cryptography will collapse with the arrival of quantum computing, but we can beat quantum computers with this simple trick. Short index: 00:00 - Introduction 01:59 - The Caesar cipher 04:33 - The unbreakable cipher 08:45 - The perfect secret * * * Instagram:   / lemnismath   Twitter:   / lemnismath   * * * Since you've continued reading this far, let me tell you a little more. In the phrase "childish nonsense," one of the least frequent letters in Spanish appears most often. We can have problems deciphering short messages when applying statistical methods. Can you think of any other phrases with unusual frequencies? Link to the website: https://lemnismath.org/2024/03/como-v... Lemnismath - ------------- Bibliography and References --------------- [1] Or several times the age of the universe, depending on the encryption method. It's really a matter of luck: you could guess the key on the first try. [2] This isn't the only way. We could change the order of the letters, or insert fake letters among the real ones. Or a combination of everything. [3] You can add more characters to the cipher disk, such as K and W, spaces, and other symbols. I've chosen 25 for convenience, like the number in the Pasapalabra game show. [4] Caesar cipher. I quote the University of Granada. https://www.ugr.es/~anillos/textos/pd... [5] From this point forward, we assume that everyone uses the same encryption system. Everyone KNOWS how the method works, but not the secret keys. This is the Kerckhoffs principle. [6] Frequency of letters in Spanish. https://web.archive.org/web/201312160... [7] There are other attacks on encrypted messages, but they are either very similar to or very different from these two. For example, information about the secret key can be extracted from the noise a machine makes while encrypting a message, or from the time it takes to do so. [8] Similar to the Vignère cipher, but changing the "keyword" to a numerical key. They are equivalent. Here is an interactive website: https://crypto.interactive-maths.com/... [9] Technically, statistics CAN be used. These statistics do not arise from the repetition of the key, but from the "structure" of the key itself. If the key is "1 2 3 4 5...", it will leave a characteristic trace in the text that will help to decipher it. [10] Perfect secrecy, as described by Shannon in "Communication Theory of Secrecy Systems", p. 656. Highly recommended reading. https://www.cs.miami.edu/home/burt/le... [11] A general idea of ​​the single-use notebook (or journal) on the Wiki. [11] A general idea of ​​the single-use notebook (or journal) on the Wiki. https://en.wikipedia.org/wiki/One-tim... Sounds: From Robinhood76: https://freesound.org/people/Robinhoo... https://freesound.org/people/Robinhoo... From Stickinthemud: https://freesound.org/people/Stickint...