September 9, 2019, SE-43, Room 215; 4:00 p.m.
Speaker: Shi Bai, Florida Atlantic University
Title: Lattice attacks for variants of LWE
Abstract: The learning with errors (LWE) problem introduced by Regev (STOC'05) is one of the fundamental problems in lattice-based cryptography. It has been used extensively as a security foundation, for public-key encryption, signatures, fully homomorphic encryption (FHE), pseudo-random functions (PRF) and many others. One standard strategy to solve the LWE problem is to reduce it to a unique SVP (uSVP) problem via Kannan's embedding and then apply a lattice reduction to solve the uSVP problem. In this talk, we will discuss and compare various lattice algorithms for solving LWE, and then give some concrete estimates for breaking various variants of LWE (e.g. generic, small secrets, restricted samples). In the end, we will discuss some recent developments on algorithms for solving LWE.
September 23, 2019, SE-43, Room 215; 4:00 p.m
Speaker: Edoardo Persichetti, Florida Atlantic University
Title: Research Challenges in Code-Based Cryptography
Abstract: In this talk I will present the area of code-based cryptography, one of the most active and exciting areas of research within post-quantum cryptography. After a brief introduction, I will discuss some research avenues and open problems. Everyone welcome!
October 7, 2019, SE-43, Room 215; 4:00 p.m.
Speaker: Shaun Miller, Florida Atlantic University
Title: A brief introduction to quantum circuits
Abstract: To implement quantum algorithms like Shor's and Grover's, we need to be able to translate classical loops to quantum circuits. I will give an introduction to bra-ket notation as well as quantum circuits. We will use this knowledge to translate a classical while loop into a conditioned quantum loop.
October 21, 2019, SE-43, Room 215; 4:00 p.m.
Speaker: Emrah Karagoz, Florida Atlantic University
Title: Knapsack Problem: Is it Post-Quantum Secure?
Abstract: The Knapsack Problem has been popular in cryptography since the Merkle–Hellman knapsack cryptosystem was announced in 1978, which was one of the first public-key cryptosystems, but had a very short life and was broken in 1982. Although it was discouraged with this failure and beside of the rising popularity of RSA, there are many other proposed algorithms such as the Chor-Rivest Cryptosystem, which are still secure.
Even though the Knapsack Problem is an NP-hard problem, and therefore believed to be a good candidate for Post Quantum secure algorithms, there was no submission based on Knapsack Problem in the NIST competition. We are still waiting (or maybe studying)!
In this talk, we will discuss the cryptographic aspects of the Knapsack Problem towards the Post-Quantum Secure World.
November 4, 2019, SE-43, Room 215; 4:00 p.m.
Speaker: Abhraneel Dutta, Florida Atlantic University
Title: A New Elliptic Curve Scalar Multiplication Algorithm
November 18, 2019, SE-43, Room 215; 4:00 p.m.
Speaker: Tran Ngo, Florida Atlantic University
December 2 2019, SE-43, Room 215; 4:00 p.m.
Speaker: Paolo Santini, Università Politecnica delle Marche