How large should RSA public keys be chosen?
Sam Wagstaff - Purdue University
Aug 29, 1997
AbstractThis lecture describes the computational requirements of the best integer factoring algorithms known, but not any details of how they work. It recounts the history of the speed of factoring algorithms and the computational power of computers over the past 25 years, and tries to predict how large numbers we will be able to factor in the future and thus how large RSA keys should be chosen now if the secrets they protect must not be revealed for a certain number of years. We consider covert attacks in which the attacker does not wish to be detected as well as overt attacks in which many people cooperate publicly to factor a number.
The views, opinions and assumptions expressed in these videos are those of the presenter and do not necessarily reflect the official policy or position of CERIAS or Purdue University. All content included in these videos, are the property of Purdue University, the presenter and/or the presenter’s organization, and protected by U.S. and international copyright laws. The collection, arrangement and assembly of all content in these videos and on the hosting website exclusive property of Purdue University. You may not copy, reproduce, distribute, publish, display, perform, modify, create derivative works, transmit, or in any other way exploit any part of copyrighted material without permission from CERIAS, Purdue University.