Abstract

In this talk, we will discuss the modular interpretation of the Hessian transformation on elliptic curves. We begin by recalling some classical results concerning the action of the Hessian transforma-tion on the j-invariants and on the Hesse pencil, and we rephrase them in the context of the modu-lar curves X(1) and X(3). Building on the work of Mula, Pintore, and Taufer in the recent preprint (ArXiv:2407.17042), we lift the Hessian transformation up to maps on 16 different modular curves, in-cluding X(6), and analyse their effects on the associated moduli spaces. Finally, we give a numerical representation of Hessian map on the extended complex upper half-plane H∗. This talk is based on the speaker’s Master’s thesis supervised by Pintore, Taufer and Mula.

Bio

Riccardo Lolato — Master’s degree in Mathematics – Cryptography, Universita` degli Studi di Trento.

Photo provided by speaker

Abstract
Computing is bottlenecked by data. Large amounts of application data overwhelm the storage capability, communication capability, and computation capability of the modern machines we design today. As a result, many key applications’ performance, efficiency, and scalability are bottlenecked by data movement. In this talk, we describe three major shortcomings of modern computers in terms of 1) dealing with data, 2) taking advantage of vast amounts of data, and 3) exploiting different semantic properties of application data. We argue that an intelligent computing architecture should be designed to handle data well. We posit that handling data well requires designing architectures based on three key principles: 1) data-centric, 2) data-driven, 3) data-aware. We give examples of how to exploit these principles to design a much more efficient and higher performance computing system. We especially discuss recent research that aims to fundamentally reduce memory latency and energy, and practically enable computation close to data, with at least two promising directions: 1) processing using memory, which exploits the fundamental operational properties of memory chips to perform massively-parallel computation in memory, with low-cost changes, 2) processing near memory, which integrates sophisticated additional processing capability in memory chips, the logic layer of 3D-stacked technologies, or memory controllers to enable near-memory computation with high memory bandwidth and low memory latency. We show both types of architectures can enable order(s) of magnitude improvements in performance and energy consumption of many important workloads, such as artificial intelligence, machine learning, graph analytics, database systems, video processing, climate modeling, genome analysis. We discuss how to enable adoption of such fundamentally more intelligent architectures, which are key to efficiency, performance, and sustainability. We conclude with some research opportunities in and guiding principles for future computing architecture and system designs.

An accompanying overview of modern memory-centric computing ideas & systems can be found at arxiv.org/pdf/2012.03112 (“A Modern Primer on Processing in Memory”, updated February 2025).

A shorter invited paper from IMW 2025 is at arxiv.org/pdf/2505.00458 (“Memory-Centric Computing: Solving Computing’s Memory Problem”, May 2025)

Bio

Onur Mutlu is a Professor of Computer Science at ETH Zurich. He previously held the William D. and Nancy W. Strecker Early Career Professorship at Carnegie Mellon University. His current research interests are in computer architecture, computing systems, hardware security, memory & storage systems, and bioinformatics, with a major focus on designing fundamentally energy-efficient, high-performance, and robust computing systems. Many techniques he, with his group and collaborators, has invented over the years have largely influenced industry and have been widely employed in commercial microprocessors and memory & storage systems used daily by hundreds of millions of people. He obtained his PhD and MS in ECE from the University of Texas at Austin and BS degrees in Computer Engineering and Psychology from the University of Michigan, Ann Arbor. He started the Computer Architecture Group at Microsoft Research (2006-2009), and held product, research and visiting positions at Intel Corporation, Advanced Micro Devices, VMware, Google, and Stanford University. He received various honors for his research, including the 2025 IEEE Computer Society Harry H. Goode Memorial Award “for seminal contributions to computer architecture research and practice, especially in memory systems,” 2024 IFIP WG10.4 Jean-Claude Laprie Award in Dependable Computing (for the original RowHammer work), 2022 Persistent Impact Prize of the Non-Volatile Memory Systems Workshop (for original architectural work on Phase Change Memory), 2021 IEEE High Performance Computer Architecture Conference Test of Time Award (for the Runahead Execution work), 2020 IEEE Computer Society Edward J. McCluskey Technical Achievement Award, 2019 ACM SIGARCH Maurice Wilkes Award and more than thirty best paper, “Top Pick” paper, or test-of-time recognitions at various leading computer systems, architecture, and security venues. He is an ACM Fellow, IEEE Fellow, and an elected member of the Academy of Europe. He enjoys teaching, mentoring, and enabling & democratizing access to high-quality research and education. He has supervised 24 PhD graduates, many of whom received major dissertation awards, 15 postdoctoral trainees, and more than 60 Master’s and Bachelor’s students. His computer architecture and digital logic design course lectures and materials are freely available on YouTube (OnurMutluLectures & @CMUCompArch), and his research group makes a wide variety of open-source artifacts freely available online. For more information, please see his webpage.

Photo provided by speaker

Abstract
A tweakable enciphering mode (TEM) is a cryptographic primitive that provides length-preserving encryption. In 2024, the National Institute of Standards and Technology (NIST) issued the Accordion call to standardize future-proof TEMs. TEMs serve as building blocks for various modes of operation, including authenticated encryption (AE), deterministic AE (DAE) and disk encryption. NIST has identified context commitment (CMT-4) as an important security objective for TEMs when used in AE/DAE.

We will start the talk by discussing the challenges of CMT-4 secure TEMs. In particular, we show that many existing TEMs, such as HCTR2 and Adiantum, fail to achieve CMT-4. We discuss different approaches to remedy the situation, and conclude our talk by proposing novel TEM designs, which are the first to achieve provably CMT-4 security.

Abstract
Critical industries like avionics or automotive have the possibility of collecting large sets of data during the functioning of their products. Originally dedicated to vital functions as safety and security, data may be collected to any component level nowadays. This is due to the replacement of analogical and mechanical parts by electrical solutions. For instance, an automotive braking system may be replaced, completely, by a X by Wire solution, meaning that the hydraulic components are replaced by electrical components. To keep safeness and security as accurate as previous components, the sampling frequency of electrical components (sensors, engines, etc) is as high as possible, producing large sets of data. Under the pressure of other industries that benefit from the arrival of statistical methods and models dealing with large sets of data to accelerate their development cycles, critical industries analyze the possibility to integrate such methods and models within their own development cycle. Within this talk, we present pros and cons on the utilization of existing large sets of data, while focusing on the safety.

Bio
Liliana Cucu-Grosjean is a Research Director at the French National Institute in Computer Science and Automation (Inria) in Paris, France, where she leads the Kopernic research team. Her research interests include real-time, embedded and cyber-physical systems with a focus on the use of probabilistic and statistical methods for analyzing the schedulability of programs and estimating worst-case execution of those programs. Co-author of several seminal papers on probabilistic and statistical methods for real-time systems, Liliana has published more than 60 papers in top TCRTS conferences and journals. Chair of the first TCRTS diversity sub-committees (2016 to 2020), she has also co-founded the Inria diversity committee in 2015, that she co-chaired until 2022. Since January 2023, she has been the elected IEEE TCRTS vice-chair. Since December 2019, she has been co-founder of the start-up StatInf, an Inria spin-off.


Organizer: Dean’s Office CSBME
More: CS Talk #16
Photo provided by CSBME

Abstract 

The Ascon authenticated encryption scheme and hash function of Dobraunig et al. (Journal of Cryptology 2021) were recently selected as winner of the NIST lightweight cryptography competition. The mode underlying Ascon authenticated encryption (Ascon-AE) resembles ideas of SpongeWrap, but not quite, and various works have investigated the generic security of Ascon-AE, all covering different attack scenarios and with different bounds.

This work systematizes knowledge on the mode security of Ascon-AE, and fills gaps where needed. We consider six mainstream security models, all in the multi-user setting: (i) nonce-respecting security, reflecting on the existing bounds of Chakraborty et al. (ASIACRYPT 2023, ACISP 2024) and Lefevre and Mennink (SAC 2024), (ii) nonce-misuse resistance, observing a non-fixable flaw in the proof of Chakraborty et al. (ACISP 2024), (iii) nonce-misuse resilience, delivering missing security analysis, (iv) leakage resilience, delivering a new security analysis that supersedes the informal proof sketch (though in a different model) of Guo et al. (ToSC 2020), (v) state-recovery security, expanding on the analysis of Lefevre and Mennink, and (vi) release of unverified plaintext, also delivering missing security analysis. We also match all bounds with tight attacks (up to constant and up to reasonable assumptions). As a bonus, we systematize the knowledge on Ascon-Hash and Ascon-PRF.

Bio
Bart Mennink received his PhD in May 2013 from KU Leuven, Belgium, and has subsequently been a postdoctoral researcher at KU Leuven and in the Digital Security group at Radboud University Nijmegen. Currently, he is associate professor on cryptography in the Digital Security Group at Radboud University Nijmegen. His main field of research is the design and provable security of symmetric cryptographic protocols, with the current focus on lightweight authentication and encryption. Bart Mennink is co-designer of Chaskey, and ISO standardized MAC function, and of COLM, an authenticated encryption scheme that was selected for the final portfolio of the CAESAR competition. He is furthermore co-designer of Elephant and ISAP, finalist authenticated encryption schemes in the NIST Lightweight Cryptography competition. Bart has published over 100 articles, he has been (co-)organizer of multiple international conferences and workshops, and has given over 15 keynotes at various conferences and workshops.

Photo provided by speaker