cryptology ch9 rsa

0.0(0)
studied byStudied by 0 people
0.0(0)
full-widthCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/29

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

30 Terms

1
New cards

Asymmetric encryption utilizes only a public key for encryption and decryption.

False

2
New cards

Asymmetric encryption can be used for confidentiality but not for authentication.

False

3
New cards

Asymmetric encryption transforms plaintext into ciphertext.

True

4
New cards

Plaintext is transformed into ciphertext using two keys and a decryption algorithm.

False

5
New cards

A major advance in symmetric cryptography occurred with the development of the rotor encryption/decryption machine.

True

6
New cards

Public-key encryption is more secure from cryptanalysis than symmetric encryption.

False

7
New cards

Much of the theory of public-key cryptosystems is based on number theory.

True

8
New cards

Asymmetric algorithms rely on one key for encryption and a different but related key for decryption.

True

9
New cards

The encryption algorithm performs various transformation on the ciphertext.

False

10
New cards

If the authenticator is encrypted with the sender's private key, it serves as a signature that verifies origin, content, and sequencing.

True

11
New cards

A trap-door one-way function is easy to calculate in one direction and infeasible to calculate in the other direction unless certain additional information is known.

True

12
New cards

A public-key encryption scheme is not vulnerable to a brute-force attack.

False

13
New cards

Before the application of the public-key cryptosystem each participant must generate a pair of keys.

True

14
New cards

The defense against the brute-force approach for RSA is to use a large key space.

True

15
New cards

Timing attacks are ciphertext attacks that are only applicable to RSA.

False

16
New cards

Asymmetric encryption is also known as __.

C) public-key encryption

17
New cards

Public-key encryption is also known as __.

B) asymmetric encryption

18
New cards

Asymmetric encryption can be used for __.

D) both confidentiality and authentication

19
New cards

Plaintext is recovered from the ciphertext using the paired key and a __.

C) decryption algorithm

20
New cards

The most widely used public-key cryptosystem is __.

B) RSA

21
New cards

Public-key algorithms are based on __.

B) mathematical functions

22
New cards

__ are two related keys, a public key and a private key that are used to perform complementary operations, such as encryption and decryption or signature generation and signature verification.

B) Asymmetric keys

23
New cards

The __ indicates that the subscriber identified in the certificate has sole control and access to the private key.

D) Public Key Certificate

24
New cards

A __ is a cryptographic algorithm that uses two related keys, a public key and a private key. The two keys have the property that deriving the private key from the public key is computationally infeasible.

C) Public Key (Asymmetric) Cryptographic Algorithm

25
New cards

A public-key encryption scheme has __ ingredients.

C) six

26
New cards

The key used in symmetric encryption is referred to as a __ key.

A) secret

27
New cards

The readable message or data that is fed into the algorithm as input is the __.

D) plaintext

28
New cards

Two issues to consider with the computation required to use RSA are encryption/decryption and __.

C) key generation

29
New cards

__ depend on the running time of the decryption algorithm.

D) Timing attacks

30
New cards

We define the __ of an algorithm to be f(n) if, for all n and all inputs of length n the execution of the algorithm takes at most f(n) steps. This is a common measure of the efficiency of an algorithm.

D) time complexity