Talks

2025

Hardware in Modern Cryptography

Cryptographic protocols often start as software prototypes, yet ASIC and FPGA architectures can differ radically. We discuss some of …

Sep 11, 2025 Munich, Germany

Video

Arithmetization-Friendly Primes and Efficient Constraint Evaluation: STARKs on Custom Hardware

Under the premise of fully custom hardware, we explore more efficient choices of prime numbers in STARKs. In particular, we show that …

May 12, 2025 Toronto, Canada

Monolith: Circuit-Friendly Hash Functions with New Nonlinear Layers for Fast and Constant-Time Implementations

Hash functions are a crucial component in incrementally verifiable computation (IVC) protocols and applications. Among those, recursive …

Mar 17, 2025 Rome, Italy

PDF Code Video

2024

SNARK-Friendly Hash Functions: Past, Present, Future

This talk will discuss the beginnings of SNARK-friendly symmetric primitives, current challenges, and future directions.

Sep 12, 2024 Munich, Germany

2023

Horst Meets Fluid-SPN: Griffin for Zero-Knowledge Applications

Zero-knowledge (ZK) applications form a large group of use cases in modern cryptography, and recently gained in popularity due to novel …

Aug 22, 2023 Santa Barbara, USA

PDF Slides

Poseidon2: A Faster Version of the Poseidon Hash Function

Zero-knowledge proof systems for computational integrity have seen a rise in popularity in the last couple of years. One of the results …

Apr 4, 2023 Lisbon, Portugal

Video

2022

Proving Resistance Against Infinitely Long Subspace Trails: How to Choose the Linear Layer

Designing cryptographic permutations and block ciphers using a substitution-permutation network (SPN) approach where the nonlinear part …

Mar 24, 2022 Athens, Greece

PDF Video

2021

Horst Meets Fluid-SPN: Griffin for Zero-Knowledge Applications

Zero-knowledge (ZK) applications form a large group of use cases in modern cryptography, and recently gained in popularity due to novel …

Sep 16, 2021 Bergen, Norway

Poseidon: A New Hash Function for Zero-Knowledge Proof Systems

The area of practical computational integrity proof systems, like SNARKs, STARKs, Bulletproofs, is seeing a very dynamic development …

Aug 11, 2021 Vancouver, Canada (Virtual Event)

Slides Video

2020

An Algebraic Attack on Ciphers with Low-Degree Round Functions: Application to Full MiMC

Algebraically simple PRFs, ciphers, or cryptographic hash functions are becoming increasingly popular, for example due to their …

Dec 8, 2020 Daejeon, South Korea (Virtual Event)

Slides Video

On a Generalization of Substitution-Permutation Networks: The HADES Design Strategy

Keyed and unkeyed cryptographic permutations often iterate simple round functions. Substitution-permutation networks (SPNs) are an …

May 13, 2020 Zagreb, Croatia (Virtual Event)

PDF Video

2019

Algebraic Cryptanalysis of Variants of Frit

Frit is a cryptographic 384-bit permutation recently proposed by Simon et al. and follows a novel design approach for built-in …

Aug 14, 2019 Waterloo, Canada

Algebraic Cryptanalysis of Jarvis and Friday

In this rump session talk we present our preliminary results regarding new algebraic attacks on Jarvis and Friday.

Mar 27, 2019 Paris, France

Slides Video