The computations involved in selecting keys and in enciphering data are complex, and are not practical for
manual use. However, using mathematical properties of modular arithmetic and a method known as
“_________________,” RSA is quite feasible for computer use.
A.
computing in Galois fields
B.
computing in Gladden fields
C.
computing in Gallipoli fields
D.
computing in Galbraith fields
Explanation:
The computations involved in selecting keys and in enciphering data are complex, and are not practical for
manual use. However, using mathematical properties of modular arithmetic and a method known as computing
in Galois fields, RSA is quite feasible for computer use.
A Galois field is a finite field.
Incorrect Answers:
B: A finite field is not called a Gladden field. Gladden fields are not used in RSA.
C: A finite field is not called a Gallipoli field. Gallipoli fields are not used in RSA.
D: A finite field is not called a Galbraith field. Galbraith fields are not used in RSA.
Source: FITES, Philip E., KRATZ, Martin P., Information Systems Security: A Practitioner’s Reference, 1993, Van Nostrand Reinhold, page 44
Are candidates expected to remember random citations from random books? 🙂
0
0