Cryptography Seminar- Ted Eaton, Geovandro Pereira & John Schank

Monday, April 2, 2018 1:00 pm - 1:00 pm EDT (GMT -04:00)

There are 3 short talks this week.

Title: Quantum Collision-Finding in Non-Uniform Random Functions

Speaker: Ted Eaton
Affiliation: ISARA Corporatio
Room: MC 6486

Abstract: Proving the security of a scheme against a quantum adversary often makes the strong assumption of modelling the hash function as uniformly random. In this work, we study the generic security of non-uniform random functions, specifically those with min-entropy k. This has applications to the quantum security of the Fujisaki-Okamoto transformation, as well as allowing for more relaxed security assumptions. We discuss previous results and sketch a proof for an asymptotic upper and lower bound of 2k/3 quantum queries. 

Title: Faster isogeny-based compressed key agreement

Speaker: Geovandro Pereira
Affiliation: University of Waterloo
Room: MC 6486

Abstract:Supersingular isogeny-based cryptography is one of the more recent families of post-quantum proposals. An interesting feature is the comparatively low bandwidth occupation in key agreement protocols, which stems from the possibility of key compression. However, compression and decompression introduce a significant overhead to the overall processing cost despite recent progress. In this talk I will describe a set of optimizations providing improvements in both key compression and decompression.

Title: NTRU-HRSS-KEM

Speaker: John Schank
Affiliation: University of Waterloo
Room: MC 6486

Abstract:The US National Institute of Standards and Technology (NIST) hasinitiated a project to standardize post-quantum cryptographic algorithms in the categories of key encapsulation, public key encryption, and digital signatures. I will present "NTRU-HRSS," a submission in the key encapsulation category. NTRU-HRSS is a direct instantiation of Hoffstein, Pipher, and Silverman's NTRUEncrypt scheme from ANTS 1998. Parameters for NTRU-HRSS were chosen to 1) ensure perfect correctness, 2) ease constant time implementation, and 3) provide at least 128 bit security with respect to a conservative cost model for quantum computation. I will justify these claims about the parameters and compare NTRU-HRSS with other NTRU/LWE schemes under consideration.