DeepikaI like to think of myself as a shih-crypto, a crypto-anarchic. When it comes to money, I have been known to spend way more than I have to. I don’t mind making an investment and I am always open to learning new things. I am a big fan of learning and experimenting. I don’t like staying in one place. I feel free to explore new things and keep myself entertained.
Cryptography is one of those things that is surprisingly hard to get right. Like most things, the art (and sometimes the science) of it is a craft that requires great patience and perseverance. However, if you really want to, you can learn how to crack the code, or learn to spot a flaw and how to fix it.
Yeah. Cryptography is one of those things that requires a lot of patience and perseverance. In fact, it is so hard that you could literally be arrested for trying to crack it. There are hundreds of different types of cryptography, each with their own method of solving problems. For instance, we have the discrete logarithm algorithm (which we will cover in a bit) and the computational complexity algorithm.
The discrete logarithm problem is extremely difficult and we will cover it in a bit. The computational complexity algorithm is another method of solving a problem. It’s a bit more complicated than the discrete logarithm algorithm, but it is still rather difficult. Once you’ve cracked the discrete logarithm algorithm, you can then use it to solve a plethora of other cryptography problems.
Cryptography is a very broad field that deals with any type of encoding or decoding. We will go over the discrete logarithm algorithm in a bit, as well as the computational complexity algorithm.
In cryptography, the computational complexity algorithm is very useful because it allows you to solve problems that were once unsolvable (i.e. hard). You can get around the fact that the problem is unsolvable by using a clever transformation or by reducing it to the simpler problem of finding a short message of some length that is easy to get.
The discrete logarithm algorithm is the basis for the digital currency bitcoin. It converts the number of 1’s in a number to its base-two logarithm.
You may be surprised at how complex the computational complexity of cryptography is. Some algorithms are more complicated than others. The difference is that the former involves just a brute-force brute-force search, whereas the latter involves lots of clever computations. I’d go for the former, though.
Cryptographers call these “chosen-plaintext attacks,” where the adversary (aka the attacker) sends out a message that can only be decrypted using a specific key. Such a message can be decrypted only if the key is known. The advantage here is that the cryptographer doesn’t have to try all possible keys to find one that decrypts the message.
The advantage of this method is that it is incredibly fast and the attacker is limited only to the amount of time the adversary has to try all keys, which means not having to deal with brute force.
