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;VALUE=DATE-TIME:20200629T211000Z
DTEND;VALUE=DATE-TIME:20200629T214000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/1
DESCRIPTION:Title: Supersingular curves with small non-integer endomorphis
ms\nby Jonathan Love (Stanford) and Dan Boneh (Stanford) as part of Algori
thmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nWe introduce a spe
cial class of supersingular curves over $\\mathbb{F}_{p^2}$\, characterize
d by the existence 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-degree isogenies between them\, but curves in distinct subsets
have no small-degree isogenies between them. Despite this\, we show that i
sogenies between these curves can be computed efficiently\, giving a techn
ique for computing isogenies between certain prescribed curves that cannot
be reasonably connected by searching on $\\ell$-isogeny graphs.\n\nChairs
: Steven Galbraith and Christophe Petit\n
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;VALUE=DATE-TIME:20200629T214500Z
DTEND;VALUE=DATE-TIME:20200629T221500Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/2
DESCRIPTION:Title: Computing endomorphism rings of supersingular elliptic
curves and connections to pathfinding in isogeny graphs\nby Kirsten Eisent
räger (Pennsylvania State)\, Sean Hallgren (Pennsylvania State)\, Chris L
eonardi (University of Waterloo)\, Travis Morrison (Pennsylvania State)\,
and Jennifer Park (University of Michigan) as part of Algorithmic Number T
heory Symposium (ANTS XIV)\n\n\nAbstract\nComputing endomorphism rings of
supersingular elliptic curves is an important problem in computational num
ber theory\, and it is also closely connected to the security of some of t
he recently proposed isogeny-based cryptosystems. In this paper we give a
new algorithm for computing the endomorphism ring of a supersingular ellip
tic curve $E$ that runs\, under certain heuristics\, in time $O((\\log p)^
2p^{1/2})$. The algorithm works by first finding two cycles of a certain f
orm in the supersingular $\\ell$-isogeny graph $G(p\,\\ell)$\, generating
an order $\\Lambda \\subseteq \\mathrm{End}(E)$. Then all maximal orders c
ontaining $\\Lambda$ are computed\, extending work of Voight. The final st
ep is to determine 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$-invariants $j$ that are adjacent to $j^p$ in $G(p\,\\ell)$\, a
nswering a question in arXiv:19
09.07779.\n\nChairs: Steven Galbraith and Christophe Petit\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:David Harvey (University of New South Wales\, Sydney)
DTSTART;VALUE=DATE-TIME:20200629T230000Z
DTEND;VALUE=DATE-TIME:20200630T000000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/3
DESCRIPTION:Title: Recent results on fast multiplication\nby David Harvey
(University of New South Wales\, Sydney) as part of Algorithmic Number The
ory Symposium (ANTS XIV)\n\n\nAbstract\nJoris van der Hoeven and I recentl
y proposed an algorithm that multiplies two $n$-bit integers in $O(n \\log
n)$ bit operations. I will explain the main ideas behind this algorithm\,
and discuss the difficulties that arise when trying to adapt this algorit
hm to multiplication of polynomials in $F[x]$ where $F$ is a finite field.
\n\nInvited talk\, chaired by Galbraith.\n\nThere are two papers relevant
to this talk\, one on integer multiplication and one on multiplying polynomials over finite fields.\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Toshiyuki Katsura (University of Tokyo) and Katsuyuki Takashima (M
itsubishi Electric)
DTSTART;VALUE=DATE-TIME:20200630T001000Z
DTEND;VALUE=DATE-TIME:20200630T004000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/4
DESCRIPTION:Title: Counting Richelot isogenies between superspecial abelia
n surfaces\nby Toshiyuki Katsura (University of Tokyo) and Katsuyuki Takas
hima (Mitsubishi Electric) as part of Algorithmic Number Theory Symposium
(ANTS XIV)\n\n\nAbstract\nCastryck\, Decru\, and Smith used superspecial g
enus-2 curves and their Richelot isogeny graph for basing genus-2 isogeny
cryptography\, and recently\, Costello and Smith devised an improved isoge
ny path-finding algorithm in the genus 2 setting. In order to establish a
firm ground for the cryptographic construction and analysis\, we give a ne
w characterization of decomposed Richelot isogenies in terms of involutive
reduced automorphisms of genus-2 curves over a finite field\, and explici
tly count such decomposed (and non-decomposed) Richelot isogenies between
superspecial principally polarized abelian varieties. As a corollary\, we
give another algebraic geometric proof of Theorem 3 in the paper of Castry
ck et al.\n\nChairs: Brendan Creutz and Felipe Voloch\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Momonari Kudo (Kobe City College of Technology)\, Shushi Harashita
(Yokohama National University)\, and Everett Howe
DTSTART;VALUE=DATE-TIME:20200630T004500Z
DTEND;VALUE=DATE-TIME:20200630T011500Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/5
DESCRIPTION:Title: Algorithms to enumerate superspecial Howe curves of gen
us four\nby Momonari Kudo (Kobe City College of Technology)\, Shushi Haras
hita (Yokohama National University)\, and Everett Howe as part of Algorith
mic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nA Howe curve (so nam
ed by Senda and the first two authors) is a curve of genus $4$ obtained as
the fiber product 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 t
hese curves: One involves solving multivariate systems coming from Cartier
--Manin matrices\, while the other uses Richelot isogenies of curves of ge
nus $2$. Comparing the two algorithms by implementation and by complexity
analyses\, we conclude that the latter enumerates curves more efficiently.
However\, in order to say that the latter strategy outputs all superspeci
al Howe curves\, we require a conjecture that all superspecial curves of g
enus $2$ in characteristic $p>2$ are connected by a path of Richelot isoge
nies. Given a prime $p$\, the algorithm verifies this conjecture before pr
oducing output.\n\nChairs: Brendan Creutz and Felipe Voloch\n
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;VALUE=DATE-TIME:20200630T170000Z
DTEND;VALUE=DATE-TIME:20200630T173000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/6
DESCRIPTION:Title: Abelian surfaces with fixed 3-torsion\nby Frank Calegar
i (University of Chicago)\, Shiva Chidambaram (University of Chicago)\, an
d David P. Roberts (University of Minnesota\, Morris) as part of Algorithm
ic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nGiven a genus two cur
ve $X\\colon y^2=x^5+ax^3+bx^2+cx+d$\, we give an explicit parametrization
of all other such curves Y with a specified symplectic isomorphism on thr
ee-torsion of Jacobians $\\mathrm{Jac}(X)[3]\\simeq \\mathrm{Jac}(Y)[3]$.
It is known that under certain conditions modularity of $X$ implies modula
rity of infinitely many of the $Y$\, and we explain how our formulas rende
r this transfer of modularity explicit. Our method centers on the invarian
t theory of the complex reflection group $C_3\\times \\mathrm{Sp}_4(\\F_3)
$. We discuss other examples where complex reflection groups are related t
o moduli spaces of curves\, and in particular motivate our main computatio
n with an exposition of the simpler case of the group\n\nChairs: Tom Fishe
r and Jen Paulhus\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Nils Bruin (Simon Fraser) and Daniel Lewis (University of Arizona)
DTSTART;VALUE=DATE-TIME:20200630T173000Z
DTEND;VALUE=DATE-TIME:20200630T180000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/7
DESCRIPTION:Title: Two-cover descent on plane quartics with rational bitan
gents\nby Nils Bruin (Simon Fraser) and Daniel Lewis (University of Arizon
a) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract
\nWe implement two-cover descent for plane quartics over $\\Q$ with all 28
bitangents rational and show that on a significant collection of test cas
es\, it resolves the existence of rational points. We also review a classi
cal description of the relevant moduli space and use it to generate exampl
es. We observe that local obstructions are quite rare for such curves\, an
d only seem to occur in practice at primes of good reduction. In particula
r\, having good reduction at 11 implies having no rational points. We also
gather numerical data on two-Selmer ranks of Jacobians of these curves\,
which suggests that these often have non-trivial Tate-Shafarevich groups.\
n\nChairs: Tom Fisher and Jen Paulhus\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Evan MacNeil (University of Calgary)\, Michael J. Jacobson (Univer
sity of Calgary)\, and Renate Scheidler (University of Calgary)
DTSTART;VALUE=DATE-TIME:20200630T190000Z
DTEND;VALUE=DATE-TIME:20200630T193000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/8
DESCRIPTION:Title: Divisor class group arithmetic on non-hyperelliptic gen
us 3 curves\nby Evan MacNeil (University of Calgary)\, Michael J. Jacobson
(University of Calgary)\, and Renate Scheidler (University of Calgary) as
part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nWe
present novel explicit formulas for arithmetic in the divisor\nclass group
of a $C_{3\,4}$ curve. Our formulas handle all cases of inputs and output
s\nwithout having to fall back on a generic method. We also improve on the
most\ncommonly occurring case by reducing the number of required field in
versions\nto one at the cost of a small number of additional field operati
ons\, resulting\nin running times that are 11-13% faster than the prior st
ate-of-the-art.\n\nChairs: Tom Fisher and Jen Paulhus\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Isabel Vogt (Stanford and University of Washington)
DTSTART;VALUE=DATE-TIME:20200630T200000Z
DTEND;VALUE=DATE-TIME:20200630T210000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/9
DESCRIPTION:Title: Arithmetic and geometry of Brill--Noether loci of curve
s\nby Isabel Vogt (Stanford and University of Washington) as part of Algor
ithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nGiven an abstract
curve $C$\, the explicit realizations of $C$ in projective spaces are par
ameterized by the Brill--Noether loci of $C$. In this talk\, we will expl
ore some natural questions about the geometry and arithmetic of Brill--Noe
ther loci.\n\nInvited talk\, chaired by Andrew Sutherland.\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Noam Elkies (Harvard) and Zev Klagsbrun (Center for Communications
Research)
DTSTART;VALUE=DATE-TIME:20200630T183000Z
DTEND;VALUE=DATE-TIME:20200630T190000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/10
DESCRIPTION:Title: New rank records for elliptic curves having rational to
rsion\nby Noam Elkies (Harvard) and Zev Klagsbrun (Center for Communicatio
ns Research) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n
\nAbstract\nWe present rank-record breaking elliptic curves having torsion
subgroups $\\Z/2\\Z$\, $\\Z/3\\Z$\, $\\Z/4\\Z$\, $\\Z/6\\Z$\, and $\\Z/7\
\Z$.\n\nChairs: Tom Fisher and Jen Paulhus\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jacqueline Anderson (Bridgewater State University)\, Michelle Mane
s (University of Hawaii)\, and Bella Tobin (Oklahoma State University)
DTSTART;VALUE=DATE-TIME:20200701T180000Z
DTEND;VALUE=DATE-TIME:20200701T183000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/11
DESCRIPTION:Title: Cubic post-critically finite polynomials defined over $
\\mathbb Q$\nby Jacqueline Anderson (Bridgewater State University)\, Miche
lle Manes (University of Hawaii)\, and Bella Tobin (Oklahoma State Univers
ity) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstra
ct\nWe describe and implement an algorithm to find all post-critically fin
ite (PCF) cubic polynomials defined over $\\Q$\, up to conjugacy over $\\P
GL_2(\\Q)$. We describe normal forms that classify equivalence classes of
cubic polynomials while respecting the field of definition. Applying known
bounds on the coefficients of post-critically bounded polynomials to thes
e 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 comp
uter search of these possibly PCF cubic polynomials\, we find fifteen whic
h are in fact PCF.\n\nChairs: Alina Ostafe and Kate Stange\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Emerald Stacy (Washington College)
DTSTART;VALUE=DATE-TIME:20200701T183000Z
DTEND;VALUE=DATE-TIME:20200701T190000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/12
DESCRIPTION:Title: Totally $p$-adic numbers of degree 3\nby Emerald Stacy
(Washington College) as part of Algorithmic Number Theory Symposium (ANTS
XIV)\n\n\nAbstract\nThe height of an algebraic number $\\alpha$ is a measu
re of how arithmetically complicated $\\alpha$ is. We say $\\alpha$ is tot
ally $p$-adic if the minimal polynomial of $\\alpha$ splits completely ove
r the field $\\Q_p$ of $p$-adic numbers. In this paper\, we investigate wh
at can be said about the smallest nonzero height of a degree $3$ totally $
p$-adic number.\n\nChairs: Alina Ostafe and Kate Stange\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Brianna Sorenson (Butler University)\, Jonathan Sorenson (Butler U
niversity)\, and Jonathan Webster (Butler University)
DTSTART;VALUE=DATE-TIME:20200701T190000Z
DTEND;VALUE=DATE-TIME:20200701T193000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/13
DESCRIPTION:Title: An algorithm and estimates for the Erdős-Selfridge fun
ction\nby Brianna Sorenson (Butler University)\, Jonathan Sorenson (Butler
University)\, and Jonathan Webster (Butler University) as part of Algorit
hmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nLet $p(n)$ denote t
he smallest prime divisor of the integer $n$. Define the function $g(k)$ t
o be the smallest integer $ >k+1$ such that $p(\\binom{g(k)}{k}) >k$. We p
resent a new algorithm to compute the value of $g(k)$\, and use it to both
verify previous work and compute new values of $g(k)$\, with our current
limit being\n\\[\ng(360) = 4\\ 73246\\ 49994\\ 16835\\ 77114\\ 34474\\ 668
61.\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) \\exp[ -c (k\\log\\log k) /(\\log k)^2 (1+o(1))] \\text{ for }
c >0.\n\\]\n\nChairs: Alina Ostafe and Kate Stange\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Felipe Voloch (University of Canterbury)
DTSTART;VALUE=DATE-TIME:20200701T200000Z
DTEND;VALUE=DATE-TIME:20200701T210000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/14
DESCRIPTION:Title: Commitment schemes and Diophantine equations\nby Felipe
Voloch (University of Canterbury) as part of Algorithmic Number Theory Sy
mposium (ANTS XIV)\n\n\nAbstract\nMotivated by questions in cryptography\,
we look for diophantine equations that are hard to solve but for which de
termining the number of solutions is easy.\n\nInvited talk\, chaired by Jo
hn Voight.\n
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;VALUE=DATE-TIME:20200702T160000Z
DTEND;VALUE=DATE-TIME:20200702T163000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/15
DESCRIPTION:Title: Faster computation of isogenies of large prime degree\n
by Daniel J. Bernstein (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 N
umber Theory Symposium (ANTS XIV)\n\n\nAbstract\nLet $E/\\F_q$ be an ellip
tic 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 defining the quotient isogeny $\\phi\\colon E \\to E'$ in $\
\tilde{O}(\\ell)$ $\\F_q$-operations\, where the $\\tilde{O}$ is uniform i
n $q$. This article shows how to compute $E'$\, and $\\phi(Q)$ for $Q$ in
$E(\\F_q)$\, using only $\\tilde{O}(\\sqrt{\\ell})$ $\\F_q$-operations\, w
here the $\\tilde{O}$ is again uniform in $q$. As an application\, we spee
d up some computations used in the isogeny-based cryptosystems CSIDH and C
SURF.\n\nChairs: Wouter Castryck and Chloe Martindale\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Bogdan Adrian Dina (Universität Ulm) and Sorina Ionica (Universit
é de Picardie)
DTSTART;VALUE=DATE-TIME:20200702T163000Z
DTEND;VALUE=DATE-TIME:20200702T170000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/16
DESCRIPTION:Title: Genus 3 hyperelliptic curves with CM via Shimura recipr
ocity\nby Bogdan Adrian Dina (Universität Ulm) and Sorina Ionica (Univers
ité de Picardie) as part of Algorithmic Number Theory Symposium (ANTS XIV
)\n\n\nAbstract\nUp to isomorphism over $C$\, every simple principally pol
arized abelian variety of dimension 3 is the Jacobian of a smooth projecti
ve curve of genus 3. Furthermore\, this curve is either a hyperelliptic cu
rve or a plane quartic. Given a sextic CM field $K$\, we show that if ther
e exists a hyperelliptic Jacobian with CM by $K$\, then all principally po
larized abelian varieties that are Galois conjugated to it are hyperellipt
ic. Using Shimura's reciprocity law\, we give an algorithm for computing a
pproximations of the invariants of the initial curve\, as well as their Ga
lois conjugates. This allows us ton define and compute class polynomials f
or genus 3 hyperelliptic curves with CM.\n\nChairs: Wouter Castryck and Ch
loe Martindale\n
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;VALUE=DATE-TIME:20200702T170000Z
DTEND;VALUE=DATE-TIME:20200702T173000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/17
DESCRIPTION:Title: A canonical form for positive definite matrices\nby Mat
hieu Dutour Sikirić (Rudjer Bosković Institute)\, Anna Haensch (Duquesne
University)\, John Voight (Dartmouth College)\, and Wessel van Woerden (C
entrum Wiskunde & Informatica) as part of Algorithmic Number Theory Sympos
ium (ANTS XIV)\n\nAbstract: TBA\n\nChairs: Wouter Castryck and Chloe Marti
ndale\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Gustavo Rama (Centro de Matemática) and Gonzalo Tornaría (Centro
de Matemática)
DTSTART;VALUE=DATE-TIME:20200702T193000Z
DTEND;VALUE=DATE-TIME:20200702T200000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/18
DESCRIPTION:Title: Computation of paramodular forms\nby Gustavo Rama (Cent
ro de Matemática) and Gonzalo Tornaría (Centro de Matemática) as part o
f Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nWe propose
an algorithm to compute paramodular forms of weight 3 as orthogonal modul
ar forms attached to positive definite quinary quadratic forms. For square
-free levels we expect that every paramodular form of weight 3 arises in t
his way.\n\nChairs: Reinier Broker and Christelle Vincent\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Edgar Costa (MIT)\, Kiran S. Kedlaya (UCSD)\, and David Roe (MIT)
DTSTART;VALUE=DATE-TIME:20200702T200000Z
DTEND;VALUE=DATE-TIME:20200702T203000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/19
DESCRIPTION:Title: Hypergeometric L-functions in average polynomial time\n
by Edgar Costa (MIT)\, Kiran S. Kedlaya (UCSD)\, and David Roe (MIT) as pa
rt of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nWe des
cribe an algorithm for computing\, for all primes $p\\le X$\, the mod-$p$
reduction of the trace of Frobenius at $p$ of a fixed hypergeometric motiv
e in time quasilinear in $X$. This combines the Beukers--Cohen--Mellit tra
ce formula with average polynomial time techniques of Harvey et al.\n\nCha
irs: Reinier Broker and Christelle Vincent\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ashish Dwivedi (IIT Kanpur) and Nitin Saxena (IIT Kanpur)
DTSTART;VALUE=DATE-TIME:20200703T140000Z
DTEND;VALUE=DATE-TIME:20200703T143000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/20
DESCRIPTION:Title: Computing Igusa's local zeta function of univariates in
deterministic polynomial-time\nby Ashish Dwivedi (IIT Kanpur) and Nitin S
axena (IIT Kanpur) as part of Algorithmic Number Theory Symposium (ANTS XI
V)\n\n\nAbstract\nIgusa's local zeta function $Z_{f\,p}(s)$ is the generat
ing function that 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 analyti
c number theory\, that $Z_{f\,p}$ is a rational function in $\\Q(s)$. We g
ive an elementary proof of this fact for univariate $f$. Our proof is cons
tructive 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 algorit
hm of (Dwivedi\, Mittal\, Saxena\, CCC\, 2019)\, yields the first determin
istic poly($|f|\, \\log p$) time algorithm to compute $Z_{f\,p}(s)$. Previ
ously\, an algorithm was known only in the case when $f$ completely splits
over $\\Q_p$\; it required the rational roots to use the concept of gener
ating function of a tree (Zúñiga-Galindo\, J.Int.Seq.\, 2003).\n\nChairs
: Marco Streng and David Kohel\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Novak Kaluderovic (EPFL)\, Thorsten Kleinjung (EPFL)\, and Dusan K
ostic (EPFL)
DTSTART;VALUE=DATE-TIME:20200703T143000Z
DTEND;VALUE=DATE-TIME:20200703T150000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/21
DESCRIPTION:Title: Cryptanalysis of the generalised Legendre pseudorandom
function\nby Novak Kaluderovic (EPFL)\, Thorsten Kleinjung (EPFL)\, and Du
san Kostic (EPFL) 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 R
ussell and Shparlinski in 2004. We present new key recovery methods that i
mprove the state of the art for both cases. For degree $r\\geq3$ we give a
n attack that runs (after precomputation) in time $O(p^{r-3})$ for the mos
t 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 E
thereum challenges\, being the first to solve the $84$-bit case.\n\nChairs
: Marco Streng and David Kohel\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Wouter Castryck (KU Leuven) and Floris Vermeulen (KU Leuven)
DTSTART;VALUE=DATE-TIME:20200703T153000Z
DTEND;VALUE=DATE-TIME:20200703T160000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/22
DESCRIPTION:Title: Lifting low-gonal curves for use in Tuitman's algorithm
\nby Wouter Castryck (KU Leuven) and Floris Vermeulen (KU Leuven) as part
of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nConsider
a smooth projective curve $\\overline{C}$ over a finite field of odd chara
cteristic\, equipped with a simply branched morphism $\\overline{C} \\to \
\PP^1$ of degree $d \\leq 4$. In this article we describe how to efficient
ly compute a lift 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 of $\\overline{C}$. The full version of this paper\, which i
s available on arXiv\, also discusses the case $d=5$ over finite fields of
characteristic $ >3$.\n\nChairs: Marco Streng and David Kohel\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Andrew Sutherland (MIT)
DTSTART;VALUE=DATE-TIME:20200703T160000Z
DTEND;VALUE=DATE-TIME:20200703T163000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/23
DESCRIPTION:Title: Counting points on superelliptic curves in average poly
nomial time\nby Andrew Sutherland (MIT) as part of Algorithmic Number Theo
ry Symposium (ANTS XIV)\n\n\nAbstract\nWe describe the practical implement
ation of an average polynomial-time algorithm for counting points on super
elliptic curves defined over $\\Q$ that is substantially faster than previ
ous 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 degre
e $d\\ge 3$\, along with a positive integer $N$. It can compute $\\#X(\\F
p)$ for all $p\\le N$ not dividing $m\\lc(f)\\disc(f)$ in time $O(md^3 N\\
log^3 N\\log\\log N)$. It achieves this by computing the trace of the Car
tier-Manin matrix of reductions of $X$. We can also compute the Cartier--
Manin matrix itself\, which determines the $p$-rank of the Jacobian of $X$
and the numerator of its zeta function modulo~$p$.\n\nChairs: Marco Stren
g and David Kohel\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Rachel Pries (Colorado State University)
DTSTART;VALUE=DATE-TIME:20200703T170000Z
DTEND;VALUE=DATE-TIME:20200703T180000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/24
DESCRIPTION:Title: Principal polarizations and Shimura data for families o
f cyclic covers of the projective line\nby Rachel Pries (Colorado State Un
iversity) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nA
bstract\nConsider a family of degree m cyclic covers of the projective lin
e\, with any number of branch points and inertia type. The Jacobians of th
e curves in this family are abelian varieties having an automorphism of or
der m with a prescribed signature. For each such family\, the signature d
etermines a PEL-type Shimura variety. Under a condition on the class numb
er of m\, we determine the Hermitian form and Shimura datum of the compone
nt of the Shimura variety containing the Torelli locus. For the proof\, w
e study the boundary of Hurwitz spaces\, investigate narrow class numbers
of real cyclotomic fields\, and build on an algorithm of Van Wamelen about
principal polarizations on abelian varieties with complex multiplication.
This is joint work with Li\, Mantovan\, and Tang.\n\nChair: Renate Schei
dler\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Thomas Espitau (NTT Secure Platform Laboratories) and Paul Kirchne
r (Université de Rennes 1)
DTSTART;VALUE=DATE-TIME:20200704T130000Z
DTEND;VALUE=DATE-TIME:20200704T133000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/25
DESCRIPTION:Title: The nearest-colattice algorithm: time-approximation tra
deoff for approx-CVP\nby Thomas Espitau (NTT Secure Platform Laboratories)
and Paul Kirchner (Université de Rennes 1) as part of Algorithmic Number
Theory Symposium (ANTS XIV)\n\n\nAbstract\nIn this paper we exhibit a hie
rarchy of polynomial time algorithms solving approximate variants of the C
losest Vector Problem (\\CVP). Our first contribution is a heuristic algor
ithm achieving the same distance as HSVP algorithms\, namely $\\approx \\b
eta^{\\frac{n}{2\\beta}}\\mathrm{covol}(\\Lambda)^{\\frac{1}{n}}$ for a ra
ndom lattice $\\Lambda$ of dimension $n$. Compared to Kannan embedding\, o
ur technique allows using precomputations. This implies that some attacks
on some lattice-based signatures lead to very cheap forgeries\, after a pr
ecomputation. Our second contribution is a \\emph{proven} reduction from a
pproximating the closest vector with a factor $\\approx n^{\\frac32}\\beta
^{\\frac{3n}{2\\beta}}$ to the Shortest Vector Problem (SVP) in dimension
$\\beta$.\n\nChairs: Claus Fieker and Elena Kirshanova\n
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;VALUE=DATE-TIME:20200704T133000Z
DTEND;VALUE=DATE-TIME:20200704T140000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/26
DESCRIPTION:Title: Simultaneous diagonalization of incomplete matrices and
applications\nby Jean-Sébastien Coron (Université du Luxembourg)\, Luca
Notarnicola (Université 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” sa
mples $W_a$ of the form $W_a = P*U_a*Q$\, where $P$ and $Q$ are unknown ma
trices of low rank. We devise practical algorithms for this problem depend
ing on the ranks of $P$ and $Q$. This problems finds its motivation in cry
ptanalysis: we show how to significantly improve previous algorithms for s
olving the approximate common divisor problem and breaking CLT13 cryptogra
phic multilinear maps.\n\nChairs: Claus Fieker and Elena Kirshanova\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Andrew Booker (University of Bristol)
DTSTART;VALUE=DATE-TIME:20200704T150000Z
DTEND;VALUE=DATE-TIME:20200704T160000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/27
DESCRIPTION:Title: 33 and all that\nby Andrew Booker (University of Bristo
l) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract
\nI will speak about sums of three cubes\, while trying to convey the surr
eal\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\nInvited talk\, chaired by Emmanuel Thomé.\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Carl Bootland (KU Leuven)\, Wouter Castryck (KU Leuven)\, and Fred
erik Vercauteren (KU Leuven)
DTSTART;VALUE=DATE-TIME:20200704T163000Z
DTEND;VALUE=DATE-TIME:20200704T170000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
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 Theo
ry Symposium (ANTS XIV)\n\n\nAbstract\nThe Multivariate Ring Learning with
Errors ($m$-RLWE) problem was introduced in 2015 by Pedrouzo-Ulloa\, Tron
coso-Pastoriza and Pérez-González. Instead of working over a polynomial
residue ring with one variable as in RLWE\, it works over a polynomial res
idue ring in several variables. However\, care must be taken when choosing
the multivariate rings for use in cryptographic applications as they can
be either weak or simply equivalent to univariate RLWE. For example\, Pedr
ouzo-Ulloa et al.\\ suggest using tensor products of cyclotomic rings\, in
particular power-of-two cyclotomic rings. They claim incorrectly that the
security increases with the product of the individual degrees. In this pa
per\, we present simple methods to solve the search $m$-RLWE problem far m
ore efficiently than is stated in the current literature by reducing the p
roblem to the RLWE problem in dimension equal to the maximal degree of its
components (and not the product) and where the noise increases with the s
quare-root of the degree of the other components. Our methods utilise the
fact that the defining cyclotomic polynomials share algebraically related
roots. We use these methods to successfully attack the search variant of t
he $m$-RLWE problem for a set of parameters estimated to offer more than 2
600 bits of security\, and being equivalent to solving the bounded distanc
e decoding problem in a highly structured lattice of dimension 16384\, in
less than two weeks of computation time or just a few hours if parallelize
d on 128 cores.\n\nChair: Divesh Aggarwal and Emmanuel Thomé\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Daniel E. Martin (University of Colorado)
DTSTART;VALUE=DATE-TIME:20200704T170000Z
DTEND;VALUE=DATE-TIME:20200704T173000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/29
DESCRIPTION:Title: Short vector problems and simultaneous approximation\nb
y Daniel E. Martin (University of Colorado) as part of Algorithmic Number
Theory Symposium (ANTS XIV)\n\n\nAbstract\nIn 1982\, Lagarias showed that
solving the approximate Shortest Vector Problem also solves the problem of
finding simultaneous Diophantine approximations. Here we provide the reve
rse reduction with polynomial complexity. It is gap-preserving provided a
consistent norm is used to measure approximation quality in both problems.
We also give an alternative to the Lagarias algorithm by first reducing h
is version of simultaneous approximation to one with no explicit range in
which a solution is sought.\n\nChair: Divesh Aggarwal and Emmanuel Thomé\
n
END:VEVENT
BEGIN:VEVENT
SUMMARY:David Jao (University of Waterloo)
DTSTART;VALUE=DATE-TIME:20200702T180000Z
DTEND;VALUE=DATE-TIME:20200702T190000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/30
DESCRIPTION:Title: Isogeny-based cryptography: past\, present\, and future
\nby David Jao (University of Waterloo) as part of Algorithmic Number Theo
ry Symposium (ANTS XIV)\n\n\nAbstract\nIsogeny-based cryptography is becom
ing an increasingly well-established subject within the post-quantum crypt
ography landscape\, but widespread understanding remains elusive due to th
e technical and specialized nature of the topic. In this talk we present a
clear comparison of modern-day isogeny-based cryptosystems\, explain the
known relationships between the various security assumptions used in isoge
ny-based cryptography today\, and give algorithmic details of the known at
tacks against these assumptions. We also provide our thoughts regarding wh
at kinds of isogeny-based cryptosystems and security assumptions may emerg
e in the future.\n\nInvited talk\, chaired by Chloe Martindale.\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Mingjie Chen (UCSD)\, Kiran Kedlaya (UCSD)\, and Jun Bo Lau (UCSD)
DTSTART;VALUE=DATE-TIME:20200630T211000Z
DTEND;VALUE=DATE-TIME:20200630T212000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
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 Algorithm
ic Number Theory Symposium (ANTS XIV)\n\nAbstract: TBA\n\nThis is a live p
oster presentation. Click the "paper" link to view the poster.\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Eric Bach (University of Wisconsin\, Madison) and Jonathan Sorenso
n (Butler University)
DTSTART;VALUE=DATE-TIME:20200630T212000Z
DTEND;VALUE=DATE-TIME:20200630T213000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/32
DESCRIPTION:Title: Generating smooth numbers with known factorization unif
ormly at random\nby Eric Bach (University of Wisconsin\, Madison) and Jona
than Sorenson (Butler University) as part of Algorithmic Number Theory Sym
posium (ANTS XIV)\n\nAbstract: TBA\n\nThis is a live poster presentation.
Click the "paper" link to view the poster.\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Samuel Dobson (University of Auckland)\, Steven D. Galbraith (Univ
ersity of Auckland)\, and Benjamin Smith (LIX - École polytechnique)
DTSTART;VALUE=DATE-TIME:20200630T213000Z
DTEND;VALUE=DATE-TIME:20200630T214000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/33
DESCRIPTION:Title: Trustless construction of groups of unknown order with
hyperelliptic curves [poster]\nby Samuel Dobson (University of Auckland)\,
Steven D. Galbraith (University of Auckland)\, and Benjamin Smith (LIX -
École polytechnique) as part of Algorithmic Number Theory Symposium (ANTS
XIV)\n\nAbstract: TBA\n\nThis is a live poster presentation. Click the "
paper" link to view the poster.\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Semyon Novoselov (Immanuel Kant Baltic Federal University)
DTSTART;VALUE=DATE-TIME:20200704T142500Z
DTEND;VALUE=DATE-TIME:20200704T143500Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/34
DESCRIPTION:Title: Counting points on hyperelliptic curves with geometrica
lly split Jacobians\nby Semyon Novoselov (Immanuel Kant Baltic Federal Uni
versity) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\nAbst
ract: TBA\n\nThis is a poster presentation. Click the "paper" link to vie
w the poster.\n\nPoster session chair is Benjamin Smith.\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jared Asuncio (Universite de Bordeaux / Universiteit Leiden)
DTSTART;VALUE=DATE-TIME:20200704T143500Z
DTEND;VALUE=DATE-TIME:20200704T144500Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/35
DESCRIPTION:Title: Computing the Hilbert class field of primitive quartic
CM fields\nby Jared Asuncio (Universite de Bordeaux / Universiteit Leiden)
as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\nAbstract: TB
A\n\nThis is a live poster presentation. Click the "paper" link to view t
he poster.\n\nPoster session chair is Benjamin Smith.\n
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;VALUE=DATE-TIME:20200704T144500Z
DTEND;VALUE=DATE-TIME:20200704T155500Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/36
DESCRIPTION:Title: On adaptive attacks against Jao-Urbanik's isogeny-based
protocol\nby Andrea Basso (University of Birmingham)\, Péter Kutas (Univ
ersity of Birmingham)\, Simon-Philipp Merz (Royal Holloway\, University of
London)\, Christophe Petit (University of Birmingham)\, and Charlotte Wei
tkämper (University of Birmingham) as part of Algorithmic Number Theory S
ymposium (ANTS XIV)\n\nAbstract: TBA\n\nThis is a poster presentation. Cl
ick the "paper" link to view the poster.\n\nPoster session chair is Benjam
in Smith.\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Edgar Costa and Kiran Kedlaya
DTSTART;VALUE=DATE-TIME:20200629T223000Z
DTEND;VALUE=DATE-TIME:20200629T225000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/37
DESCRIPTION:Title: Coffee break: general\nby Edgar Costa and Kiran Kedlaya
as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\n
During the social breaks the main Zoom session will be available for those
who want to talk math with the speakers\, but for those looking for somet
hing 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
END:VEVENT
BEGIN:VEVENT
SUMMARY:Alexandre Wallet
DTSTART;VALUE=DATE-TIME:20200629T223000Z
DTEND;VALUE=DATE-TIME:20200629T225000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/38
DESCRIPTION:Title: Coffee break: the students room\nby Alexandre Wallet as
part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nCou
ld not attend the Summer School and want another chance? Afraid of princip
ally polarized abelian varieties? Missing pictionary contests? ANTS Studen
ts Only Room warmly welcomes you! Click on the link below for a late night
chat\, an early morning coffee\, or an afternoon snack. Maths discussions
are welcome too\, of course!\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Luca de Feo\, Christelle Vincent\, McKenzie West\, and David Roe
DTSTART;VALUE=DATE-TIME:20200629T223000Z
DTEND;VALUE=DATE-TIME:20200629T225000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/39
DESCRIPTION:Title: Coffee break: NT software lullaby\nby Luca de Feo\, Chr
istelle Vincent\, McKenzie West\, and David Roe as part of Algorithmic Num
ber Theory Symposium (ANTS XIV)\n\n\nAbstract\nWas it print "stuff" or pri
nt("stuff")? Parent(x) or x.parent()? Colon or not? Emacs or vi? Ask the s
oftware experts anything in this session on number theoretic software\, ju
st before everyone in Europe goes to bed!\n\nWe will be hearing from Chris
telle Vincent (UVM) and Mckenzie West (UW-EC) on Sagemath and LMFDB. More
famous 10× coders to be announced soon!\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Edgar Costa and Kiran Kedlaya
DTSTART;VALUE=DATE-TIME:20200630T012000Z
DTEND;VALUE=DATE-TIME:20200630T014000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/40
DESCRIPTION:Title: Coffee break: general\nby Edgar Costa and Kiran Kedlaya
as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\n
During the social breaks the main Zoom session will be available for those
who want to talk math with the speakers\, but for those looking for somet
hing 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
END:VEVENT
BEGIN:VEVENT
SUMMARY:Alexandre Wallet
DTSTART;VALUE=DATE-TIME:20200630T012000Z
DTEND;VALUE=DATE-TIME:20200630T014000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/41
DESCRIPTION:Title: Coffee break: the students room\nby Alexandre Wallet as
part of Algorithmic Number Theory Symposium (ANTS XIV)\n\nAbstract: TBA\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Steven Galbraith (University of Auckland)
DTSTART;VALUE=DATE-TIME:20200701T193000Z
DTEND;VALUE=DATE-TIME:20200701T195000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/42
DESCRIPTION:Title: Coffee break: ask me anything\nby Steven Galbraith (Uni
versity of Auckland) as part of Algorithmic Number Theory Symposium (ANTS
XIV)\n\n\nAbstract\nI'm happy to answer questions about running ANTS onlin
e\, the weather in Auckland\, isogenies\, the academic job market\, being
department chair\, tips for writing papers\, having a famous wife\, how to
avoid burnout\, etc etc.\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Felipe Voloch (University of Canterbury)
DTSTART;VALUE=DATE-TIME:20200630T193000Z
DTEND;VALUE=DATE-TIME:20200630T195000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/43
DESCRIPTION:Title: Coffee break\nby Felipe Voloch (University of Canterbur
y) as part of Algorithmic 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 discus
sions related to that talk.\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Katherine Stange (University of Colorado\, Boulder) and Renate Sch
eidler (University of Calgary)
DTSTART;VALUE=DATE-TIME:20200630T180000Z
DTEND;VALUE=DATE-TIME:20200630T182000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/44
DESCRIPTION:Title: Coffee break: Women in numbers\nby Katherine Stange (Un
iversity of Colorado\, Boulder) and Renate Scheidler (University of Calgar
y) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract
\nThe Women in Numbers (WIN) network (womeninnumbertheory.org) aims to sup
port the research of female number theorists. WIN hosts research collabora
tion conferences and other events\, publishes proceedings\, and maintains
online resources 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 Tuesd
ay\, June 30\, at 18:00 UTC. Join us to find out more about WIN\, meet oth
er number theorists or connect with old friends. This brief event will beg
in with a very quick welcome and "what is...?" about WIN\, and then partic
ipants will have the opportunity to mingle.\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Brendan Creutz and Felipe Voloch
DTSTART;VALUE=DATE-TIME:20200701T213000Z
DTEND;VALUE=DATE-TIME:20200701T220000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/45
DESCRIPTION:Title: Rump session\nby Brendan Creutz and Felipe Voloch as pa
rt of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\n\n
- Everett Howe -- The forbidden isogeny\, 5 min
\n- Koen de Boer -- Winners of
the meme <
a href="https://math.mit.edu/~drew/ANTSXIV/RumpMeme2.jpg">competition
of the ANTS summer school\, 2 min
\n- Andrew Shallue -- Haskell vs C++\, a ridicu
lously low-effort timing comparison\, 6 min
\n- Enric Florit\, B
en Smith -- Ra
ndom walks in genus 2 isogeny graphs\, 6 min
\n- Christophe Peti
t -- Isogeny-ba
sed cryptography winter summer school in Bristol\, 14th-18th December
2020\, 3 min
\n- Andrew Sutherland -- ANTS XVI (that is not a typo) 3 min<
/li>\n
- Péter Kutas -- Hidden shift quantum attack on unbalanced SIDH\, 2 min
\n- Antonin Leroux -- Light post-quantum signatures from quaternions and isogenies
\, 5 min
\n- Laurent Grémy -- Number Theory Zoo\, 4 min
\n- Wouter Castr
yck -- Radic
al isogenies\, 4 min
\n

\n\nAs has been the case at prior ANTS
conferences\, there will again be a Rump Session. This session is an oppo
rtunity for brief announcements (such as: progress reports\, news about re
cent results\, advertisements for conferences of interest\, etc) or comedy
items. Talks should be short and entertaining.\n\nThe Rump Session for AN
TS XIV will take place Wednesday\, July 1 starting at 21:30 PM UTC. Please
register your interest in presenting\, by Tuesday\, June 30th 21:30 PM UT
C\, at this link:\n\ndocs.google.com/forms/d/e/1FAIpQLSe9vsI9zucVl39rWMMSU
BKho1E1wugjTfap5wlcYKRGdLfEMA/viewform\n\nShort announcements\, such as co
nference announcements\, can be up to 2 minutes in length. Longer announce
ments (e.g.\, of new results) can be up to 6 minutes in length. Please sta
te the length of time you will need in your submission. The Rump Session c
hairs decide which presentations are accepted. Their decision is final and
there is no appeals process.\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Kiran Kedlaya (UCSD) and Renate Scheidler (University of Calgary)
DTSTART;VALUE=DATE-TIME:20200703T181000Z
DTEND;VALUE=DATE-TIME:20200703T190000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/46
DESCRIPTION:Title: Selfridge prize\, followed by business meeting\nby Kira
n Kedlaya (UCSD) and Renate Scheidler (University of Calgary) as part of A
lgorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nThe business
meeting will take place Friday\, July 3 at 18:10 UTC. Here is the meeting
agenda:\n\n\n- Announcement of the Selfridge Prize
\n- Acknowl
edgements
\n- The ANTS Steering Committee (chair: Renate Scheidler\;
vice chair: Kiran Kedlaya)
\n- The ANTS permanent web site (antsmath.org)
\n- Report on ANTS XIV
submissions\, registrations\, proceedings< (Steven Galbraith)
\nBids for ANTS XV\n\n- Bristol (Jonathan Boober\, Andy Booker\
, Chloe Martindale)
\n- Netherlands (Tanja Lange\, Marco Streng\, Ja
apTop)
\n- Poll: participation in ANTS XV
\n- Poll: location p
reference
\n

\n- ANTS XVI and beyond\, expressions of interest?<
/li>\n
\n- MIT (Jennifer Balakrishnan\, Andrew Sutherland\, John Voig
ht)\n

\n - The Number Theory Foundation (Andrew Sutherland)
\n- Publication of the ANTS proceedings
\n\n- A possible alternativ
e: Research in Number Theory (Andrew Sutherland)
\n- Poll: double-bl
ind refereeing
\n- Poll: open-access publication charges
\n- P
oll: publication venue for ANTS XV
\n

\n

\nFor questions\, ple
ase ask in this thread or email one of:\n\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Steven Galbraith and Christophe Petit
DTSTART;VALUE=DATE-TIME:20200629T223000Z
DTEND;VALUE=DATE-TIME:20200629T225000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/47
DESCRIPTION:Title: Continuing discussions with session 1 speakers\nby Stev
en Galbraith and Christophe Petit as part of Algorithmic Number Theory Sym
posium (ANTS XIV)\n\nAbstract: TBA\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Brendan Creutz and Felipe Voloch
DTSTART;VALUE=DATE-TIME:20200630T012000Z
DTEND;VALUE=DATE-TIME:20200630T014000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/48
DESCRIPTION:Title: Continuing discussions with session 2 speakers\nby Bren
dan Creutz and Felipe Voloch as part of Algorithmic Number Theory Symposiu
m (ANTS XIV)\n\nAbstract: TBA\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Steven Galbraith
DTSTART;VALUE=DATE-TIME:20200630T014500Z
DTEND;VALUE=DATE-TIME:20200630T020000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/49
DESCRIPTION:Title: Wrap up: feedback and suggestions\nby Steven Galbraith
as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\nAbstract: TBA
\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tom Fisher and Jen Paulhus
DTSTART;VALUE=DATE-TIME:20200630T180000Z
DTEND;VALUE=DATE-TIME:20200630T182000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/50
DESCRIPTION:Title: Continuing discussions with session 3 speakers\nby Tom
Fisher and Jen Paulhus as part of Algorithmic Number Theory Symposium (ANT
S XIV)\n\nAbstract: TBA\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tom Fisher and Jen Paulhus
DTSTART;VALUE=DATE-TIME:20200630T193000Z
DTEND;VALUE=DATE-TIME:20200630T195000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/51
DESCRIPTION:Title: Continuing discussions with session 4 speakers\nby Tom
Fisher and Jen Paulhus as part of Algorithmic Number Theory Symposium (ANT
S XIV)\n\nAbstract: TBA\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Alina Ostafe and Katherine Stange
DTSTART;VALUE=DATE-TIME:20200701T193000Z
DTEND;VALUE=DATE-TIME:20200701T195000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/52
DESCRIPTION:Title: Continuing discussions with session 5 speakers\nby Alin
a Ostafe and Katherine Stange as part of Algorithmic Number Theory Symposi
um (ANTS XIV)\n\nAbstract: TBA\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:John Voight
DTSTART;VALUE=DATE-TIME:20200701T210000Z
DTEND;VALUE=DATE-TIME:20200701T212000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/53
DESCRIPTION:Title: Continuing discussions with session 5 speakers\nby John
Voight as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\nAbstr
act: TBA\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Michael Naehrig and Joppe Bos
DTSTART;VALUE=DATE-TIME:20200701T212000Z
DTEND;VALUE=DATE-TIME:20200701T213000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/54
DESCRIPTION:Title: Remembering Peter Montgomery\nby Michael Naehrig and Jo
ppe Bos as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\nAbstr
act: TBA\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Wouter Castryck and Chloe Martindale
DTSTART;VALUE=DATE-TIME:20200702T173000Z
DTEND;VALUE=DATE-TIME:20200702T175000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/55
DESCRIPTION:Title: Continuing discussions with session 6 speakers\nby Wout
er Castryck and Chloe Martindale as part of Algorithmic Number Theory Symp
osium (ANTS XIV)\n\nAbstract: TBA\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Reinier Broker and Christelle Vincent
DTSTART;VALUE=DATE-TIME:20200702T203000Z
DTEND;VALUE=DATE-TIME:20200702T210000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/56
DESCRIPTION:Title: Continuing discussions with session 7 speakers\nby Rein
ier Broker and Christelle Vincent as part of Algorithmic Number Theory Sym
posium (ANTS XIV)\n\nAbstract: TBA\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:David Kohel and Marco Streng
DTSTART;VALUE=DATE-TIME:20200703T163000Z
DTEND;VALUE=DATE-TIME:20200703T165000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/57
DESCRIPTION:Title: Continuing discussions with session 8 speakers\nby Davi
d Kohel and Marco Streng as part of Algorithmic Number Theory Symposium (A
NTS XIV)\n\nAbstract: TBA\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Claus Fieker and Elena Kirshanova
DTSTART;VALUE=DATE-TIME:20200704T140000Z
DTEND;VALUE=DATE-TIME:20200704T142000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/58
DESCRIPTION:Title: Continuing discussions with session 9 speakers\nby Clau
s Fieker and Elena Kirshanova as part of Algorithmic Number Theory Symposi
um (ANTS XIV)\n\nAbstract: TBA\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Divesh Aggarwal and Emmanuel Thomé
DTSTART;VALUE=DATE-TIME:20200704T173000Z
DTEND;VALUE=DATE-TIME:20200704T180000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/59
DESCRIPTION:Title: Continuing discussion with session 10 speakers and clos
ing\nby Divesh Aggarwal and Emmanuel Thomé as part of Algorithmic Number
Theory Symposium (ANTS XIV)\n\nAbstract: TBA\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yinan Zhang
DTSTART;VALUE=DATE-TIME:20200630T214000Z
DTEND;VALUE=DATE-TIME:20200630T220000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/60
DESCRIPTION:Title: Coffee break: general\nby Yinan Zhang as part of Algori
thmic Number Theory Symposium (ANTS XIV)\n\nAbstract: TBA\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Luca De Feo\, David Roe\, and Mckenzie West
DTSTART;VALUE=DATE-TIME:20200701T193000Z
DTEND;VALUE=DATE-TIME:20200701T195000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/61
DESCRIPTION:Title: Coffee: Computational software for number theory\nby Lu
ca De Feo\, David Roe\, and Mckenzie West as part of Algorithmic Number Th
eory Symposium (ANTS XIV)\n\nAbstract: TBA\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Nils Bruin
DTSTART;VALUE=DATE-TIME:20200702T190000Z
DTEND;VALUE=DATE-TIME:20200702T192000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/62
DESCRIPTION:Title: Coffee break: computational arithmetic geometry\nby Nil
s Bruin as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\nAbstr
act: TBA\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Chloe Martindale (University of Bristol)
DTSTART;VALUE=DATE-TIME:20200702T203000Z
DTEND;VALUE=DATE-TIME:20200702T210000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/63
DESCRIPTION:Title: Coffee break: Cards against cryptography\nby Chloe Mart
indale (University of Bristol) as part of Algorithmic Number Theory Sympos
ium (ANTS XIV)\n\n\nAbstract\nCards Against Cryptography is a party game f
or nerdy cryptographers. Shamelessly based on Cards Against Humanity.\n\nW
e'll play using https://md.rereadgame
s.com in small groups (using Zoom breakout rooms). See you there!\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Kiran Kedlaya
DTSTART;VALUE=DATE-TIME:20200701T210000Z
DTEND;VALUE=DATE-TIME:20200701T212000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
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 me
an anything: number theory\, algebraic geometry\, pp-adic anything\, algor
ithms\, Sage\, teaching with Jupyter\, being a journal editor\, California
\, math contests\, game shows\, social justice\, Web sites\, or anything e
lse I didn't think of. ANTS newcomers especially welcome!\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Luca De Feo\, Dan Gordon\, Victor Miller\, and Michael Naehrig
DTSTART;VALUE=DATE-TIME:20200703T150000Z
DTEND;VALUE=DATE-TIME:20200703T152000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/65
DESCRIPTION:Title: Coffee break: there's a life outside of academia!\nby L
uca De Feo\, Dan Gordon\, Victor Miller\, and Michael Naehrig as part of A
lgorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nJoin us for c
orporate sponsored coffee from our $10k Nespresso machine and have a chat
about non-academic careers!\n\nCan I have a ping-pong table in my office?
How did you survive 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- Luca De F
eo\, IBM Research Zürich
\n- Dan Gordon\, IDA Center for Communic
ations Research - La Jolla
\n- Victor Miller\, IDA Center for Comm
unications Research - Princeton
\n- Michael Naehrig\, Microsoft Re
search - Seattle
\n

\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Andrew Shallue (Illinois Wesleyan University)
DTSTART;VALUE=DATE-TIME:20200702T190000Z
DTEND;VALUE=DATE-TIME:20200702T192000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/67
DESCRIPTION:Title: Coffee break: small universities\nby Andrew Shallue (I
llinois Wesleyan University) as part of Algorithmic Number Theory Symposiu
m (ANTS XIV)\n\n\nAbstract\nI'll be hosting a social event on Thursday\, U
TC 1900 - 1920 (just after the invited talk). I have recently shifted from
being a math professor to being a computer science professor (still at Il
linois Wesleyan University). Come share your story or ask questions about
life at small universities\, or find out what that shift has entailed.\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Enric Florit and Annamaria Iezzi
DTSTART;VALUE=DATE-TIME:20200703T163000Z
DTEND;VALUE=DATE-TIME:20200703T165000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/68
DESCRIPTION:Title: Coffee break: Meet the baby ants\nby Enric Florit and A
nnamaria Iezzi as part of Algorithmic Number Theory Symposium (ANTS XIV)\n
\n\nAbstract\nIf you are a student\, a postdoc\, an early-career researche
r or if you just want to hang out with the youngest part of the ANTS commu
nity\, this coffee/tea/juice/beer/wine break is for you! Just zoom in for
chatting and talking with the baby ants!\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:David Roe (MIT)
DTSTART;VALUE=DATE-TIME:20200703T163000Z
DTEND;VALUE=DATE-TIME:20200703T165000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/69
DESCRIPTION:Title: Puppy break\nby David Roe (MIT) as part of Algorithmic
Number Theory Symposium (ANTS XIV)\n\n\nAbstract\nFor once\, our furry fri
ends can accompany us to a conference! Come hang out and bring your puppi
es (or puppies-at-heart). All dog lovers welcome\, regardless of whether
you have a puppy to contribute (I'll be hanging out with my 3-month old go
lden retriever Merlin).\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Kiran Kedlaya (UCSD)
DTSTART;VALUE=DATE-TIME:20200703T190000Z
DTEND;VALUE=DATE-TIME:20200703T203000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/70
DESCRIPTION:Title: Coffee break: Social justice free-for-all\nby Kiran Ked
laya (UCSD) as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\
nAbstract\nWe may not save the world today\, but let's have some fun tryin
g! Come help me brainstorm ways for our community to seize the present mom
ent to advance meaningful social change. Diverse perspectives needed!\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Joshua Holden
DTSTART;VALUE=DATE-TIME:20200703T150000Z
DTEND;VALUE=DATE-TIME:20200703T152000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/71
DESCRIPTION:Title: Coffee break: Cryptography and number theory research
for undergraduates\nby Joshua Holden as part of Algorithmic Number Theory
Symposium (ANTS XIV)\n\n\nAbstract\nJoin us for a discussion of doing cryp
tography/number theory research with undergraduate students. We can discus
s suitable projects (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
END:VEVENT
BEGIN:VEVENT
SUMMARY:David Kohel and Marco Streng
DTSTART;VALUE=DATE-TIME:20200703T150000Z
DTEND;VALUE=DATE-TIME:20200703T152000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/72
DESCRIPTION:Title: Continuing discussion with session 8 speakers\nby David
Kohel and Marco Streng as part of Algorithmic Number Theory Symposium (AN
TS XIV)\n\nAbstract: TBA\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Luca De Feo
DTSTART;VALUE=DATE-TIME:20200704T140000Z
DTEND;VALUE=DATE-TIME:20200704T142000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/73
DESCRIPTION:Title: Coffee break: isogeny-based cost action\nby Luca De Feo
as part of Algorithmic Number Theory Symposium (ANTS XIV)\n\n\nAbstract\n
Many very cool ANTS attendees\, including Chloe Martindale\, Benjamin Smit
h and myself\, are planning to apply for an EU COST action around isogeny-based cryptography. This a network gran
t\, so the main goal would be to better connect the isogeny community in t
he participating countries by way of workshops and collaborations througho
ut the year.\n\nJoin us for coffee and ask your questions on how COST acti
ons work\, on what our plan is\, and more.\n
END:VEVENT
BEGIN:VEVENT
SUMMARY:Claus Fieker and Emmanuel Thomé
DTSTART;VALUE=DATE-TIME:20200704T160000Z
DTEND;VALUE=DATE-TIME:20200704T170000Z
DTSTAMP;VALUE=DATE-TIME:20200705T042337Z
UID:ANTS14/74
DESCRIPTION:Title: Continuing discussion with the invited speaker\nby Clau
s Fieker and Emmanuel Thomé as part of Algorithmic Number Theory Symposiu
m (ANTS XIV)\n\nAbstract: TBA\n
END:VEVENT
END:VCALENDAR