TELECOMMUNICATIONS SYSTEMS
TYPES OF NETWORKS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
the formula for encrypting (coding) the plaintext (normal message)
|
|
|
the encrypted (coded) message
|
|
|
the original message to be encrypted (coded)
|
|
|
Changing data so that it can no longer be understood without a decryption(decode) key
|
Detailed explanation-1: -For example, s = SIGNATURE(p) = p ^ d % z. Then, the recipient can verify the digital signature by applying the encryption function and comparing the result with the message. For example, m = VERIFY(s) = S ^ e % z.
Detailed explanation-2: -RSA algorithm uses the following procedure to generate public and private keys: Select two large prime numbers, p and q. Multiply these numbers to find n = p x q, where n is called the modulus for encryption and decryption. If n = p x q, then the public key is <e, n>.
Detailed explanation-3: -Ciphertext is encrypted text transformed from plaintext using an encryption algorithm. Ciphertext can’t be read until it has been converted into plaintext (decrypted) with a key.
Detailed explanation-4: -Symmetric-key algorithms are algorithms for cryptography that use the same cryptographic keys for both the encryption of plaintext and the decryption of ciphertext.