Algorithms for Solving Hard Problems

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

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

Koji Nuida JST PRESTO Researcher, National Institute of Advanced Industrial Science and Technology (AIST)

Speaker

Wei Wei Post Doctoral Researcher, State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences

Speaker