Events

Filter by:

Limit to events where the title matches:
Limit to events where the first date of the event:
Date range
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Friday, June 12, 2026 10:30 am - 11:30 am EDT (GMT -04:00)

Crypto Reading Group - Camryn Steckel-Decoding for Quasi-Cyclic Codes

Speaker:

Camryn Steckel
Affiliation: University of Waterloo
Location: MC 5417

Abstract:

This session focuses on decoding questions specific to quasi-cyclic codes. We will discuss syndrome decoding in the quasi-cyclic setting and compare generic ISD methods with approaches that exploit additional structure. The goal is to better understand the tension between efficiency and security, and to prepare the ground for the study of the HQC scheme.
References: [§6.3, 4], [§3, 6], and [§5, 10]
[4] HQC Team. Hamming Quasi-Cyclic (HQC), NIST Submission, 2025.
[6] C. Löndahl, T. Johansson, M. Koochak Shooshtari, M. Ahmadian-Attari, and M. Reza Aref. Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension. Designs, Codes and Cryptography , vol. 80, pp. 359–377, 2016.
[10] N. Sendrier. Decoding One Out of Many. Post-Quantum Cryptography. PQCrypto 2011. Lecture Notes in Computer Science, vol. 7071, Springer, 2011.
A week-by-week plan is outlined at the following link: https://www.leonardocolo.com/seminars/Spring26.html.

Speaker:

Sina Kalantarzadeh
Affiliation: University of Waterloo
Location: MC 6029

Abstract:

In stochastic online optimization, prophet inequalities under matroid constraints have been studied extensively. The philosopher benchmark(optimal online strategy) is weaker than the prophet benchmark, but it is still not fully understood how well one can compete against the optimal online strategy using polynomial computational power. Pashkovich and Dehaan showed that it is impossible to design a PTAS for computing optimal online strategy in graphic matroids.
In this talk we consider a special class of matroid constraints so called laminar matroids. There are (n) items arriving in a known order, and each item has a probability distribution over its realized value. We are also given a collection of bins on these items, where each bin (B) has a capacity (c(B)). The bins form a laminar family. When an item arrives, its value is revealed, and the algorithm must immediately decide whether to accept or reject it, while respecting all laminar capacity constraints. The goal is to maximize the expected gain of the total value of the accepted items and compare it to the gain of the optimal online policy, rather than to the prophet.

Anari et al. designed a polynomial-time approximation scheme(PTAS) for constant-depth instances, meaning that each item belongs to only a constant number of bins. Their approach uses the fact that the optimal online policy can be formulated as a linear program(LP). We will first examine this LP in the simple case where the laminar family consists of a single bin of capacity one. In general, however, the LP has exponential size and therefore cannot be solved directly in polynomial time. The main idea is to select certain small bins inside the laminar family for which the corresponding subproblems are no longer exponentially large. On these selected parts, one can use the optimal online policy, and then combine these local policies to obtain a global approximation. It remains open whether one can design a PTAS for general laminar families. 

Speaker: Douglas Stebila
Affiliation: University of Waterloo
Location: MC 5501

Abstract: The Fujisaki-Okamoto (FO) transform is a fundamental building block in new post-quantum cryptography standards like NIST's ML-KEM, where it is used to convert a weakly secure public key encryption scheme into a key encapsulation mechanism (KEM) secure against active attackers. In this talk, we'll explore two approaches to add extra security and functionality to post-quantum KEMs by enhancing the FO transform. First, we see how a birthday-style collision argument lets an attacker who collects many ciphertexts halve the security of the FrodoKEM and HQC standards, and how extending the FO transform with public salts thwarts this multi-target attack. Second, we turn to implementation flaws: for 19 months, HQC's reference implementation effectively skipped a security-critical verification step, yet basic correctness tests still passed. We show how the principle of "verifiable verification", via an extension of the FO transform, ties security to functionality, so that an implementation which that skips it visibly breaks.

Thursday, June 18, 2026 2:30 pm - 3:30 pm EDT (GMT -04:00)

Algebraic and Enumerative combinatorics seminar -Scott Neville-Eventual sign coherence

Speaker: Scott Neville
Affiliation: LACIM
Location: MC 6460

AbstractThe sign coherence of c-vectors is one of the fundamental theorems of cluster algebras with principal coefficients.  Gekhtman and Nakanishi posed the Asymptotic Sign Coherence Conjecture for cluster algebras with arbitrary coefficients, which says sign coherence should eventually hold in any sufficiently generic infinite mutation sequence.  We prove that for cluster algebras from quivers of arbitrary rank, their conjecture holds with probability 1 for a random mutation sequence.  Our results also establish the conjecture in full generality for many families of quivers.  This is joint work with Amanda Burcroff.

There will be a pre-seminar presenting relevant background at beginning graduate level starting at 1:30pm in MC 5417.

Friday, June 19, 2026 10:30 am - 11:30 am EDT (GMT -04:00)

Crypto Reading Group - Mojtaba Fadavi and Anna Henderson-HQC PKE/KEM

Speaker:

Mojtaba Fadavi and Anna Henderson
Affiliation: University of Waterloo
Location: MC 5417

Abstract:

This session is devoted to the HQC cryptosystem itself, in both its public-key encryption and key-encapsulation forms. We will explain how the scheme works, describe its main components and design choices, and discuss the corresponding security analysis, including comments on the post-quantum setting. By this stage, the reading group should have enough background to appreciate both the structure and the rationale of HQC.
References: [1] and [4]
[1] C. Aguilar-Melchor, O. Blazy, J.-C. Deneuville, P. Gaborit and G. Zémor. Efficient Encryption From Random Quasi-Cyclic Codes. In IEEE Transactions on Information Theory, vol. 64, no. 5, pp. 3927–3943, 2018.
[4] HQC Team. Hamming Quasi-Cyclic (HQC), NIST Submission, 2025.
A week-by-week plan is outlined at the following link: https://www.leonardocolo.com/seminars/Spring26.html.

Speaker:

Kevin Cheung
Affiliation: Carleton university
Location: DC 2568

Abstract:  In sports scheduling, a single round-robin schedule for $2n$ teams consists of $2n-1$ rounds so that each team plays each of the other $2n-1$ teams exactly once across the rounds and that each team plays exactly one game in each round. With each game played at the venue of one of the two opposing teams, a table of home-away patterns can be extracted from a single round-robin schedule so that the $(i,j)$-entry indicates whether team $i$ plays a home game or an away game in round $j$. 

The home-away pattern set feasibility problem turns the process around and asks: Given an arbitrarily constructed table of home-away patterns, is there a single round-robin schedule compatible with it? Even though single round-robin schedules do not often arise in practice, it is not uncommon in sports scheduling to first specify when teams should play home games and then decide on which opponents they should play against. Being able to efficiently determine if a home-away pattern set is feasible can help with quick generation of potential schedules.

As of today, it is not known if the problem is NP-complete. This talk will focus on polynomial-time checkable necessary conditions for feasibility and conditions under which they are also sufficient. Some personal reflections on the problem will conclude the talk.

Speaker: Mike Cummings
Affiliation: University of Waterloo
Location: MC 6460

Abstract:  When you encounter an algebraic variety in the wild, you might ask: What do its components look like? Which components are smooth? How do the components intersect? For Springer fibres, answers to these questions are only known in some very special cases. This is particularly surprising because other aspects Springer fibres have been studied for the past 50 years and they appear throughout combinatorics and adjacent areas. For just one example: Hall–Littlewood polynomials can be obtained from the cohomology of Springer fibres by taking graded Frobenius characteristic.

One classical theorem says that the components of Springer fibers are indexed by standard Young tableaux. In this talk, we will discuss the benefits of instead using webs to index the components in two cases: the "two row" case, and our recent contributions in the "two column" case. We will see that in these cases, webs both characterize and describe the smooth components of Springer fibres, and give a geometric interpretation of rotation of webs.

There will be a pre-seminar presenting relevant background at beginning graduate level starting at 1:30pm in MC 5417.