CYBER SECURITY THEMES

RSA algorithm is an asymmetric cryptography algorithm. Asymmetric actually means that it works on two different keys i.e. Public Key and Private Key. As the name describes that the Public Key is given to everyone and the Private key is kept private. An example of asymmetric cryptography : A client (for example browser) sends its public key to the server and requests for some data.  The server encrypts the data using the client’s public key and sends the encrypted data.  Client receives this data and decrypts it.  Since this is asymmetric, nobody else except the browser can decrypt the data even if a third party has the public key of browser. Digital signatures are used to verify the authenticity of the message sent electronically. A digital signature algorithm uses a public key system. The intended transmitter signs his/her message with his/her private key and the intended receiver verifies it with the transmitter’s public key. A digital signature can provide message auth...

  Modular Exponentiation: Definition : Modular exponentiation is the process of repeatedly squaring and reducing a number modulo some integer, and then combining the results to find the required answer. Modulo refers to the act of finding the remainder when a certain number is divided by another. For examples: 5 Modulo 3 is 2. The use of this operation will be in algorithm which uses divisibility, most simply, finding whether a number is odd or even. Exponentiation is simple raising a number to a certain power 5 2 =25. Module and exponentiation are both mathematics terms, nothing related to IT field. However, your script may use this logic. C=b e (Mod m), where e exponent, m is modules. To find final digit and two final digits, use modular Exponentiation method: Universe Method: Modular Exponentiation is a Universe method to find last digits. Use following option: 1. To find last digit use Modulo 10 2. To find last two digits use Modulo 100 3. To find last three digits use Modulo 1...