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:20260425T012516Z
UID:Cryptography/1
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Crypt
 ography/1/">Rank Metric Code-based Cryptography</a>\nby Chik How Tan (Nati
 onal University of Singapore) as part of Recent Developments in Cryptograp
 hy (CRYPTO)\n\n\nAbstract\nRank metric code-based cryptography is one of a
 ctive post-quantum cryptography.  In this talk\, we present various techni
 ques on rank metric code-based encryption and signature.  The vulnerabilit
 y and attacks of Schnorr type code-based signature will be discussed.  Lat
 er\, we will give necessary condition to avoid the generic attacks and how
  to construct Schnorr type code-based signature.  Finally\, the challenge 
 of the code-based cryptography will be discussed.\n\nRegister via Zoom Web
 inar: https://nus-sg.zoom.us/webinar/register/WN_RuiGUWRtTI-3_u2xEMFKQw\n
LOCATION:https://stable.researchseminars.org/talk/Cryptography/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yan Bo Ti (DSO National Laboratories)
DTSTART:20201007T074000Z
DTEND:20201007T082000Z
DTSTAMP:20260425T012516Z
UID:Cryptography/2
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Crypt
 ography/2/">Adaptive Attacks on Supersingular Isogeny Diffie Hellman</a>\n
 by Yan Bo Ti (DSO National Laboratories) as part of Recent Developments in
  Cryptography (CRYPTO)\n\n\nAbstract\nThis talk introduces Supersingular I
 sogeny Diffie--Hellman (SIDH) which is a candidate to be a post-quantum ke
 y exchange protocol. An adaptive attack on SIDH will also be presented. Th
 e implication of such an attack is that static keys can be fully broken. A
 s such\, countermeasures against this adaptive attack have been proposed. 
 But can these new countermeasures be attacked yet again? Attendees of all 
 background are welcomed!\n\nRegister via Zoom Webinar: https://nus-sg.zoom
 .us/webinar/register/WN_RuiGUWRtTI-3_u2xEMFKQw\n
LOCATION:https://stable.researchseminars.org/talk/Cryptography/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Divesh Aggarwal (National University of Singapore)
DTSTART:20201014T070000Z
DTEND:20201014T074000Z
DTSTAMP:20260425T012516Z
UID:Cryptography/3
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Crypt
 ography/3/">Slide Reduction Revisited: Filling the Gaps in Shortest Vector
  Problem Approximation</a>\nby Divesh Aggarwal (National University of Sin
 gapore) as part of Recent Developments in Cryptography (CRYPTO)\n\n\nAbstr
 act\nWe show a $2^{n/2 +o(n)}$-time algorithm that finds a (non-zero) vect
 or in a lattice L with norm at most $\\sqrt{n}$ times the minimum of the l
 ength of a shortest non-zero lattice vector and $det(L)^{1/n}$\n\nThe main
  technical contribution behind this result is new analysis of (a simpler v
 ariant of) a $2^{n/2 +o(n)}$-time algorithm for SVP from STOC 2015\, which
  was only previously known to solve less useful problems. To achieve this\
 , we rely crucially on the ``reverse Minkowski theorem'' conjectured and p
 roved by Dadush\, Regev\, and Stephens-Davidowitz (FOCS 2016\, STOC 2017).
 \n\nPreviously\, the fastest known algorithm for finding such a vector was
  the $2^{0.802n +o(n)}$-time algorithm [LWXZ11]\, which actually gives a c
 onstant approximation of the shortest vector problem. Though we do not sho
 w how to find lattice vectors with this length in time $2^{n/2 +o(n)}$\, w
 e do show that our algorithm suffices for the most important application o
 f such algorithms: basis reduction. In particular\, we show a modified ver
 sion of Gama and Nguyen's slide-reduction algorithm (STOC 2008)\, which ca
 n be combined with the algorithm above to improve the time-length tradeoff
  for shortest-vector algorithms in nearly all regimes---including the regi
 mes relevant to cryptography.\n\nRegister via Zoom Webinar: https://nus-sg
 .zoom.us/webinar/register/WN_7RjGZAw5T3GzYAkVq76q7A\n
LOCATION:https://stable.researchseminars.org/talk/Cryptography/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Siang Meng Sim (DSO National Laboratories)
DTSTART:20201014T074000Z
DTEND:20201014T082000Z
DTSTAMP:20260425T012516Z
UID:Cryptography/4
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Crypt
 ography/4/">Lightweight Symmetric-key Cryptography</a>\nby Siang Meng Sim 
 (DSO National Laboratories) as part of Recent Developments in Cryptography
  (CRYPTO)\n\n\nAbstract\nSymmetric-key cryptography performs encryption an
 d decryption on data using the same secret key. Lightweight cryptography h
 as been a rising topic along with the global development of very constrain
 ed computing devices. In this talk\, we introduce authenticated encryption
 \, a class of symmetric-key cryptography that provides both confidentialit
 y and authenticity simultaneously\, describe the problems that lightweight
  cryptography aims to solve and look at the latest development of lightwei
 ght authenticated encryption.\n\nRegister via Zoom Webinar: https://nus-sg
 .zoom.us/webinar/register/WN_7RjGZAw5T3GzYAkVq76q7A\n
LOCATION:https://stable.researchseminars.org/talk/Cryptography/4/
END:VEVENT
END:VCALENDAR