BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Mingjie Chen (UC San Diego) DTSTART:20220214T230000Z DTEND:20220214T235000Z DTSTAMP:20260423T041511Z UID:UCLA_NTS/46 DESCRIPTION:Title: Orienteering with one endomorphism\nby Mingjie Chen (UC San Diego) a s part of UCLA Number Theory Seminar\n\n\nAbstract\nSupersingular isogeny- based cryptosystems are strong contenders for post-quantum cryptography st andardization. Such cryptosystems rely on the hardness of path-finding on supersingular isogeny graphs. The path-finding problem is known to reduce to the endomorphism ring problem. Can path-finding be reduced to knowing j ust one endomorphism? In this talk\, we give explicit classical and quantu m algorithms for path-finding to an initial curve using the knowledge of o ne endomorphism. An endomorphism gives an orientation of a supersingular e lliptic curve. We use the theory of oriented supersingular isogeny graphs and algorithms for taking ascending/descending/horizontal steps on such gr aphs.\n\npaper link: https://arxiv.org/pdf/2201.11079.pdf\n LOCATION:https://researchseminars.org/talk/UCLA_NTS/46/ END:VEVENT END:VCALENDAR