BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Jonathan Love (Stanford) and Dan Boneh (Stanford) DTSTART:20200629T211000Z DTEND:20200629T214000Z DTSTAMP:20260423T164733Z UID:ANTS14/1 DESCRIPTION:Title: S upersingular curves with small non-integer endomorphisms\nby Jonathan Love (Stanford) and Dan Boneh (Stanford) as part of Algorithmic Number The ory Symposium (ANTS XIV)\n\n\nAbstract\nWe introduce a special class of su persingular curves over $\\mathbb{F}_{p^2}$\, characterized by the existen ce of non-integer endomorphisms of small degree. A number of properties of this set is proved. Most notably\, we show that when this set partitions into subsets in such a way that curves within each subset have small-degre e isogenies between them\, but curves in distinct subsets have no small-de gree isogenies between them. Despite this\, we show that isogenies between these curves can be computed efficiently\, giving a technique for computi ng isogenies between certain prescribed curves that cannot be reasonably c onnected by searching on $\\ell$-isogeny graphs.\n\nThe slides used in the pre-recorded video can be found here.\n\nChairs: Steven Galbrait h and Christophe Petit\n LOCATION:https://researchseminars.org/talk/ANTS14/1/ END:VEVENT BEGIN:VEVENT SUMMARY:Kirsten Eisenträger (Pennsylvania State)\, Sean Hallgren (Pennsyl vania State)\, Chris Leonardi (University of Waterloo)\, Travis Morrison ( Pennsylvania State)\, and Jennifer Park (University of Michigan) DTSTART:20200629T214500Z DTEND:20200629T221500Z DTSTAMP:20260423T164733Z UID:ANTS14/2 DESCRIPTION:Title: C omputing endomorphism rings of supersingular elliptic curves and connectio ns to pathfinding in isogeny graphs\nby Kirsten Eisenträger (Pennsylv ania State)\, Sean Hallgren (Pennsylvania State)\, Chris Leonardi (Univers ity of Waterloo)\, Travis Morrison (Pennsylvania State)\, and Jennifer Par k (University of Michigan) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nComputing endomorphism rings of supersingular el liptic curves is an important problem in computational number theory\, and it is also closely connected to the security of some of the recently prop osed isogeny-based cryptosystems. In this paper we give a new algorithm fo r computing the endomorphism ring of a supersingular elliptic curve $E$ th at runs\, under certain heuristics\, in time $O((\\log p)^2p^{1/2})$. The algorithm works by first finding two cycles of a certain form in the super singular $\\ell$-isogeny graph $G(p\,\\ell)$\, generating an order $\\Lamb da \\subseteq \\mathrm{End}(E)$. Then all maximal orders containing $\\Lam bda$ are computed\, extending work of Voight. The final step is to determi ne which of these maximal orders is the endomorphism ring. As part of the cycle finding algorithm\, we give a lower bound on the set of all $j$-inva riants $j$ that are adjacent to $j^p$ in $G(p\,\\ell)$\, answering a quest ion in arXiv:1909.07779.\n\ nThe slides used in the pre-recorded video can be found here< /a>.\n\nChairs: Steven Galbraith and Christophe Petit\n LOCATION:https://researchseminars.org/talk/ANTS14/2/ END:VEVENT BEGIN:VEVENT SUMMARY:David Harvey (University of New South Wales\, Sydney) DTSTART:20200629T230000Z DTEND:20200630T000000Z DTSTAMP:20260423T164733Z UID:ANTS14/3 DESCRIPTION:Title: R ecent results on fast multiplication\nby David Harvey (University of N ew South Wales\, Sydney) as part of Algorithmic Number Theory Symposium (A NTS XIV)\n\n\nAbstract\nJoris van der Hoeven and I recently proposed an al gorithm that multiplies two $n$-bit integers in $O(n \\log n)$ bit operati ons. I will explain the main ideas behind this algorithm\, and discuss the difficulties that arise when trying to adapt this algorithm to multiplica tion of polynomials in $F[x]$ where $F$ is a finite field.\n\nThis invited talk by David Harvey was chaired by Steven Galbraith.\n\nThere are two pa pers relevant to this talk:\n\nb y David Harvey and Joris van der Hoeven.\n LOCATION:https://researchseminars.org/talk/ANTS14/3/ END:VEVENT BEGIN:VEVENT SUMMARY:Toshiyuki Katsura (University of Tokyo) and Katsuyuki Takashima (M itsubishi Electric) DTSTART:20200630T001000Z DTEND:20200630T004000Z DTSTAMP:20260423T164733Z UID:ANTS14/4 DESCRIPTION:Title: C ounting Richelot isogenies between superspecial abelian surfaces\nby T oshiyuki Katsura (University of Tokyo) and Katsuyuki Takashima (Mitsubishi Electric) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\n Abstract\nCastryck\, Decru\, and Smith used superspecial genus-2 curves an d their Richelot isogeny graph for basing genus-2 isogeny cryptography\, a nd recently\, Costello and Smith devised an improved isogeny path-finding algorithm in the genus 2 setting. In order to establish a firm ground for the cryptographic construction and analysis\, we give a new characterizati on of decomposed Richelot isogenies in terms of involutive reduced automor phisms of genus-2 curves over a finite field\, and explicitly count such d ecomposed (and non-decomposed) Richelot isogenies between superspecial pri ncipally polarized abelian varieties. As a corollary\, we give another alg ebraic geometric proof of Theorem 3 in the paper of Castryck et al.\n\nCha irs: Brendan Creutz and Felipe Voloch\n LOCATION:https://researchseminars.org/talk/ANTS14/4/ END:VEVENT BEGIN:VEVENT SUMMARY:Momonari Kudo (Kobe City College of Technology)\, Shushi Harashita (Yokohama National University)\, and Everett Howe DTSTART:20200630T004500Z DTEND:20200630T011500Z DTSTAMP:20260423T164733Z UID:ANTS14/5 DESCRIPTION:Title: A lgorithms to enumerate superspecial Howe curves of genus four\nby Momo nari Kudo (Kobe City College of Technology)\, Shushi Harashita (Yokohama N ational University)\, and Everett Howe as part of Algorithmic Number Theor y Symposium (ANTS XIV)\n\n\nAbstract\nA Howe curve (so named by Senda and the first two authors) is a curve of genus $4$ obtained as the fiber produ ct of two genus-$1$ double covers of ${\\mathbf P}^1$. In this paper\, we present a simple algorithm for testing isomorphism of Howe curves\, and we propose two main algorithms for finding and enumerating these curves: One involves solving multivariate systems coming from Cartier--Manin matrices \, while the other uses Richelot isogenies of curves of genus $2$. Compari ng the two algorithms by implementation and by complexity analyses\, we co nclude that the latter enumerates curves more efficiently. However\, in or der to say that the latter strategy outputs all superspecial Howe curves\, we require a conjecture that all superspecial curves of genus $2$ in char acteristic $p>2$ are connected by a path of Richelot isogenies. Given a pr ime $p$\, the algorithm verifies this conjecture before producing output.\ n\nThe slides used in the pre-recorded video can be found here.\n\nChairs: Brendan Creutz and Felipe Voloch\n LOCATION:https://researchseminars.org/talk/ANTS14/5/ END:VEVENT BEGIN:VEVENT SUMMARY:Frank Calegari (University of Chicago)\, Shiva Chidambaram (Univer sity of Chicago)\, and David P. Roberts (University of Minnesota\, Morris) DTSTART:20200630T170000Z DTEND:20200630T173000Z DTSTAMP:20260423T164733Z UID:ANTS14/6 DESCRIPTION:Title: A belian surfaces with fixed 3-torsion\nby Frank Calegari (University of Chicago)\, Shiva Chidambaram (University of Chicago)\, and David P. Rober ts (University of Minnesota\, Morris) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nGiven a genus two curve $X\\colon y^2 =x^5+ax^3+bx^2+cx+d$\, we give an explicit parametrization of all other su ch curves Y with a specified symplectic isomorphism on three-torsion of Ja cobians $\\mathrm{Jac}(X)[3]\\simeq \\mathrm{Jac}(Y)[3]$. It is known that under certain conditions modularity of $X$ implies modularity of infinite ly many of the $Y$\, and we explain how our formulas render this transfer of modularity explicit. Our method centers on the invariant theory of the complex reflection group $C_3\\times \\mathrm{Sp}_4(\\F_3)$. We discuss ot her examples where complex reflection groups are related to moduli spaces of curves\, and in particular motivate our main computation with an exposi tion of the simpler case of the group\n\nChairs: Tom Fisher and Jen Paulhu s\n LOCATION:https://researchseminars.org/talk/ANTS14/6/ END:VEVENT BEGIN:VEVENT SUMMARY:Nils Bruin (Simon Fraser) and Daniel Lewis (University of Arizona) DTSTART:20200630T173000Z DTEND:20200630T180000Z DTSTAMP:20260423T164733Z UID:ANTS14/7 DESCRIPTION:Title: T wo-cover descent on plane quartics with rational bitangents\nby Nils B ruin (Simon Fraser) and Daniel Lewis (University of Arizona) as part of Al gorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nWe implement t wo-cover descent for plane quartics over $\\Q$ with all 28 bitangents rati onal and show that on a significant collection of test cases\, it resolves the existence of rational points. We also review a classical description of the relevant moduli space and use it to generate examples. We observe t hat local obstructions are quite rare for such curves\, and only seem to o ccur in practice at primes of good reduction. In particular\, having good reduction at 11 implies having no rational points. We also gather numerica l data on two-Selmer ranks of Jacobians of these curves\, which suggests t hat these often have non-trivial Tate-Shafarevich groups.\n\nChairs: Tom F isher and Jen Paulhus\n LOCATION:https://researchseminars.org/talk/ANTS14/7/ END:VEVENT BEGIN:VEVENT SUMMARY:Evan MacNeil (University of Calgary)\, Michael J. Jacobson (Univer sity of Calgary)\, and Renate Scheidler (University of Calgary) DTSTART:20200630T190000Z DTEND:20200630T193000Z DTSTAMP:20260423T164733Z UID:ANTS14/8 DESCRIPTION:Title: D ivisor class group arithmetic on non-hyperelliptic genus 3 curves\nby Evan MacNeil (University of Calgary)\, Michael J. Jacobson (University of Calgary)\, and Renate Scheidler (University of Calgary) as part of Algorit hmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nWe present novel ex plicit formulas for arithmetic in the divisor\nclass group of a $C_{3\,4}$ curve. Our formulas handle all cases of inputs and outputs\nwithout havin g to fall back on a generic method. We also improve on the most\ncommonly occurring case by reducing the number of required field inversions\nto one at the cost of a small number of additional field operations\, resulting\ nin running times that are 11-13% faster than the prior state-of-the-art.\ n\nThe slides used in the pre-recorded video can be found here.\n\ nChairs: Tom Fisher and Jen Paulhus\n LOCATION:https://researchseminars.org/talk/ANTS14/8/ END:VEVENT BEGIN:VEVENT SUMMARY:Isabel Vogt (Stanford and University of Washington) DTSTART:20200630T200000Z DTEND:20200630T210000Z DTSTAMP:20260423T164733Z UID:ANTS14/9 DESCRIPTION:Title: A rithmetic and geometry of Brill--Noether loci of curves\nby Isabel Vog t (Stanford and University of Washington) as part of Algorithmic Number Th eory Symposium (ANTS XIV)\n\n\nAbstract\nGiven an abstract curve $C$\, the explicit realizations of $C$ in projective spaces are parameterized by th e Brill--Noether loci of $C$. In this talk\, we will explore some natural questions about the geometry and arithmetic of Brill--Noether loci.\n\nTh is invited talk by Isabel Vogt was chaired by Andrew Sutherland.\n LOCATION:https://researchseminars.org/talk/ANTS14/9/ END:VEVENT BEGIN:VEVENT SUMMARY:Noam Elkies (Harvard) and Zev Klagsbrun (Center for Communications Research) DTSTART:20200630T183000Z DTEND:20200630T190000Z DTSTAMP:20260423T164733Z UID:ANTS14/10 DESCRIPTION:Title: New rank records for elliptic curves having rational torsion\nby Noam Elkies (Harvard) and Zev Klagsbrun (Center for Communications Research) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nWe present rank-record breaking elliptic curves having torsion subgroups $\\Z /n\\Z$\, for $n=2\,3\,4\,5\,6\,7$.\n\nThe slides used in the pre-recorded video can be found here.\n\nChairs: Tom Fisher and Jen Paulhus\n LOCATION:https://researchseminars.org/talk/ANTS14/10/ END:VEVENT BEGIN:VEVENT SUMMARY:Jacqueline Anderson (Bridgewater State University)\, Michelle Mane s (University of Hawaii)\, and Bella Tobin (Oklahoma State University) DTSTART:20200701T180000Z DTEND:20200701T183000Z DTSTAMP:20260423T164733Z UID:ANTS14/11 DESCRIPTION:Title: Cubic post-critically finite polynomials defined over $\\mathbb Q$\nby Jacqueline Anderson (Bridgewater State University)\, Michelle Manes (Univ ersity of Hawaii)\, and Bella Tobin (Oklahoma State University) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nWe describe and implement an algorithm to find all post-critically finite (PCF) cubic polynomials defined over $\\Q$\, up to conjugacy over $\\PGL_2(\\Q)$. We describe normal forms that classify equivalence classes of cubic polynomia ls while respecting the field of definition. Applying known bounds on the coefficients of post-critically bounded polynomials to these normal forms simultaneously at all places of $\\Q$\, we create a finite search space of cubic polynomials over $\\Q$ that may be PCF. Using a computer search of these possibly PCF cubic polynomials\, we find fifteen which are in fact P CF.\n\nThe slides used in the pre-recorded talk are available here.\n\nChairs: Alina Ostafe and Kate Stange\n LOCATION:https://researchseminars.org/talk/ANTS14/11/ END:VEVENT BEGIN:VEVENT SUMMARY:Emerald Stacy (Washington College) DTSTART:20200701T183000Z DTEND:20200701T190000Z DTSTAMP:20260423T164733Z UID:ANTS14/12 DESCRIPTION:Title: Totally $p$-adic numbers of degree 3\nby Emerald Stacy (Washington Col lege) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstr act\nThe height of an algebraic number $\\alpha$ is a measure of how arith metically complicated $\\alpha$ is. We say $\\alpha$ is totally $p$-adic i f the minimal polynomial of $\\alpha$ splits completely over the field $\\ Q_p$ of $p$-adic numbers. In this paper\, we investigate what can be said about the smallest nonzero height of a degree $3$ totally $p$-adic number. \n\nChairs: Alina Ostafe and Kate Stange\n LOCATION:https://researchseminars.org/talk/ANTS14/12/ END:VEVENT BEGIN:VEVENT SUMMARY:Brianna Sorenson (Butler University)\, Jonathan Sorenson (Butler U niversity)\, and Jonathan Webster (Butler University) DTSTART:20200701T190000Z DTEND:20200701T193000Z DTSTAMP:20260423T164733Z UID:ANTS14/13 DESCRIPTION:Title: An algorithm and estimates for the Erdős-Selfridge function\nby Brian na Sorenson (Butler University)\, Jonathan Sorenson (Butler University)\, and Jonathan Webster (Butler University) as part of Algorithmic Number The ory Symposium (ANTS XIV)\n\n\nAbstract\nLet $p(n)$ denote the smallest pri me divisor of the integer $n$. Define the function $g(k)$ to be the smalle st integer $ >k+1$ such that $p(\\binom{g(k)}{k}) >k$. We present a new al gorithm to compute the value of $g(k)$\, and use it to both verify previou s work and compute new values of $g(k)$\, with our current limit being\n\\ [\ng(360) = 4\\ 73246\\ 49994\\ 16835\\ 77114\\ 34474\\ 66861.\n\\]\n\nWe prove that our algorithm runs in time sublinear in $g(k)$\, and under the assumption of a reasonable heuristic\, its running time is\n\\[\ng(k) \\ex p[ -c (k\\log\\log k) /(\\log k)^2 (1+o(1))] \\text{ for } c >0.\n\\]\n\nC hairs: Alina Ostafe and Kate Stange\n LOCATION:https://researchseminars.org/talk/ANTS14/13/ END:VEVENT BEGIN:VEVENT SUMMARY:Felipe Voloch (University of Canterbury) DTSTART:20200701T200000Z DTEND:20200701T210000Z DTSTAMP:20260423T164733Z UID:ANTS14/14 DESCRIPTION:Title: Commitment schemes and Diophantine equations\nby Felipe Voloch (Univer sity of Canterbury) as part of Algorithmic Number Theory Symposium (ANTS X IV)\n\n\nAbstract\nMotivated by questions in cryptography\, we look for di ophantine equations that are hard to solve but for which determining the n umber of solutions is easy.\n\nThis invited talk by Felipe Voloch was host ed by John Voight.\n LOCATION:https://researchseminars.org/talk/ANTS14/14/ END:VEVENT BEGIN:VEVENT SUMMARY:Daniel J. Bernstein (Eindhoven University of Technology)\, Luca De Feo (Université de Versailles)\, Antonin Leroux (LIX - École polytechni que)\, and Benjamin Smith (LIX - École polytechnique) DTSTART:20200702T160000Z DTEND:20200702T163000Z DTSTAMP:20260423T164733Z UID:ANTS14/15 DESCRIPTION:Title: Faster computation of isogenies of large prime degree\nby Daniel J. Be rnstein (Eindhoven University of Technology)\, Luca De Feo (Université de Versailles)\, Antonin Leroux (LIX - École polytechnique)\, and Benjamin Smith (LIX - École polytechnique) as part of Algorithmic Number Theory Sy mposium (ANTS XIV)\n\n\nAbstract\nLet $E/\\F_q$ be an elliptic curve\, and $P$ a point in $E(\\F_q)$ of prime order $\\ell$. Vélu's formulae let us compute a quotient curve $E' = E/\\langle P \\rangle$ and rational maps d efining the quotient isogeny $\\phi\\colon E \\to E'$ in $\\tilde{O}(\\ell )$ $\\F_q$-operations\, where the $\\tilde{O}$ is uniform in $q$. This art icle shows how to compute $E'$\, and $\\phi(Q)$ for $Q$ in $E(\\F_q)$\, us ing only $\\tilde{O}(\\sqrt{\\ell})$ $\\F_q$-operations\, where the $\\til de{O}$ is again uniform in $q$. As an application\, we speed up some compu tations used in the isogeny-based cryptosystems CSIDH and CSURF.\n\nChairs : Wouter Castryck and Chloe Martindale\n LOCATION:https://researchseminars.org/talk/ANTS14/15/ END:VEVENT BEGIN:VEVENT SUMMARY:Bogdan Adrian Dina (Universität Ulm) and Sorina Ionica (Universit é de Picardie) DTSTART:20200702T163000Z DTEND:20200702T170000Z DTSTAMP:20260423T164733Z UID:ANTS14/16 DESCRIPTION:Title: Genus 3 hyperelliptic curves with CM via Shimura reciprocity\nby Bogda n Adrian Dina (Universität Ulm) and Sorina Ionica (Université de Picardi e) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract \nUp to isomorphism over $C$\, every simple principally polarized abelian variety of dimension 3 is the Jacobian of a smooth projective curve of gen us 3. Furthermore\, this curve is either a hyperelliptic curve or a plane quartic. Given a sextic CM field $K$\, we show that if there exists a hype relliptic Jacobian with CM by $K$\, then all principally polarized abelian varieties that are Galois conjugated to it are hyperelliptic. Using Shimu ra's reciprocity law\, we give an algorithm for computing approximations o f the invariants of the initial curve\, as well as their Galois conjugates . This allows us ton define and compute class polynomials for genus 3 hype relliptic curves with CM.\n\nThe slides used in the pre-recorded session a re available here.\n\nChairs: Wouter Castryck and Chloe Martinda le\n LOCATION:https://researchseminars.org/talk/ANTS14/16/ END:VEVENT BEGIN:VEVENT SUMMARY:Mathieu Dutour Sikirić (Rudjer Bosković Institute)\, Anna Haensc h (Duquesne University)\, John Voight (Dartmouth College)\, and Wessel van Woerden (Centrum Wiskunde & Informatica) DTSTART:20200702T170000Z DTEND:20200702T173000Z DTSTAMP:20260423T164733Z UID:ANTS14/17 DESCRIPTION:Title: A canonical form for positive definite matrices\nby Mathieu Dutour Sik irić (Rudjer Bosković Institute)\, Anna Haensch (Duquesne University)\, John Voight (Dartmouth College)\, and Wessel van Woerden (Centrum Wiskunde & Informatica) as part of Algorithmic Number Theory Symposium (ANTS XIV)\ n\nAbstract: TBA\n\nThe slides used in the pre-recorded video can be found here.\n\nChairs: Wouter Castryck and Chloe Martindale\n LOCATION:https://researchseminars.org/talk/ANTS14/17/ END:VEVENT BEGIN:VEVENT SUMMARY:Gustavo Rama (Centro de Matemática) and Gonzalo Tornaría (Centro de Matemática) DTSTART:20200702T193000Z DTEND:20200702T200000Z DTSTAMP:20260423T164733Z UID:ANTS14/18 DESCRIPTION:Title: Computation of paramodular forms\nby Gustavo Rama (Centro de Matemáti ca) and Gonzalo Tornaría (Centro de Matemática) as part of Algorithmic N umber Theory Symposium (ANTS XIV)\n\n\nAbstract\nWe propose an algorithm t o compute paramodular forms of weight 3 as orthogonal modular forms attach ed to positive definite quinary quadratic forms. For square-free levels we expect that every paramodular form of weight 3 arises in this way.\n\nCha irs: Reinier Broker and Christelle Vincent\n LOCATION:https://researchseminars.org/talk/ANTS14/18/ END:VEVENT BEGIN:VEVENT SUMMARY:Edgar Costa (MIT)\, Kiran S. Kedlaya (UCSD)\, and David Roe (MIT) DTSTART:20200702T200000Z DTEND:20200702T203000Z DTSTAMP:20260423T164733Z UID:ANTS14/19 DESCRIPTION:Title: Hypergeometric L-functions in average polynomial time\nby Edgar Costa (MIT)\, Kiran S. Kedlaya (UCSD)\, and David Roe (MIT) as part of Algorithm ic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nWe describe an algori thm for computing\, for all primes $p\\le X$\, the mod-$p$ reduction of th e trace of Frobenius at $p$ of a fixed hypergeometric motive in time quasi linear in $X$. This combines the Beukers--Cohen--Mellit trace formula with average polynomial time techniques of Harvey et al.\n\nThe slides used in the pre-recorded video can be found here.\n\nChairs: Reinier Broker and Christelle Vincent\n LOCATION:https://researchseminars.org/talk/ANTS14/19/ END:VEVENT BEGIN:VEVENT SUMMARY:Ashish Dwivedi (IIT Kanpur) and Nitin Saxena (IIT Kanpur) DTSTART:20200703T140000Z DTEND:20200703T143000Z DTSTAMP:20260423T164733Z UID:ANTS14/20 DESCRIPTION:Title: Computing Igusa's local zeta function of univariates in deterministic poly nomial-time\nby Ashish Dwivedi (IIT Kanpur) and Nitin Saxena (IIT Kanp ur) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstrac t\nIgusa's local zeta function $Z_{f\,p}(s)$ is the generating function th at counts the number of integral roots\, $N_{k}(f)$\, of $f(\\mathbf x) \\ bmod p^k$\, for all $k$. It is a famous result\, in analytic number theory \, that $Z_{f\,p}$ is a rational function in $\\Q(s)$. We give an elementa ry proof of this fact for univariate $f$. Our proof is constructive as it gives a closed-form expression for the number of roots $N_{k}(f)$.\n\nOur proof\, when combined with the recent root-counting algorithm of (Dwivedi\ , Mittal\, Saxena\, CCC\, 2019)\, yields the first deterministic poly($|f| \, \\log p$) time algorithm to compute $Z_{f\,p}(s)$. Previously\, an algo rithm was known only in the case when $f$ completely splits over $\\Q_p$\; it required the rational roots to use the concept of generating function of a tree (Zúñiga-Galindo\, J.Int.Seq.\, 2003).\n\nChairs: Marco Streng and David Kohel\n LOCATION:https://researchseminars.org/talk/ANTS14/20/ END:VEVENT BEGIN:VEVENT SUMMARY:Novak Kaluderovic (EPFL)\, Thorsten Kleinjung (EPFL)\, and Dusan K ostic (EPFL) DTSTART:20200703T143000Z DTEND:20200703T150000Z DTSTAMP:20260423T164733Z UID:ANTS14/21 DESCRIPTION:Title: Cryptanalysis of the generalised Legendre pseudorandom function\nby No vak Kaluderovic (EPFL)\, Thorsten Kleinjung (EPFL)\, and Dusan Kostic (EPF L) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract \nLinear Legendre pseudorandom functions were introduced in 1988 by Damgå rd\, and higher degree generalisations were introduced by Russell and Shpa rlinski in 2004. We present new key recovery methods that improve the stat e of the art for both cases. For degree $r\\geq3$ we give an attack that r uns (after precomputation) in time $O(p^{r-3})$ for the most relevant high degree case\; it is based on an analysis of the actions of the group of M öbius transformations on degree $r$ polynomials. For $r< 3$ we give an $O (p^{r/2})$ attack with $O(p^{r/4})$ oracle queries. In the linear case we recovered the keys for the $64$\, $74$ and $84$-bit prime Ethereum challen ges\, being the first to solve the $84$-bit case.\n\nThe slides used in th e pre-recorded video can be found here.\n\nChairs: Marco Streng and Da vid Kohel\n LOCATION:https://researchseminars.org/talk/ANTS14/21/ END:VEVENT BEGIN:VEVENT SUMMARY:Wouter Castryck (KU Leuven) and Floris Vermeulen (KU Leuven) DTSTART:20200703T153000Z DTEND:20200703T160000Z DTSTAMP:20260423T164733Z UID:ANTS14/22 DESCRIPTION:Title: Lifting low-gonal curves for use in Tuitman's algorithm\nby Wouter Cas tryck (KU Leuven) and Floris Vermeulen (KU Leuven) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nConsider a smooth projec tive curve $\\overline{C}$ over a finite field of odd characteristic\, equ ipped with a simply branched morphism $\\overline{C} \\to \\PP^1$ of degre e $d \\leq 4$. In this article we describe how to efficiently compute a li ft of $\\overline{C}$ to characteristic zero\, such that it can be fed as input to Tuitman's algorithm for computing the Hasse--Weil zeta function o f $\\overline{C}$. The full version of this paper\, which is available on arXiv\, also discusses the case $d=5$ over finite fields of characteristic $ >3$.\n\nChairs: Marco Streng and David Kohel\n LOCATION:https://researchseminars.org/talk/ANTS14/22/ END:VEVENT BEGIN:VEVENT SUMMARY:Andrew Sutherland (MIT) DTSTART:20200703T160000Z DTEND:20200703T163000Z DTSTAMP:20260423T164733Z UID:ANTS14/23 DESCRIPTION:Title: Counting points on superelliptic curves in average polynomial time\nby Andrew Sutherland (MIT) as part of Algorithmic Number Theory Symposium (A NTS XIV)\n\n\nAbstract\nWe describe the practical implementation of an ave rage polynomial-time algorithm for counting points on superelliptic curves defined over $\\Q$ that is substantially faster than previous approaches. Our algorithm takes as input a superelliptic curves $y^m=f(x)$ with $m\\ ge 2$ and $f\\in \\Z[x]$ any squarefree polynomial of degree $d\\ge 3$\, a long with a positive integer $N$. It can compute $\\#X(\\Fp)$ for all $p\ \le N$ not dividing $m\\lc(f)\\disc(f)$ in time $O(md^3 N\\log^3 N\\log\\l og N)$. It achieves this by computing the trace of the Cartier-Manin matr ix of reductions of $X$. We can also compute the Cartier--Manin matrix it self\, which determines the $p$-rank of the Jacobian of $X$ and the numera tor of its zeta function modulo~$p$.\n\nThe slides used in the pre-recorde d video can be found here.\n\nChairs: Marco Streng and David K ohel\n LOCATION:https://researchseminars.org/talk/ANTS14/23/ END:VEVENT BEGIN:VEVENT SUMMARY:Rachel Pries (Colorado State University) DTSTART:20200703T170000Z DTEND:20200703T180000Z DTSTAMP:20260423T164733Z UID:ANTS14/24 DESCRIPTION:Title: Principal polarizations and Shimura data for families of cyclic covers of the projective line\nby Rachel Pries (Colorado State University) as pa rt of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nConsid er a family of degree m cyclic covers of the projective line\, with any nu mber of branch points and inertia type. The Jacobians of the curves in thi s family are abelian varieties having an automorphism of order m with a pr escribed signature. For each such family\, the signature determines a PEL -type Shimura variety. Under a condition on the class number of m\, we de termine the Hermitian form and Shimura datum of the component of the Shimu ra variety containing the Torelli locus. For the proof\, we study the bou ndary of Hurwitz spaces\, investigate narrow class numbers of real cycloto mic fields\, and build on an algorithm of Van Wamelen about principal pola rizations on abelian varieties with complex multiplication. This is joint work with Li\, Mantovan\, and Tang.\n\nThis invited talk by Rachel Pries was hosted by Renate Scheidler\n LOCATION:https://researchseminars.org/talk/ANTS14/24/ END:VEVENT BEGIN:VEVENT SUMMARY:Thomas Espitau (NTT Secure Platform Laboratories) and Paul Kirchne r (Université de Rennes 1) DTSTART:20200704T130000Z DTEND:20200704T133000Z DTSTAMP:20260423T164733Z UID:ANTS14/25 DESCRIPTION:Title: The nearest-colattice algorithm: time-approximation tradeoff for approx-CV P\nby Thomas Espitau (NTT Secure Platform Laboratories) and Paul Kirch ner (Université de Rennes 1) as part of Algorithmic Number Theory Symposi um (ANTS XIV)\n\n\nAbstract\nIn this paper we exhibit a hierarchy of polyn omial time algorithms solving approximate variants of the Closest Vector P roblem (\\CVP). Our first contribution is a heuristic algorithm achieving the same distance as HSVP algorithms\, namely $\\approx \\beta^{\\frac{n}{ 2\\beta}}\\mathrm{covol}(\\Lambda)^{\\frac{1}{n}}$ for a random lattice $\ \Lambda$ of dimension $n$. Compared to Kannan embedding\, our technique al lows using precomputations. This implies that some attacks on some lattice -based signatures lead to very cheap forgeries\, after a precomputation. O ur second contribution is a \\emph{proven} reduction from approximating th e closest vector with a factor $\\approx n^{\\frac32}\\beta^{\\frac{3n}{2\ \beta}}$ to the Shortest Vector Problem (SVP) in dimension $\\beta$.\n\nCh airs: Claus Fieker and Elena Kirshanova\n LOCATION:https://researchseminars.org/talk/ANTS14/25/ END:VEVENT BEGIN:VEVENT SUMMARY:Jean-Sébastien Coron (Université du Luxembourg)\, Luca Notarnico la (Université du Luxembourg)\, and Gabor Wiese (Université du Luxembour g) DTSTART:20200704T133000Z DTEND:20200704T140000Z DTSTAMP:20260423T164733Z UID:ANTS14/26 DESCRIPTION:Title: Simultaneous diagonalization of incomplete matrices and applications\n by Jean-Sébastien Coron (Université du Luxembourg)\, Luca Notarnicola (U niversité du Luxembourg)\, and Gabor Wiese (Université du Luxembourg) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nWe consider the problem of recovering the entries of diagonal matrices $U_a$ for $a = 1\, \\cdots\, t$ from multiple “incomplete” samples $W_a$ of the form $W_a = P*U_a*Q$\, where $P$ and $Q$ are unknown matrices of low r ank. We devise practical algorithms for this problem depending on the rank s of $P$ and $Q$. This problems finds its motivation in cryptanalysis: we show how to significantly improve previous algorithms for solving the appr oximate common divisor problem and breaking CLT13 cryptographic multilinea r maps.\n\nThe slides used in the pre-recorded video can be found here.\n\nChairs: Claus Fieker and Elena Kirshanova\n LOCATION:https://researchseminars.org/talk/ANTS14/26/ END:VEVENT BEGIN:VEVENT SUMMARY:Andrew Booker (University of Bristol) DTSTART:20200704T150000Z DTEND:20200704T160000Z DTSTAMP:20260423T164733Z UID:ANTS14/27 DESCRIPTION:Title: 33 and all that\nby Andrew Booker (University of Bristol) as part of A lgorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nI will speak about sums of three cubes\, while trying to convey the surreal\nexperience of seeing something that I did go viral. If time permits I will\ndescribe on-going follow-up work\, joint with Andrew Sutherland.\n\nPapers related to this talk:\n \n\nThis invited talk by Andrew Booker was hosted by Emmanuel Thomé.\n LOCATION:https://researchseminars.org/talk/ANTS14/27/ END:VEVENT BEGIN:VEVENT SUMMARY:Carl Bootland (KU Leuven)\, Wouter Castryck (KU Leuven)\, and Fred erik Vercauteren (KU Leuven) DTSTART:20200704T163000Z DTEND:20200704T170000Z DTSTAMP:20260423T164733Z UID:ANTS14/28 DESCRIPTION:Title: On the security of the multivariate ring learning with errors problem\ nby Carl Bootland (KU Leuven)\, Wouter Castryck (KU Leuven)\, and Frederik Vercauteren (KU Leuven) as part of Algorithmic Number Theory Symposium (A NTS XIV)\n\n\nAbstract\nThe Multivariate Ring Learning with Errors ($m$-RL WE) problem was introduced in 2015 by Pedrouzo-Ulloa\, Troncoso-Pastoriza and Pérez-González. Instead of working over a polynomial residue ring wi th one variable as in RLWE\, it works over a polynomial residue ring in se veral variables. However\, care must be taken when choosing the multivaria te rings for use in cryptographic applications as they can be either weak or simply equivalent to univariate RLWE. For example\, Pedrouzo-Ulloa et a l.\\ suggest using tensor products of cyclotomic rings\, in particular pow er-of-two cyclotomic rings. They claim incorrectly that the security incre ases with the product of the individual degrees. In this paper\, we presen t simple methods to solve the search $m$-RLWE problem far more efficiently than is stated in the current literature by reducing the problem to the R LWE problem in dimension equal to the maximal degree of its components (an d not the product) and where the noise increases with the square-root of t he degree of the other components. Our methods utilise the fact that the d efining cyclotomic polynomials share algebraically related roots. We use t hese methods to successfully attack the search variant of the $m$-RLWE pro blem for a set of parameters estimated to offer more than 2600 bits of sec urity\, and being equivalent to solving the bounded distance decoding prob lem in a highly structured lattice of dimension 16384\, in less than two w eeks of computation time or just a few hours if parallelized on 128 cores. \n\nChair: Divesh Aggarwal and Emmanuel Thomé\n LOCATION:https://researchseminars.org/talk/ANTS14/28/ END:VEVENT BEGIN:VEVENT SUMMARY:Daniel E. Martin (University of Colorado) DTSTART:20200704T170000Z DTEND:20200704T173000Z DTSTAMP:20260423T164733Z UID:ANTS14/29 DESCRIPTION:Title: Short vector problems and simultaneous approximation\nby Daniel E. Mar tin (University of Colorado) as part of Algorithmic Number Theory Symposiu m (ANTS XIV)\n\n\nAbstract\nIn 1982\, Lagarias showed that solving the app roximate Shortest Vector Problem also solves the problem of finding simult aneous Diophantine approximations. Here we provide the reverse reduction w ith polynomial complexity. It is gap-preserving provided a consistent norm is used to measure approximation quality in both problems. We also give a n alternative to the Lagarias algorithm by first reducing his version of s imultaneous approximation to one with no explicit range in which a solutio n is sought.\n\nThe slides used in the pre-recorded video can be found here.\n\nChair: Divesh Aggarwal and Emmanuel Thomé\n LOCATION:https://researchseminars.org/talk/ANTS14/29/ END:VEVENT BEGIN:VEVENT SUMMARY:David Jao (University of Waterloo) DTSTART:20200702T180000Z DTEND:20200702T190000Z DTSTAMP:20260423T164733Z UID:ANTS14/30 DESCRIPTION:Title: Isogeny-based cryptography: past\, present\, and future\nby David Jao (University of Waterloo) as part of Algorithmic Number Theory Symposium (A NTS XIV)\n\n\nAbstract\nIsogeny-based cryptography is becoming an increasi ngly well-established subject within the post-quantum cryptography landsca pe\, but widespread understanding remains elusive due to the technical and specialized nature of the topic. In this talk we present a clear comparis on of modern-day isogeny-based cryptosystems\, explain the known relations hips between the various security assumptions used in isogeny-based crypto graphy today\, and give algorithmic details of the known attacks against t hese assumptions. We also provide our thoughts regarding what kinds of iso geny-based cryptosystems and security assumptions may emerge in the future .\n\nInvited talk\, chaired by Chloe Martindale.\n LOCATION:https://researchseminars.org/talk/ANTS14/30/ END:VEVENT BEGIN:VEVENT SUMMARY:Mingjie Chen (UCSD)\, Kiran Kedlaya (UCSD)\, and Jun Bo Lau (UCSD) DTSTART:20200630T211000Z DTEND:20200630T212000Z DTSTAMP:20260423T164733Z UID:ANTS14/31 DESCRIPTION:Title: Coleman integration on modular curves\nby Mingjie Chen (UCSD)\, Kiran Kedlaya (UCSD)\, and Jun Bo Lau (UCSD) as part of Algorithmic Number Theor y Symposium (ANTS XIV)\n\nAbstract: TBA\n\nThis is a live poster presentat ion. Click the "paper" link to view the poster.\n LOCATION:https://researchseminars.org/talk/ANTS14/31/ END:VEVENT BEGIN:VEVENT SUMMARY:Eric Bach (University of Wisconsin\, Madison) and Jonathan Sorenso n (Butler University) DTSTART:20200630T212000Z DTEND:20200630T213000Z DTSTAMP:20260423T164733Z UID:ANTS14/32 DESCRIPTION:Title: Generating smooth numbers with known factorization uniformly at random \nby Eric Bach (University of Wisconsin\, Madison) and Jonathan Sorenson ( Butler University) as part of Algorithmic Number Theory Symposium (ANTS XI V)\n\nAbstract: TBA\n\nThis is a live poster presentation. Click the "pap er" link to view the poster.\n LOCATION:https://researchseminars.org/talk/ANTS14/32/ END:VEVENT BEGIN:VEVENT SUMMARY:Samuel Dobson (University of Auckland)\, Steven D. Galbraith (Univ ersity of Auckland)\, and Benjamin Smith (LIX - École polytechnique) DTSTART:20200630T213000Z DTEND:20200630T214000Z DTSTAMP:20260423T164733Z UID:ANTS14/33 DESCRIPTION:Title: Trustless construction of groups of unknown order with hyperelliptic curve s [poster]\nby Samuel Dobson (University of Auckland)\, Steven D. Galb raith (University of Auckland)\, and Benjamin Smith (LIX - École polytech nique) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\nAbstra ct: TBA\n\nThis is a live poster presentation. Click the "paper" link to view the poster.\n LOCATION:https://researchseminars.org/talk/ANTS14/33/ END:VEVENT BEGIN:VEVENT SUMMARY:Semyon Novoselov (Immanuel Kant Baltic Federal University) DTSTART:20200704T142500Z DTEND:20200704T143500Z DTSTAMP:20260423T164733Z UID:ANTS14/34 DESCRIPTION:Title: Counting points on hyperelliptic curves with geometrically split Jacobians \nby Semyon Novoselov (Immanuel Kant Baltic Federal University) as par t of Algorithmic Number Theory Symposium (ANTS XIV)\n\nAbstract: TBA\n\nTh is is a poster presentation. Click the "paper" link to view the poster.\n \nPoster session chair is Benjamin Smith.\n LOCATION:https://researchseminars.org/talk/ANTS14/34/ END:VEVENT BEGIN:VEVENT SUMMARY:Jared Asuncio (Universite de Bordeaux / Universiteit Leiden) DTSTART:20200704T143500Z DTEND:20200704T144500Z DTSTAMP:20260423T164733Z UID:ANTS14/35 DESCRIPTION:Title: Computing the Hilbert class field of primitive quartic CM fields\nby J ared Asuncio (Universite de Bordeaux / Universiteit Leiden) as part of Alg orithmic Number Theory Symposium (ANTS XIV)\n\nAbstract: TBA\n\nThis is a live poster presentation. Click the "paper" link to view the poster.\n\nP oster session chair is Benjamin Smith.\n LOCATION:https://researchseminars.org/talk/ANTS14/35/ END:VEVENT BEGIN:VEVENT SUMMARY:Andrea Basso (University of Birmingham)\, Péter Kutas (University of Birmingham)\, Simon-Philipp Merz (Royal Holloway\, University of Londo n)\, Christophe Petit (University of Birmingham)\, and Charlotte Weitkämp er (University of Birmingham) DTSTART:20200704T144500Z DTEND:20200704T155500Z DTSTAMP:20260423T164733Z UID:ANTS14/36 DESCRIPTION:Title: On adaptive attacks against Jao-Urbanik's isogeny-based protocol\nby A ndrea Basso (University of Birmingham)\, Péter Kutas (University of Birmi ngham)\, Simon-Philipp Merz (Royal Holloway\, University of London)\, Chri stophe Petit (University of Birmingham)\, and Charlotte Weitkämper (Unive rsity of Birmingham) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\nAbstract: TBA\n\nThis is a poster presentation. Click the "paper" link to view the poster.\n\nPoster session chair is Benjamin Smith.\n LOCATION:https://researchseminars.org/talk/ANTS14/36/ END:VEVENT BEGIN:VEVENT SUMMARY:Edgar Costa and Kiran Kedlaya DTSTART:20200629T223000Z DTEND:20200629T225000Z DTSTAMP:20260423T164733Z UID:ANTS14/37 DESCRIPTION:Title: Coffee break: general\nby Edgar Costa and Kiran Kedlaya as part of Alg orithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nDuring the soci al breaks the main Zoom session will be available for those who want to ta lk math with the speakers\, but for those looking for something a bit more laid back Edgar Costa will be hosting tea/coffee breaks at the following locations. Feel free to drop by and say hi to old friends\, and make some new ones!\n LOCATION:https://researchseminars.org/talk/ANTS14/37/ END:VEVENT BEGIN:VEVENT SUMMARY:Alexandre Wallet DTSTART:20200629T223000Z DTEND:20200629T225000Z DTSTAMP:20260423T164733Z UID:ANTS14/38 DESCRIPTION:Title: Coffee break: the students room\nby Alexandre Wallet as part of Algori thmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nCould not attend t he Summer School and want another chance? Afraid of principally polarized abelian varieties? Missing pictionary contests? ANTS Students Only Room wa rmly welcomes you! Click on the link below for a late night chat\, an earl y morning coffee\, or an afternoon snack. Maths discussions are welcome to o\, of course!\n LOCATION:https://researchseminars.org/talk/ANTS14/38/ END:VEVENT BEGIN:VEVENT SUMMARY:Luca de Feo\, Christelle Vincent\, McKenzie West\, and David Roe DTSTART:20200629T223000Z DTEND:20200629T225000Z DTSTAMP:20260423T164733Z UID:ANTS14/39 DESCRIPTION:Title: Coffee break: NT software lullaby\nby Luca de Feo\, Christelle Vincent \, McKenzie West\, and David Roe as part of Algorithmic Number Theory Symp osium (ANTS XIV)\n\n\nAbstract\nWas it print "stuff" or print("stuff")? Pa rent(x) or x.parent()? Colon or not? Emacs or vi? Ask the software experts anything in this session on number theoretic software\, just before every one in Europe goes to bed!\n\nWe will be hearing from Christelle Vincent ( UVM) and Mckenzie West (UW-EC) on Sagemath and LMFDB. More famous 10× cod ers to be announced soon!\n LOCATION:https://researchseminars.org/talk/ANTS14/39/ END:VEVENT BEGIN:VEVENT SUMMARY:Edgar Costa and Kiran Kedlaya DTSTART:20200630T012000Z DTEND:20200630T014000Z DTSTAMP:20260423T164733Z UID:ANTS14/40 DESCRIPTION:Title: Coffee break: general\nby Edgar Costa and Kiran Kedlaya as part of Alg orithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nDuring the soci al breaks the main Zoom session will be available for those who want to ta lk math with the speakers\, but for those looking for something a bit more laid back Edgar Costa will be hosting tea/coffee breaks at the following locations. Feel free to drop by and say hi to old friends\, and make some new ones!\n LOCATION:https://researchseminars.org/talk/ANTS14/40/ END:VEVENT BEGIN:VEVENT SUMMARY:Alexandre Wallet DTSTART:20200630T012000Z DTEND:20200630T014000Z DTSTAMP:20260423T164733Z UID:ANTS14/41 DESCRIPTION:Title: Coffee break: the students room\nby Alexandre Wallet as part of Algori thmic Number Theory Symposium (ANTS XIV)\n\nAbstract: TBA\n LOCATION:https://researchseminars.org/talk/ANTS14/41/ END:VEVENT BEGIN:VEVENT SUMMARY:Steven Galbraith (University of Auckland) DTSTART:20200701T193000Z DTEND:20200701T195000Z DTSTAMP:20260423T164733Z UID:ANTS14/42 DESCRIPTION:Title: Coffee break: ask me anything\nby Steven Galbraith (University of Auck land) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstr act\nI'm happy to answer questions about running ANTS online\, the weather in Auckland\, isogenies\, the academic job market\, being department chai r\, tips for writing papers\, having a famous wife\, how to avoid burnout\ , etc etc.\n LOCATION:https://researchseminars.org/talk/ANTS14/42/ END:VEVENT BEGIN:VEVENT SUMMARY:Felipe Voloch (University of Canterbury) DTSTART:20200630T193000Z DTEND:20200630T195000Z DTSTAMP:20260423T164733Z UID:ANTS14/43 DESCRIPTION:Title: Coffee break\nby Felipe Voloch (University of Canterbury) as part of A lgorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nFeel free to drop in\, say hi\, chat or talk math. Note that I will also be on the main zoom channel after my invited talk the next day for discussions related t o that talk.\n LOCATION:https://researchseminars.org/talk/ANTS14/43/ END:VEVENT BEGIN:VEVENT SUMMARY:Katherine Stange (University of Colorado\, Boulder) and Renate Sch eidler (University of Calgary) DTSTART:20200630T180000Z DTEND:20200630T182000Z DTSTAMP:20260423T164733Z UID:ANTS14/44 DESCRIPTION:Title: Coffee break: Women in numbers\nby Katherine Stange (University of Col orado\, Boulder) and Renate Scheidler (University of Calgary) as part of A lgorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nThe Women in Numbers (WIN) network (womeninnumbertheory.org) aims to support the resear ch of female number theorists. WIN hosts research collaboration conference s and other events\, publishes proceedings\, and maintains online resource s including an email list and a directory.\n\nEveryone (of all genders) is invited to a social event at the end of Session 3 on Tuesday\, June 30\, at 18:00 UTC. Join us to find out more about WIN\, meet other number theor ists or connect with old friends. This brief event will begin with a very quick welcome and "what is...?" about WIN\, and then participants will hav e the opportunity to mingle.\n LOCATION:https://researchseminars.org/talk/ANTS14/44/ END:VEVENT BEGIN:VEVENT SUMMARY:Brendan Creutz and Felipe Voloch DTSTART:20200701T213000Z DTEND:20200701T220000Z DTSTAMP:20260423T164733Z UID:ANTS14/45 DESCRIPTION:Title: Rump session\nby Brendan Creutz and Felipe Voloch as part of Algorithm ic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\n\n\nAs has been the case at prior ANTS conferences\, there will again be a Rump Session. This session is an opportunity for bri ef announcements (such as: progress reports\, news about recent results\, advertisements for conferences of interest\, etc) or comedy items. Talks s hould be short and entertaining.\n\nThe Rump Session for ANTS XIV will tak e place Wednesday\, July 1 starting at 21:30 PM UTC. Please register your interest in presenting\, by Tuesday\, June 30th 21:30 PM UTC\, at this lin k:\n\ndocs.google.com/forms/d/e/1FAIpQLSe9vsI9zucVl39rWMMSUBKho1E1wugjTfap 5wlcYKRGdLfEMA/viewform\n\nShort announcements\, such as conference announ cements\, can be up to 2 minutes in length. Longer announcements (e.g.\, o f new results) can be up to 6 minutes in length. Please state the length o f time you will need in your submission. The Rump Session chairs decide wh ich presentations are accepted. Their decision is final and there is no ap peals process.\n LOCATION:https://researchseminars.org/talk/ANTS14/45/ END:VEVENT BEGIN:VEVENT SUMMARY:Kiran Kedlaya (UCSD) and Renate Scheidler (University of Calgary) DTSTART:20200703T181000Z DTEND:20200703T190000Z DTSTAMP:20260423T164733Z UID:ANTS14/46 DESCRIPTION:Title: Selfridge prize\, followed by business meeting\nby Kiran Kedlaya (UCSD ) and Renate Scheidler (University of Calgary) as part of Algorithmic Numb er Theory Symposium (ANTS XIV)\n\n\nAbstract\nThe business meeting will ta ke place Friday\, July 3 at 18:10 UTC. Here is the meeting agenda:\n\n\nFor questions\, please ask in this thread or email one of:\n\n LOCATION:https://researchseminars.org/talk/ANTS14/46/ END:VEVENT BEGIN:VEVENT SUMMARY:Steven Galbraith and Christophe Petit DTSTART:20200629T223000Z DTEND:20200629T225000Z DTSTAMP:20260423T164733Z UID:ANTS14/47 DESCRIPTION:Title: Continuing discussions with session 1 speakers\nby Steven Galbraith an d Christophe Petit as part of Algorithmic Number Theory Symposium (ANTS XI V)\n\nAbstract: TBA\n LOCATION:https://researchseminars.org/talk/ANTS14/47/ END:VEVENT BEGIN:VEVENT SUMMARY:Brendan Creutz and Felipe Voloch DTSTART:20200630T012000Z DTEND:20200630T014000Z DTSTAMP:20260423T164733Z UID:ANTS14/48 DESCRIPTION:Title: Continuing discussions with session 2 speakers\nby Brendan Creutz and Felipe Voloch as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\ nAbstract: TBA\n LOCATION:https://researchseminars.org/talk/ANTS14/48/ END:VEVENT BEGIN:VEVENT SUMMARY:Steven Galbraith DTSTART:20200630T014500Z DTEND:20200630T020000Z DTSTAMP:20260423T164733Z UID:ANTS14/49 DESCRIPTION:Title: Day one wrap up: feedback and suggestions\nby Steven Galbraith as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\nAbstract: TBA\n LOCATION:https://researchseminars.org/talk/ANTS14/49/ END:VEVENT BEGIN:VEVENT SUMMARY:Tom Fisher and Jen Paulhus DTSTART:20200630T180000Z DTEND:20200630T182000Z DTSTAMP:20260423T164733Z UID:ANTS14/50 DESCRIPTION:Title: Continuing discussions with session 3 speakers\nby Tom Fisher and Jen Paulhus as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\nAbstr act: TBA\n LOCATION:https://researchseminars.org/talk/ANTS14/50/ END:VEVENT BEGIN:VEVENT SUMMARY:Tom Fisher and Jen Paulhus DTSTART:20200630T193000Z DTEND:20200630T195000Z DTSTAMP:20260423T164733Z UID:ANTS14/51 DESCRIPTION:Title: Continuing discussions with session 4 speakers\nby Tom Fisher and Jen Paulhus as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\nAbstr act: TBA\n LOCATION:https://researchseminars.org/talk/ANTS14/51/ END:VEVENT BEGIN:VEVENT SUMMARY:Alina Ostafe and Katherine Stange DTSTART:20200701T193000Z DTEND:20200701T195000Z DTSTAMP:20260423T164733Z UID:ANTS14/52 DESCRIPTION:Title: Continuing discussions with session 5 speakers\nby Alina Ostafe and Ka therine Stange as part of Algorithmic Number Theory Symposium (ANTS XIV)\n \nAbstract: TBA\n LOCATION:https://researchseminars.org/talk/ANTS14/52/ END:VEVENT BEGIN:VEVENT SUMMARY:John Voight DTSTART:20200701T210000Z DTEND:20200701T212000Z DTSTAMP:20260423T164733Z UID:ANTS14/53 DESCRIPTION:Title: Continuing discussions with the invited speaker\nby John Voight as par t of Algorithmic Number Theory Symposium (ANTS XIV)\n\nAbstract: TBA\n LOCATION:https://researchseminars.org/talk/ANTS14/53/ END:VEVENT BEGIN:VEVENT SUMMARY:Michael Naehrig and Joppe Bos DTSTART:20200701T212000Z DTEND:20200701T213000Z DTSTAMP:20260423T164733Z UID:ANTS14/54 DESCRIPTION:Title: Remembering Peter Montgomery\nby Michael Naehrig and Joppe Bos as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\nAbstract: TBA\n LOCATION:https://researchseminars.org/talk/ANTS14/54/ END:VEVENT BEGIN:VEVENT SUMMARY:Wouter Castryck and Chloe Martindale DTSTART:20200702T173000Z DTEND:20200702T175000Z DTSTAMP:20260423T164733Z UID:ANTS14/55 DESCRIPTION:Title: Continuing discussions with session 6 speakers\nby Wouter Castryck and Chloe Martindale as part of Algorithmic Number Theory Symposium (ANTS XIV )\n\nAbstract: TBA\n LOCATION:https://researchseminars.org/talk/ANTS14/55/ END:VEVENT BEGIN:VEVENT SUMMARY:Reinier Broker and Christelle Vincent DTSTART:20200702T203000Z DTEND:20200702T210000Z DTSTAMP:20260423T164733Z UID:ANTS14/56 DESCRIPTION:Title: Continuing discussions with session 7 speakers\nby Reinier Broker and Christelle Vincent as part of Algorithmic Number Theory Symposium (ANTS XI V)\n\nAbstract: TBA\n LOCATION:https://researchseminars.org/talk/ANTS14/56/ END:VEVENT BEGIN:VEVENT SUMMARY:David Kohel and Marco Streng DTSTART:20200703T163000Z DTEND:20200703T165000Z DTSTAMP:20260423T164733Z UID:ANTS14/57 DESCRIPTION:Title: Continuing discussions with session 8 speakers\nby David Kohel and Mar co Streng as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\nAbs tract: TBA\n LOCATION:https://researchseminars.org/talk/ANTS14/57/ END:VEVENT BEGIN:VEVENT SUMMARY:Claus Fieker and Elena Kirshanova DTSTART:20200704T140000Z DTEND:20200704T142000Z DTSTAMP:20260423T164733Z UID:ANTS14/58 DESCRIPTION:Title: Continuing discussions with session 9 speakers\nby Claus Fieker and El ena Kirshanova as part of Algorithmic Number Theory Symposium (ANTS XIV)\n \nAbstract: TBA\n LOCATION:https://researchseminars.org/talk/ANTS14/58/ END:VEVENT BEGIN:VEVENT SUMMARY:Divesh Aggarwal and Emmanuel Thomé DTSTART:20200704T173000Z DTEND:20200704T180000Z DTSTAMP:20260423T164733Z UID:ANTS14/59 DESCRIPTION:Title: Continuing discussion with session 10 speakers and closing\nby Divesh Aggarwal and Emmanuel Thomé as part of Algorithmic Number Theory Symposiu m (ANTS XIV)\n\nAbstract: TBA\n LOCATION:https://researchseminars.org/talk/ANTS14/59/ END:VEVENT BEGIN:VEVENT SUMMARY:Yinan Zhang DTSTART:20200630T214000Z DTEND:20200630T220000Z DTSTAMP:20260423T164733Z UID:ANTS14/60 DESCRIPTION:Title: Coffee break: general\nby Yinan Zhang as part of Algorithmic Number Th eory Symposium (ANTS XIV)\n\nAbstract: TBA\n LOCATION:https://researchseminars.org/talk/ANTS14/60/ END:VEVENT BEGIN:VEVENT SUMMARY:Luca De Feo\, David Roe\, and Mckenzie West DTSTART:20200701T193000Z DTEND:20200701T195000Z DTSTAMP:20260423T164733Z UID:ANTS14/61 DESCRIPTION:Title: Coffee: Computational software for number theory\nby Luca De Feo\, Dav id Roe\, and Mckenzie West as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\nAbstract: TBA\n LOCATION:https://researchseminars.org/talk/ANTS14/61/ END:VEVENT BEGIN:VEVENT SUMMARY:Nils Bruin DTSTART:20200702T190000Z DTEND:20200702T192000Z DTSTAMP:20260423T164733Z UID:ANTS14/62 DESCRIPTION:Title: Coffee break: computational arithmetic geometry\nby Nils Bruin as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\nAbstract: TBA\n LOCATION:https://researchseminars.org/talk/ANTS14/62/ END:VEVENT BEGIN:VEVENT SUMMARY:Chloe Martindale (University of Bristol) DTSTART:20200702T203000Z DTEND:20200702T210000Z DTSTAMP:20260423T164733Z UID:ANTS14/63 DESCRIPTION:Title: Coffee break: Cards against cryptography\nby Chloe Martindale (Univers ity of Bristol) as part of Algorithmic Number Theory Symposium (ANTS XIV)\ n\n\nAbstract\nCards Against Cryptography is a party game for nerdy crypto graphers. Shamelessly based on Cards Against Humanity.\n\nWe'll play using https://md.rereadgames.com in sm all groups (using Zoom breakout rooms). See you there!\n LOCATION:https://researchseminars.org/talk/ANTS14/63/ END:VEVENT BEGIN:VEVENT SUMMARY:Kiran Kedlaya DTSTART:20200701T210000Z DTEND:20200701T212000Z DTSTAMP:20260423T164733Z UID:ANTS14/64 DESCRIPTION:Title: Coffee break: ask me anything\nby Kiran Kedlaya as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nAnd I mean anything: nu mber theory\, algebraic geometry\, pp-adic anything\, algorithms\, Sage\, teaching with Jupyter\, being a journal editor\, California\, math contest s\, game shows\, social justice\, Web sites\, or anything else I didn't th ink of. ANTS newcomers especially welcome!\n LOCATION:https://researchseminars.org/talk/ANTS14/64/ END:VEVENT BEGIN:VEVENT SUMMARY:Luca De Feo\, Dan Gordon\, Victor Miller\, and Michael Naehrig DTSTART:20200703T150000Z DTEND:20200703T152000Z DTSTAMP:20260423T164733Z UID:ANTS14/65 DESCRIPTION:Title: Coffee break: there's a life outside of academia!\nby Luca De Feo\, Da n Gordon\, Victor Miller\, and Michael Naehrig as part of Algorithmic Numb er Theory Symposium (ANTS XIV)\n\n\nAbstract\nJoin us for corporate sponso red coffee from our $10k Nespresso machine and have a chat about non-acade mic careers!\n\nCan I have a ping-pong table in my office? How did you sur vive during the shutdown... did your employer deliver food to your house? Get the answers to all questions you never dared to ask on life outside of Academia by our corporate experts:\n\n\n LOCATION:https://researchseminars.org/talk/ANTS14/65/ END:VEVENT BEGIN:VEVENT SUMMARY:Andrew Shallue (Illinois Wesleyan University) DTSTART:20200702T190000Z DTEND:20200702T192000Z DTSTAMP:20260423T164733Z UID:ANTS14/67 DESCRIPTION:Title: Coffee break: small universities\nby Andrew Shallue (Illinois Wesleya n University) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\ n\nAbstract\nI'll be hosting a social event on Thursday\, UTC 1900 - 1920 (just after the invited talk). I have recently shifted from being a math p rofessor to being a computer science professor (still at Illinois Wesleyan University). Come share your story or ask questions about life at small u niversities\, or find out what that shift has entailed.\n LOCATION:https://researchseminars.org/talk/ANTS14/67/ END:VEVENT BEGIN:VEVENT SUMMARY:Enric Florit and Annamaria Iezzi DTSTART:20200703T163000Z DTEND:20200703T165000Z DTSTAMP:20260423T164733Z UID:ANTS14/68 DESCRIPTION:Title: Coffee break: Meet the baby ants\nby Enric Florit and Annamaria Iezzi as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nI f you are a student\, a postdoc\, an early-career researcher or if you jus t want to hang out with the youngest part of the ANTS community\, this cof fee/tea/juice/beer/wine break is for you! Just zoom in for chatting and ta lking with the baby ants!\n LOCATION:https://researchseminars.org/talk/ANTS14/68/ END:VEVENT BEGIN:VEVENT SUMMARY:David Roe (MIT) DTSTART:20200703T163000Z DTEND:20200703T165000Z DTSTAMP:20260423T164733Z UID:ANTS14/69 DESCRIPTION:Title: Puppy break\nby David Roe (MIT) as part of Algorithmic Number Theory S ymposium (ANTS XIV)\n\n\nAbstract\nFor once\, our furry friends can accomp any us to a conference! Come hang out and bring your puppies (or puppies- at-heart). All dog lovers welcome\, regardless of whether you have a pupp y to contribute (I'll be hanging out with my 3-month old golden retriever Merlin).\n LOCATION:https://researchseminars.org/talk/ANTS14/69/ END:VEVENT BEGIN:VEVENT SUMMARY:Kiran Kedlaya (UCSD) DTSTART:20200703T190000Z DTEND:20200703T203000Z DTSTAMP:20260423T164733Z UID:ANTS14/70 DESCRIPTION:Title: Coffee break: Social justice free-for-all\nby Kiran Kedlaya (UCSD) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nWe m ay not save the world today\, but let's have some fun trying! Come help me brainstorm ways for our community to seize the present moment to advance meaningful social change. Diverse perspectives needed!\n LOCATION:https://researchseminars.org/talk/ANTS14/70/ END:VEVENT BEGIN:VEVENT SUMMARY:Joshua Holden DTSTART:20200703T150000Z DTEND:20200703T152000Z DTSTAMP:20260423T164733Z UID:ANTS14/71 DESCRIPTION:Title: Coffee break: Cryptography and number theory research for undergraduates< /a>\nby Joshua Holden as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nJoin us for a discussion of doing cryptography/number theory research with undergraduate students. We can discuss suitable proj ects (there are lots!)\, different models (credit vs. pay\, year-long vs. one-term vs. summer\, etc.)\, and how to get funding (maybe most important )!\n LOCATION:https://researchseminars.org/talk/ANTS14/71/ END:VEVENT BEGIN:VEVENT SUMMARY:David Kohel and Marco Streng DTSTART:20200703T150000Z DTEND:20200703T152000Z DTSTAMP:20260423T164733Z UID:ANTS14/72 DESCRIPTION:Title: Continuing discussion with session 8 speakers\nby David Kohel and Marc o Streng as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\nAbst ract: TBA\n LOCATION:https://researchseminars.org/talk/ANTS14/72/ END:VEVENT BEGIN:VEVENT SUMMARY:Luca De Feo DTSTART:20200704T140000Z DTEND:20200704T142000Z DTSTAMP:20260423T164733Z UID:ANTS14/73 DESCRIPTION:Title: Coffee break: isogeny-based cost action\nby Luca De Feo as part of Alg orithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nMany very cool ANTS attendees\, including Chloe Martindale\, Benjamin Smith and myself\, are planning to apply for an EU COST action around isogeny-based cryptography. This a network grant\, so the main goal would be to better connect the isogeny community in the participatin g countries by way of workshops and collaborations throughout the year.\n\ nJoin us for coffee and ask your questions on how COST actions work\, on w hat our plan is\, and more.\n LOCATION:https://researchseminars.org/talk/ANTS14/73/ END:VEVENT BEGIN:VEVENT SUMMARY:Claus Fieker and Emmanuel Thomé DTSTART:20200704T160000Z DTEND:20200704T170000Z DTSTAMP:20260423T164733Z UID:ANTS14/74 DESCRIPTION:Title: Continuing discussion with the invited speaker\nby Claus Fieker and Em manuel Thomé as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\ nAbstract: TBA\n LOCATION:https://researchseminars.org/talk/ANTS14/74/ END:VEVENT END:VCALENDAR