Home » Events » Novel Search Algorithms to Solve the Shortest Vector Problem in Post-quantum Cryptography
Loading Events

« All Events

  • This event has passed.

Novel Search Algorithms to Solve the Shortest Vector Problem in Post-quantum Cryptography

July 11 @ 6:00 pm - 7:30 pm

Current encryption schemes like RSA are vulnerable to quantum computing attacks. Quantum-resistant alternatives are being explored, including encryption schemes reliant on the hardness of the Shortest Vector Problem (SVP). In this talk, Luke and James present a genetic search algorithm that efficiently solves approx-SVP in high dimension lattice spaces, outperforming other state-of-the-art algorithms including LLL and Kannan-Helfrich enumeration. Their results provide evidence that genetic algorithms have the potential to solve the SVP on high-dimension lattices, and that cryptosystems built on the hardness of the SVP may not be as secure in practice as previously thought. If your section, chapter, or student branch would like to co-host this event, please contact Chris Gunning, IEEE-Boise Computer Society chair, at cgunning@ieee.org . Speaker(s): James Liu, Luke Bousfield Virtual: https://events.vtools.ieee.org/m/318372

Details

Date:
July 11
Time:
6:00 pm - 7:30 pm
Event Category:
Website:
https://events.vtools.ieee.org/m/318372

Follow Us

Find Announcements

Past Announcements

Upcoming Local Meetings

Mon 08
Tue 09

IEEE Seattle Section Excom Meeting August 2022

August 9 @ 7:00 pm - 9:00 pm
Thu 11
Thu 11
Thu 11

Is Now a Good Time to Buy a Home?

August 11 @ 6:00 pm - 7:00 pm

Upcoming Region & Volunteer Meetings

Mon 08
Tue 09

IEEE Seattle Section Excom Meeting August 2022

August 9 @ 7:00 pm - 9:00 pm
Thu 11
Thu 11
Thu 11

Is Now a Good Time to Buy a Home?

August 11 @ 6:00 pm - 7:00 pm