Menu

Algorithms for Solving Hard Problems

  • Thursday, April 23, 2015 | 8:00 AM – 8:50 AM | West | Room: 2000

View all Sessions

Hard problems, such as, the shortest lattice problem and integer factorization are in the core of public key cryptography. In this session, new algorithms for solving these hard problems are presented. 
Topic 1: Finding Shortest Lattice Vectors in the Presence of Gaps
Authors: Wei Wei, Mingjie Liu, Xiaoyun Wang 
Topic 2: A Simple and Improved Algorithm for Integer Factorization with Implicit Hints
Authors: Koji Nuida, Naoto Itakura, Kaoru Kurosawa

Participants

This document was retrieved from https://www.rsaconference.com/events/us15/agenda/sessions/1764/algorithms-for-solving-hard-problems on Sun, 04 Dec 2016 11:15:02 -0500.
© 2016 EMC Corporation. All rights reserved.