BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Nam Hoai Le (Florida Atlantic University) DTSTART:20260915T140000Z DTEND:20260915T150000Z DTSTAMP:20261010T023426Z UID:CryptoCafe/52 DESCRIPTION:Title: Optimal Bucket Set Construction for Multi-scalar Multiplication with E ndomorphisms\nby Nam Hoai Le (Florida Atlantic University) as part of Florida Atlantic University Crypto Café\n\nLecture held in SE 215.\n\nAbs tract\nMulti-scalar multiplication (MSM)\, which computes a linear combina tion of elliptic-curve points of the form $\\sum_i a_iP_i$\, is a major co mputational bottleneck in many modern cryptographic protocols\, particular ly in proof systems. In 2023\, Luo\, Fu\, and Gong (LFG) introduced a fram ework for accelerating MSM using a bucket set together with a multiplier s et\, allowing a trade-off between storage and online computation. In 2025\ , Fan\, Sica\, Kuchta\, and Xu (FKSX) applied the LFG framework to efficie nt endomorphisms\, exploiting units that can be applied essentially on the fly. This raises a natural optimization problem: Can we minimize the buck et size while still admitting an efficient Hamiltonian path for bucket acc umulation?\n\nIn this talk\, I will present our construction from a geomet ric viewpoint over the Eisenstein integers. I will show how this viewpoint leads to an optimal hexagonal bucket set and also allows us to construct an efficient Hamiltonian path for the bucket accumulation step. Moreover\, we generalize the construction to larger multiplier sets\, providing furt her time-memory trade-offs when additional storage is available.\n\nThis w ork will be presented at ASIACRYPT 2026 and is joint work with Francesco S ica.\n\nNam Hoai Le is a PhD student at Florida Atlantic University.\n LOCATION:https://researchseminars.org/talk/CryptoCafe/52/ END:VEVENT END:VCALENDAR