BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Luca De Feo (IBM Research Zürich)
DTSTART:20200429T140000Z
DTEND:20200429T150000Z
DTSTAMP:20260422T225637Z
UID:CodingCrypto/1
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CodingCrypto
 /1/">Faster Evaluation of Isogenies of Large Prime Degree</a>\nby Luca De 
 Feo (IBM Research Zürich) as part of eSeminar in Coding Theory and Crypto
 graphy\n\n\nAbstract\nAn isogeny is a non-zero morphism of elliptic curves
 . The isogeny evaluation problem asks\, given a description of an isogeny 
 φ:E→E' and of a point P∈E\, to compute φ(P). It is a fundamental alg
 orithmic problem in computational number theory\, and has gained a fair am
 ount interest thanks to the recent developments in isogeny-based cryptogra
 phy.\nThe "atomic" case for isogeny evaluation is that of isogenies of pri
 me degree\, on top of which algorithms for isogenies of any degree are eas
 ily constructed. For the prime degree case\, the classic solution is based
  on Vélu's formulas\, or any of their optimized variants. Vélu's formula
 s take as input the kernel of the isogeny\, e.g.\, as a list of points\, a
 nd output the isogeny as a pair of rational functions\, which are then use
 d to evaluate the isogeny at the point. This algorithm can be implemented 
 in time linear in the isogeny degree\, which is asymptotically optimal in 
 general\; however in the fundamental case where the kernel can be describe
 d by a single generator over the base field\, one could hope to find a mor
 e efficient algorithm which sidesteps the computation of the rational func
 tions.\nThis is exactly what I will present in this talk: starting from a 
 very simple idea\, already used by Pollard\, Strassen and Chudnovsky²\, a
 mong others\, I will present a baby-step/giant-step algorithm that solves 
 the isogeny evaluation problem in time and space proportional to the squar
 e root of the degree. I will explain why this is important for isogeny-bas
 ed cryptography\, and highlight several applications where the new algorit
 hm produces practical speedups ranging from the unimpressive to the specta
 cular.\nThis is joint work with D.J. Bernstein\, A. Leroux and B. Smith\, 
 the preprint can be found at https://ia.cr/2020/341. ** The talk will be l
 ive streamed at https://defeo.lu/tube/ **\n
LOCATION:https://researchseminars.org/talk/CodingCrypto/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Buket Özkaya (Nanyang Technological University)
DTSTART:20200506T070000Z
DTEND:20200506T080000Z
DTSTAMP:20260422T225637Z
UID:CodingCrypto/2
DESCRIPTION:by Buket Özkaya (Nanyang Technological University) as part of
  eSeminar in Coding Theory and Cryptography\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/CodingCrypto/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Madhu Sudan (Harvard University)
DTSTART:20200506T130000Z
DTEND:20200506T140000Z
DTSTAMP:20260422T225637Z
UID:CodingCrypto/3
DESCRIPTION:by Madhu Sudan (Harvard University) as part of eSeminar in Cod
 ing Theory and Cryptography\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/CodingCrypto/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Kristin Lauter (Microsoft Research)
DTSTART:20200513T180000Z
DTEND:20200513T190000Z
DTSTAMP:20260422T225637Z
UID:CodingCrypto/4
DESCRIPTION:by Kristin Lauter (Microsoft Research) as part of eSeminar in 
 Coding Theory and Cryptography\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/CodingCrypto/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Gretchen Matthews (Virginia Tech)
DTSTART:20200527T130000Z
DTEND:20200527T140000Z
DTSTAMP:20260422T225637Z
UID:CodingCrypto/5
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CodingCrypto
 /5/">Coding for local recovery</a>\nby Gretchen Matthews (Virginia Tech) a
 s part of eSeminar in Coding Theory and Cryptography\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/CodingCrypto/5/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Daniel Cabarcas Jaramillo (Universidad Nacional de Colombia)
DTSTART:20200603T140000Z
DTEND:20200603T150000Z
DTSTAMP:20260422T225637Z
UID:CodingCrypto/6
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CodingCrypto
 /6/">From Minrank Attack to generic Bilinear</a>\nby Daniel Cabarcas Jaram
 illo (Universidad Nacional de Colombia) as part of eSeminar in Coding Theo
 ry and Cryptography\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/CodingCrypto/6/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Antonia Wachter-Zeh (TU Munich)
DTSTART:20200617T130000Z
DTEND:20200617T140000Z
DTSTAMP:20260422T225637Z
UID:CodingCrypto/7
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CodingCrypto
 /7/">Analytic and probabilistic combinatorics for polynomials over finite 
 fields</a>\nby Antonia Wachter-Zeh (TU Munich) as part of eSeminar in Codi
 ng Theory and Cryptography\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/CodingCrypto/7/
END:VEVENT
END:VCALENDAR