BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//LORIA - ECPv6.17.4.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.loria.fr
X-WR-CALDESC:Évènements pour LORIA
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:20180325T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20181028T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20190331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20191027T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20200329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20201025T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190228T110000
DTEND;TZID=Europe/Paris:20190228T120000
DTSTAMP:20190227T110218Z
CREATED:20190227T110218Z
LAST-MODIFIED:20190227T110218Z
UID:6581-1551351600-1551355200@www.loria.fr
SUMMARY:MALOTEC Seminar : Marc Plantevit
DESCRIPTION:Next MALOTEC seminar will take place on Thursday\, February 28th at 11am in room A008. \nMarc Plantevit (Université Claude Bernard Lyon 1 – LIRIS – CNRS UMR 5205) will give a presentation entitled « Pattern Mining in Augmented Graphs ». \n  \nMarc Plantevit\nUniversité Claude Bernard Lyon 1\nData Mining and Machine Learning (DM2L)\nLIRIS – CNRS UMR 5205 \nTitle: Pattern Mining in Augmented Graphs \nAbstract: Graphs are a powerful mathematical abstraction that enables to depict many real world phenomena. Vertices describe entities and edges identify relations between entities. Such graphs are often augmented with additional pieces of information. For instance\, the vertices or the edges are enriched with attributes describing them and are called vertex (respectively edge) attributed graphs. Graphs can also be dynamic\, i.e.\, the structure and the values of vertex attributes may evolve through time. The discovery of patterns in such graphs may provide actionable insights and boost the user knowledge. In this talk\, I will discuss the different pattern domains for augmented graphs I contributed to define. This includes the discovery of exceptional attributed subgraphs in edge or vertex attributed graphs. Then\, I will discuss how to find patterns of higher interest by taking into account the domain knowledge\, user feedback and user’s prior knowledge through different examples. \nFor more information: https://perso.liris.cnrs.fr/mplantev/doku/
URL:https://www.loria.fr/event/malotec-seminar-marc-plantevit/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190228T133000
DTEND;TZID=Europe/Paris:20190228T150000
DTSTAMP:20190207T143456Z
CREATED:20190207T143456Z
LAST-MODIFIED:20190207T143456Z
UID:6519-1551360600-1551366000@www.loria.fr
SUMMARY:SSL Seminar : Aurore Guillevic
DESCRIPTION:Next SSL Seminar will take place on Thursday\, February 28th at 1.30 pm in room A008. \nAurore Guillevic (Caramba) will give a presentation entitled « Discrete logarithm computation in finite fields GF(p^k) with NFS variants and consequences in pairing-based cryptography. » \n \nAbstract:\nPairings on elliptic curves are involved in signatures\, NIZK\, and recently in blockchains (ZK-SNARKS).\nThese pairings take as input two points on an elliptic curve E over a finite field\, and output a value in an extension of that finite field.\nUsually for efficiency reasons\, this extension degree is a power of 2 and 3 (such as 12\,18\,24)\, and moreover the characteristic of the finite field has a special form. The security relies on the hardness of\ncomputing discrete logarithms in the group of points of the curve and in the finite field extension. \nIn 2013-2016\, new variants of the function field sieve and the number field sieve algorithms turned out to be faster in certain finite fields related to pairing-based cryptography. Now small characteristic settings\n(with GF(2^(4*n))\, GF(3^(6*m))) are discarded\, and the situation of GF(p^k) where p is prime and k is small (in practice from 2 to 54) is unclear.\nThe asymptotic complexity of the Number Field Sieve algorithm in finite fields GF(p^k) (where p is prime) and its Special and Tower variants is given by an asymptotic formula of the form A^(c+o(1)) where A depends on\nthe finite field size (log p^k)\, o(1) is unknown\, and c is a constant between 1.526 and 2.201 that depends on p\, k\, and the choice of parameters in the algorithm. \nIn this work we improve the approaches of Menezes-Sarkar-Singh and Barbulescu-Duquesne to estimate the cost of a hypothetical implementation of the Special-Tower-NFS in GF(p^k) for small k (k <= 24)\, and update some parameter sizes for pairing-based cryptography. \nThis is a joint work with Shashank Singh\, IISER Bhopal\, India. \nMore information about SSL Seminars
URL:https://www.loria.fr/event/ssl-seminar-aurore-guillevic/
CATEGORIES:Séminaire
END:VEVENT
END:VCALENDAR