It looks like you're using Internet Explorer 11 or older. This website works best with modern browsers such as the latest versions of Chrome, Firefox, Safari, and Edge. If you continue with this browser, you may see unexpected results.

Modular Numbers and Cryptography

What is Cryptography?

Cryptography is the practice and study of techniques for secure communication in the presence of third party adversaries. Cryptography involves constructing secret codes, ways of disguising information in order that a sender can transmit it to an intended receiver so that an adversary who somehow intercepts the transmission will be unable to discern its meaning.

 Before the modern era, cryptography focused on message confidentiality (i.e., encryption). Encryption attempted to ensure secrecy in communications such as those for spies, military leaders, and diplomats. In recent decades, the field has expanded beyond confidentiality to include techniques for mass integrity checking, sender/receiver identity authentication, digital signatures, interactive proofs, and secure computation.

The basis of a cryptography system is normally some mathematical function, the "encryption algorithm," that encrypts the message.

For example, an encryption can have the following rules:

• Replace each letter with the letter that is before it in the alphabet;
• Except for a which you replace with z

Then the message "zebra" would be encrypted as "ydaqz".

 Basics Requirements of a Cryptography System A secret algorithm (or function) for encrypting and decrypting data A secret key that provides additional information necessary for a receiver to carry out the decrypting process.

The difficulty of creating an algorithm was how easy it is to find a unique inverse of a function. For example, $$x-1$$ can be decrypted with the inverse $$x+1$$. The secret key also needed to be updated frequently.

However, if we consider modular equations, we can see how a residue can represent multiple solutions. Thus, it is harder to find the unique inverse.