Question

speed of factoring—cryptanalysts require a technology that is billions of times faster than current computers. consequently, cryptanalysts are looking toward a radically new form of computer, the quantum computer. if scientists could build a quantum computer, it would be able to perform calculations with such enormous speed that it would make a modern supercomputer look like a broken abacus. what kind of computer could factor quickly enough to break the rsa code in a short timeframe? a theoretical computer a technological computer a quantum computer a prime computer excerpt(s) from the code book: the evolution of secrecy from mary, queen of scots to quantum cryptography by simon singh, copyright © 1999 by simon singh. used by permission of doubleday, an imprint of the knopf doubleday publishing group, a division of random house llc. all rights reserved.

Explanation:

The text states that cryptanalysts are looking toward quantum computers for their extremely high - speed factoring capabilities to break RSA code. It mentions that if built, a quantum computer could perform calculations at a speed that would make modern supercomputers seem slow, indicating it's the answer.

Answer:

C. a quantum computer