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:20260404T110645Z
UID:CodingCrypto/1
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Codin
 gCrypto/1/">Faster Evaluation of Isogenies of Large Prime Degree</a>\nby L
 uca De Feo (IBM Research Zürich) as part of eSeminar in Coding Theory and
  Cryptography\n\n\nAbstract\nAn isogeny is a non-zero morphism of elliptic
  curves. The isogeny evaluation problem asks\, given a description of an i
 sogeny φ:E→E' and of a point P∈E\, to compute φ(P). It is a fundamen
 tal algorithmic problem in computational number theory\, and has gained a 
 fair amount interest thanks to the recent developments in isogeny-based cr
 yptography.\nThe "atomic" case for isogeny evaluation is that of isogenies
  of prime degree\, on top of which algorithms for isogenies of any degree 
 are easily constructed. For the prime degree case\, the classic solution i
 s based on Vélu's formulas\, or any of their optimized variants. Vélu's 
 formulas take as input the kernel of the isogeny\, e.g.\, as a list of poi
 nts\, and output the isogeny as a pair of rational functions\, which are t
 hen used to evaluate the isogeny at the point. This algorithm can be imple
 mented in time linear in the isogeny degree\, which is asymptotically opti
 mal in general\; however in the fundamental case where the kernel can be d
 escribed by a single generator over the base field\, one could hope to fin
 d a more efficient algorithm which sidesteps the computation of the ration
 al functions.\nThis is exactly what I will present in this talk: starting 
 from a very simple idea\, already used by Pollard\, Strassen and Chudnovsk
 y²\, among others\, I will present a baby-step/giant-step algorithm that 
 solves the isogeny evaluation problem in time and space proportional to th
 e square root of the degree. I will explain why this is important for isog
 eny-based cryptography\, and highlight several applications where the new 
 algorithm produces practical speedups ranging from the unimpressive to the
  spectacular.\nThis is joint work with D.J. Bernstein\, A. Leroux and B. S
 mith\, the preprint can be found at https://ia.cr/2020/341. ** The talk wi
 ll be live streamed at https://defeo.lu/tube/ **\n
LOCATION:https://stable.researchseminars.org/talk/CodingCrypto/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Buket Özkaya (Nanyang Technological University)
DTSTART:20200506T070000Z
DTEND:20200506T080000Z
DTSTAMP:20260404T110645Z
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://stable.researchseminars.org/talk/CodingCrypto/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Madhu Sudan (Harvard University)
DTSTART:20200506T130000Z
DTEND:20200506T140000Z
DTSTAMP:20260404T110645Z
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://stable.researchseminars.org/talk/CodingCrypto/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Kristin Lauter (Microsoft Research)
DTSTART:20200513T180000Z
DTEND:20200513T190000Z
DTSTAMP:20260404T110645Z
UID:CodingCrypto/4
DESCRIPTION:by Kristin Lauter (Microsoft Research) as part of eSeminar in 
 Coding Theory and Cryptography\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/CodingCrypto/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Gretchen Matthews (Virginia Tech)
DTSTART:20200527T130000Z
DTEND:20200527T140000Z
DTSTAMP:20260404T110645Z
UID:CodingCrypto/5
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Codin
 gCrypto/5/">Coding for local recovery</a>\nby Gretchen Matthews (Virginia 
 Tech) as part of eSeminar in Coding Theory and Cryptography\n\nAbstract: T
 BA\n
LOCATION:https://stable.researchseminars.org/talk/CodingCrypto/5/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Daniel Cabarcas Jaramillo (Universidad Nacional de Colombia)
DTSTART:20200603T140000Z
DTEND:20200603T150000Z
DTSTAMP:20260404T110645Z
UID:CodingCrypto/6
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Codin
 gCrypto/6/">From Minrank Attack to generic Bilinear</a>\nby Daniel Cabarca
 s Jaramillo (Universidad Nacional de Colombia) as part of eSeminar in Codi
 ng Theory and Cryptography\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/CodingCrypto/6/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Antonia Wachter-Zeh (TU Munich)
DTSTART:20200617T130000Z
DTEND:20200617T140000Z
DTSTAMP:20260404T110645Z
UID:CodingCrypto/7
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Codin
 gCrypto/7/">Analytic and probabilistic combinatorics for polynomials over 
 finite fields</a>\nby Antonia Wachter-Zeh (TU Munich) as part of eSeminar 
 in Coding Theory and Cryptography\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/CodingCrypto/7/
END:VEVENT
END:VCALENDAR