BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Laboratoire de Mathématiques de Versailles - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Laboratoire de Mathématiques de Versailles
X-ORIGINAL-URL:https://lmv.math.cnrs.fr
X-WR-CALDESC:Évènements pour Laboratoire de Mathématiques de Versailles
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20240331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20241027T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20250330T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20251026T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20260329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20261025T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20251215T110000
DTEND;TZID=Europe/Paris:20251215T120000
DTSTAMP:20260404T054810
CREATED:20251126T151538Z
LAST-MODIFIED:20251215T155758Z
UID:14632-1765796400-1765800000@lmv.math.cnrs.fr
SUMMARY:CRYPTO: Monika Trimoska - Algebraic and combinatorial algorithms for equivalence problems
DESCRIPTION:Algebraic and combinatorial algorithms for equivalence problems \nBroadly\, an equivalence problem considers two instances of the same mathematical object and asks if there exists a map between them that preserves some defined property. \nTwo such problems will be looked at in detail in this talk. The matrix code equivalence problem takes as input two error-correcting codes in the rank metric and the map we are tasked to find is an isometry that preserves the rank of codewords. The second problem we are interested in is the alternating trilinear form equivalence\, where we are given two alternating trilinear forms and the goal is to find an isomorphism between them. \nWe first show how these two problems are similar\, namely that an alternating trilinear form can be viewed as a matrix code with special properties\, or that a matrix code can be viewed as a trilinear form without the alternating property. \nWe then present a survey of recent advances in solving these two problems both with purely algebraic algorithms and with combinatorial algorithms that have algebraic system solving as subroutines. The rising interest in these problems is due to their aptness for building a zero-knowledge-based identification scheme. As such\, these two problems\, alongside the code equivalence problem in the Hamming metric\, have been used as a hardness assumption in the design of the Fiat-Shamir-based digital signature schemes MEDS\, ALTEQ\, and LESS. \nLien Zoom:\nhttps://uvsq-fr.zoom.us/j/98084027666?pwd=KIxsp4qckAV0S8WdXkgKMNznFPhQxs.1\n\nID de réunion: 980 8402 7666\nCode secret: 862220
URL:https://lmv.math.cnrs.fr/evenenement/crypto-monika-trimoska-algebraic-and-combinatorial-algorithms-for-equivalence-problems/
LOCATION:Bâtiment Fermat\, salle 4205
CATEGORIES:Séminaire CRYPTO
END:VEVENT
END:VCALENDAR