Ace your Coding Interview
Get hired by top tech companies with our comprehensive interview preparation.
Get StartedEuclid’s algorithm (or Euclidean algorithm) is a method for efficiently finding the greatest common divisor (GCD) of two numbers. The GCD of two integers, X and Y, is the largest number that divides both X and Y without leaving a remainder.
The extended Euclidean algorithm is an extension to the Euclidean algorithm, which computes, besides the greatest common divisor of integers a and b, the coefficients of Bézout’s identity, i.e., integers x and y such that ax + by = gcd(a, b).
In cryptography, Triple DES (3-DES) is a symmetric-key block cipher, which applies the Data Encryption Standard (DES) cipher algorithm three times to each data block.
The Data Encryption Standard (DES) is a symmetric-key algorithm for the encryption of electronic data. Although now considered insecure, it was highly influential in the advancement of modern cryptography.
The Vigenère cipher is a form of polyalphabetic substitution to encrypt alphabetic text by using a keyword. The Vigenère cipher is easy to understand and implement. It consists of several Caesar ciphers in sequence with different shift values.
Write a C/C++ program to solve given simultaneous pairs of Linear Congruence Equations using the Chinese remainder theorem.
A cyclic group is a group that is generated by a single element. That means that there exists an element g, say, such that every other element of the group can be written as a power of g. This element g is the generator of the group.
Write a C/C++ program to find a general solution to the given Linear Congruence Equation.
Write a C/C++ program to find a general solution to the Linear Diophantine equation. A linear Diophantine equation is a first degree (linear) polynomial whose solutions are restricted to integers.
The Diffie-Hellman algorithm is used to establish a shared secret between two parties that can be used for secret communication to exchange data over a public network.
The ElGamal encryption is an asymmetric key encryption algorithm for public-key cryptography, which is based on the Diffie–Hellman key exchange. It can be defined over any cyclic group G. Its security depends upon the difficulty of a certain problem in G related to computing discrete logarithms.
RSA is an asymmetric cryptographic algorithm used by modern computers to encrypt and decrypt messages. Asymmetric means that there are two different keys. This is also called public-key cryptography because one of the keys can be given to anyone. The other key must be kept private.