Difficulty and Inapplicability of the RSA problem
Speaker:
Dan Brown, BlackBerry Corp
Date and Time:
Thursday, November 30, 2006 - 2:10pm to 3:00pm
Location:
Fields Institute, Room 230
Abstract:
Solving the RSA problem with a straight line program is shown to be almost as difficult as factoring. Proving - without random oracles - that breaking RSA-OAEP encryption is as difficult as the RSA problem, though, is shown to be infeasible.
