Novel Search Algorithms to Solve the Shortest Vector Problem in Post-quantum Cryptography
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 .
Date and Time
Location
Hosts
Registration
- Date: 11 Jul 2022
- Time: 06:00 PM to 07:30 PM
- All times are (UTC-07:00) Mountain Time (US & Canada)
- Add Event to Calendar
- Contact Event Hosts
-
Chris Gunning, IEEE-Boise Computer Society chapter chair, cgunning@ieee.org
David Butcher, IEEE-Seattle Computer Society chapter, chair, dbutcher@ieee.org
- Starts 30 June 2022 09:00 AM
- Ends 11 July 2022 05:00 PM
- All times are (UTC-07:00) Mountain Time (US & Canada)
- No Admission Charge
Speakers
James Liu
Biography:
James is an incoming college freshman at the Massachusetts Institute of Technology and has recently graduated from Timberline High School in Boise, Idaho. He has conducted research in solid-state physics at the Research Science Institute, in collaboration with the Goldhaber-Gordon Group at Stanford. He has also conducted independent research with Luke in post-quantum cryptography, winning an award from the NSA at the 2022 Regeneron ISEF. James is currently conducting independent machine learning research, where he is developing a drug discovery model using Generative Flow Networks. James likes to lift, ski, and play League of Legends in his spare time.
Luke Bousfield
Biography:
Luke Bousfield is a rising senior at Timberline High School in Boise, Idaho. He’s currently on a journey to learn more about programming, math, cryptography, machine learning, and everything in between through research. Together with his research partner James, he won a second place NSA Cybersecurity award worth $1,500 at the 2022 Regeneron ISEF. Whether it’s going on a solo trip to Germany or spending a month doing independent AI research in the bay and learning from the best in the field, Luke enjoys keeping a busy life, spending a total of two weeks actually at home this summer. In his free time, he enjoys creating music, playing tennis and basketball, hitting benchpress PRs, and going on long drives filled with deep discussions and loud music.