BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Chik How Tan (National University of Singapore)
DTSTART:20201007T070000Z
DTEND:20201007T074000Z
DTSTAMP:20260422T225757Z
UID:Cryptography/1
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/Cryptography
 /1/">Rank Metric Code-based Cryptography</a>\nby Chik How Tan (National Un
 iversity of Singapore) as part of Recent Developments in Cryptography (CRY
 PTO)\n\n\nAbstract\nRank metric code-based cryptography is one of active p
 ost-quantum cryptography.  In this talk\, we present various techniques on
  rank metric code-based encryption and signature.  The vulnerability and a
 ttacks of Schnorr type code-based signature will be discussed.  Later\, we
  will give necessary condition to avoid the generic attacks and how to con
 struct Schnorr type code-based signature.  Finally\, the challenge of the 
 code-based cryptography will be discussed.\n\nRegister via Zoom Webinar: h
 ttps://nus-sg.zoom.us/webinar/register/WN_RuiGUWRtTI-3_u2xEMFKQw\n
LOCATION:https://researchseminars.org/talk/Cryptography/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yan Bo Ti (DSO National Laboratories)
DTSTART:20201007T074000Z
DTEND:20201007T082000Z
DTSTAMP:20260422T225757Z
UID:Cryptography/2
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/Cryptography
 /2/">Adaptive Attacks on Supersingular Isogeny Diffie Hellman</a>\nby Yan 
 Bo Ti (DSO National Laboratories) as part of Recent Developments in Crypto
 graphy (CRYPTO)\n\n\nAbstract\nThis talk introduces Supersingular Isogeny 
 Diffie--Hellman (SIDH) which is a candidate to be a post-quantum key excha
 nge protocol. An adaptive attack on SIDH will also be presented. The impli
 cation of such an attack is that static keys can be fully broken. As such\
 , countermeasures against this adaptive attack have been proposed. But can
  these new countermeasures be attacked yet again? Attendees of all backgro
 und are welcomed!\n\nRegister via Zoom Webinar: https://nus-sg.zoom.us/web
 inar/register/WN_RuiGUWRtTI-3_u2xEMFKQw\n
LOCATION:https://researchseminars.org/talk/Cryptography/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Divesh Aggarwal (National University of Singapore)
DTSTART:20201014T070000Z
DTEND:20201014T074000Z
DTSTAMP:20260422T225757Z
UID:Cryptography/3
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/Cryptography
 /3/">Slide Reduction Revisited: Filling the Gaps in Shortest Vector Proble
 m Approximation</a>\nby Divesh Aggarwal (National University of Singapore)
  as part of Recent Developments in Cryptography (CRYPTO)\n\n\nAbstract\nWe
  show a $2^{n/2 +o(n)}$-time algorithm that finds a (non-zero) vector in a
  lattice L with norm at most $\\sqrt{n}$ times the minimum of the length o
 f a shortest non-zero lattice vector and $det(L)^{1/n}$\n\nThe main techni
 cal contribution behind this result is new analysis of (a simpler variant 
 of) a $2^{n/2 +o(n)}$-time algorithm for SVP from STOC 2015\, which was on
 ly previously known to solve less useful problems. To achieve this\, we re
 ly crucially on the ``reverse Minkowski theorem'' conjectured and proved b
 y Dadush\, Regev\, and Stephens-Davidowitz (FOCS 2016\, STOC 2017).\n\nPre
 viously\, the fastest known algorithm for finding such a vector was the $2
 ^{0.802n +o(n)}$-time algorithm [LWXZ11]\, which actually gives a constant
  approximation of the shortest vector problem. Though we do not show how t
 o find lattice vectors with this length in time $2^{n/2 +o(n)}$\, we do sh
 ow that our algorithm suffices for the most important application of such 
 algorithms: basis reduction. In particular\, we show a modified version of
  Gama and Nguyen's slide-reduction algorithm (STOC 2008)\, which can be co
 mbined with the algorithm above to improve the time-length tradeoff for sh
 ortest-vector algorithms in nearly all regimes---including the regimes rel
 evant to cryptography.\n\nRegister via Zoom Webinar: https://nus-sg.zoom.u
 s/webinar/register/WN_7RjGZAw5T3GzYAkVq76q7A\n
LOCATION:https://researchseminars.org/talk/Cryptography/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Siang Meng Sim (DSO National Laboratories)
DTSTART:20201014T074000Z
DTEND:20201014T082000Z
DTSTAMP:20260422T225757Z
UID:Cryptography/4
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/Cryptography
 /4/">Lightweight Symmetric-key Cryptography</a>\nby Siang Meng Sim (DSO Na
 tional Laboratories) as part of Recent Developments in Cryptography (CRYPT
 O)\n\n\nAbstract\nSymmetric-key cryptography performs encryption and decry
 ption on data using the same secret key. Lightweight cryptography has been
  a rising topic along with the global development of very constrained comp
 uting devices. In this talk\, we introduce authenticated encryption\, a cl
 ass of symmetric-key cryptography that provides both confidentiality and a
 uthenticity simultaneously\, describe the problems that lightweight crypto
 graphy aims to solve and look at the latest development of lightweight aut
 henticated encryption.\n\nRegister via Zoom Webinar: https://nus-sg.zoom.u
 s/webinar/register/WN_7RjGZAw5T3GzYAkVq76q7A\n
LOCATION:https://researchseminars.org/talk/Cryptography/4/
END:VEVENT
END:VCALENDAR