The problem asks us to decrypt a ciphertext character 'Z' using the Affine cipher method. We are given the ciphertext, the key pair used for encryption, and the modulus.
The Affine cipher encryption works as $E(x) = (ax + b) \pmod{m}$, where $x$ is the numerical representation of the plaintext letter. The decryption process reverses this.
The formula for Affine cipher decryption is:
$ D(y) = a^{-1}(y - b) \pmod{m} $
Where:
First, we convert the ciphertext character "Z" into its corresponding numerical value. Assuming A=0, B=1, ..., Z=25:
Ciphertext 'Z' corresponds to $y = 25$.
From the key pair $(7, 2)$, we have:
We need to find the modular multiplicative inverse of $a=7$ modulo $m=26$. This means finding a number $a^{-1}$ such that:
$ 7 \times a^{-1} \equiv 1 \pmod{26} $
We can find this by trying multiples of 7:
Therefore, the modular inverse $a^{-1}$ is $15$.
Now, substitute the values into the decryption formula:
$ D(25) = 15 \times (25 - 2) \pmod{26} $
Calculate the expression inside the parentheses:
$ D(25) = 15 \times (23) \pmod{26} $
Perform the multiplication:
$ 15 \times 23 = 345 $
Now, find the result modulo 26:
$ D(25) = 345 \pmod{26} $
To find $345 \pmod{26}$, we divide 345 by 26:
$ 345 \div 26 = 13 \text{ with a remainder of } 7 $
So, $ 345 \equiv 7 \pmod{26} $
The numerical result of the decryption is $7$. This corresponds to the letter 'H' in the alphabet (A=0, H=7).
The decrypted numerical value for the ciphertext "Z" with the key pair (7, 2) in modulus 26 is 7.
| 1. | DES | a. | 128-256 bits |
| 2. | Rj indeal | b. | 1-448 bits |
| 3. | RC4 | c. | 56 bits |
| 4. | Blowfish | d. | 1-2048 bits |
In the RSA public key cryptosystem, the private and public keys are $(e, n)$ and $(d, n)$ respectively, where $n = p \times q$ and $p$ and $q$ are large primes. Besides, $n$ is public and $p$ and $q$ are private. Let M be an integer such that $0 <M< n$ and $\phi(n) = (p-1)(q - 1)$. now consider the following equations.
I. M’ =\( M^e\) mod n M =\( (M')^d\) mod n
II. ed ≡1 mod n
III. ed ≡1 mod f(n)
IV. M’ = \(M^e \)mod f(n)
M = \( (M')^d\) mod
Which of the above equations correctly represent RSA cryptosystem?
| 1. | Brute-Force Attack | a. | Change of keys |
| 2. | Statistical Attack | b. | Number of possible keys are large |
| 3. | Pattern Attack | c. | Hide the characteristics of the language |
| 4. | Known - Plain Text Attack | d. | Ciphertext is as random as possible |