- All Exams Instant Download
A protocol for key aggreement based on Diffie-Hellman. Created in 1995. Incorporated into the public key standard IEEE P1363.
A protocol for key aggreement based on Diffie-Hellman. Created in 1995. Incorporated into the public key standard IEEE P1363.A . Blum Blum Shub B. Elliptic Curve C. Menezes-Qu-Vanstone D. Euler's totientView AnswerAnswer: C Explanation: Menezes-Qu-Vanstone https://en.wikipedia.org/wiki/MQV MQV (MenezesCQuCVanstone) is an authenticated protocol for key agreement based on the DiffieCHellman scheme....
Calculates the average LSB and builds a table of frequencies and Pair of Values. Performs a test on the two tables. It measures the theoretical vs. calculated population difference.
Calculates the average LSB and builds a table of frequencies and Pair of Values. Performs a test on the two tables. It measures the theoretical vs. calculated population difference.A . Certificate Authority B. Raw Quick Pair C. Chi-Square Analysis D. SP networkView AnswerAnswer: C Explanation: Chi-Square Analysis https://en.wikipedia.org/wiki/Chi-squared_test A chi-squared...
Which of the following acts as a verifier for the certificate authority?
Which of the following acts as a verifier for the certificate authority?A . Certificate Management system B. Directory management system C. Registration authority D. Certificate authorityView AnswerAnswer: C Explanation: Registration authority https://en.wikipedia.org/wiki/Registration_authority Registration authorities exist for many standards organizations, such as ANNA (Association of National Numbering Agencies for ISIN), the...
When learning algorithms, such as RSA, it is important to understand the mathematics being used. In RSA, the number of positive integers less than or equal to some number is critical in key generation. The number of positive integers less than or equal to n that are coprime to n is called ______.
When learning algorithms, such as RSA, it is important to understand the mathematics being used. In RSA, the number of positive integers less than or equal to some number is critical in key generation. The number of positive integers less than or equal to n that are coprime to n...
If a single change of a single bit in the plaintext causes changes in all the bits of the resulting ciphertext, what is this called?
Basic information theory is the basis for modern symmetric ciphers. Understanding the terminology of information theory is, therefore, important. If a single change of a single bit in the plaintext causes changes in all the bits of the resulting ciphertext, what is this called?A . Complete diffusion B. Complete scrambling...
Which of the following is generally true about key sizes?
Which of the following is generally true about key sizes?A . Larger key sizes increase security B. Key size is irrelevant to security C. Key sizes must be more than 256 bits to be secure D. Smaller key sizes increase securityView AnswerAnswer: A Explanation: Larger key sizes increase security https://en.wikipedia.org/wiki/Key_size...
Created by D. H. Lehmer. It is a classic example of a Linear congruential generator. A PRNG type of linear congruential generator (LCG) that operates in multiplicative group of integers modulo n. The basic algorithm is Xi+1=(aXi + c) mod m, with 0 Xi m.
Created by D. H. Lehmer. It is a classic example of a Linear congruential generator. A PRNG type of linear congruential generator (LCG) that operates in multiplicative group of integers modulo n. The basic algorithm is Xi+1=(aXi + c) mod m, with 0 Xi m.A . Lehmer Random Number Generator...
Changing some part of the plain text for some matching part of cipher text. Historical algorithms typically use this.
Changing some part of the plain text for some matching part of cipher text. Historical algorithms typically use this.A . Decoding B. Substitution C. Transposition D. CollisionView AnswerAnswer: B Explanation: Substitution https://en.wikipedia.org/wiki/Substitution_cipher In cryptography, a substitution cipher is a method of encrypting by which units of plaintext are replaced with...
A _____ is a function that takes a variable-size input m and returns a fixed-size string.
A _____ is a function that takes a variable-size input m and returns a fixed-size string.A . Feistel B. Asymmetric cipher C. Symmetric cipher D. HashView AnswerAnswer: D Explanation: Hash https://en.wikipedia.org/wiki/Hash_function A hash function is any function that can be used to map data of arbitrary size to fixed-size values.
The mode makes a block cipher into a synchronous stream cipher. It generates keystream blocks, which are then XORed with the plaintext blocks to get the ciphertext.
The mode makes a block cipher into a synchronous stream cipher. It generates keystream blocks, which are then XORed with the plaintext blocks to get the ciphertext.A . Cipher-block chaining (CBC) B. Electronic codebook (ECB) C. Output feedback (OFB) D. Cipher feedback (CFB)View AnswerAnswer: C Explanation: Output feedback (OFB) https://en.wikipedia.org/wiki/Block_cipher_mode_of_operation#Output_feedback_(OFB)...
