3/21/2002
3:30pm-4:30pm
ECCR 265
|
Highly-Optimized Provably-Secure Cryptography
Department of Computer Science, University of Nevada, Reno
Cryptography has traditionally been the concern of military and governmental
groups. However, with businesses and individuals commonly conducting sensitive
transactions over a fundamentally insecure Internet, cryptography is now
pervasively employed to protect the privacy and integrity of these
communications. How can we be sure the algorithms employed are sound, and how
do we make them fast enough that people will tolerate their use? This talk
attempts to answer these questions by sketching an overview of the area and
then focusing on the author's recent work related to fast provably-secure
encryption and authentication schemes.
Hosted by Alexander Wolf.
Refreshments will be served immediately following the talk in ECOT 831.
|
The Department holds colloquia throughout the Fall and Spring semesters. These
colloquia, open to the public, are typically held on Thursday afternoons, but
sometimes occur at other times as well.
If you would like to receive email notification of upcoming colloquia,
subscribe to our
Colloquia Mailing List.
If you would like to schedule a colloquium, see
Colloquium Scheduling.
Sign language interpreters are available upon request. Please contact
Stephanie Morris at least five days prior to the colloquium.
|
